Applied Decision

docx

School

Texas A&M University, Commerce *

*We aren’t endorsed by this school

Course

542

Subject

Industrial Engineering

Date

Dec 6, 2023

Type

docx

Pages

5

Uploaded by Coach_Rock_Coyote8

Report
Question 1 (1 point) Which statement is incorrect? The decision variable values that either maximize or minimize can be found on the extreme points of a feasible region. The values outside of a feasible region should not be used in the objective function. A feasible region contains all possible values for the decision variables. A feasible region stays the same when constraints change. Question 2 (1 point) A manager has only 200 tons of plastic for his company. This is an example of a(n)___________ decision. constraint. parameter. objective. Question 3 (1 point) The cross point between two constraints is called _________. maximum point zero point extreme point minimum point Question 4 (1 point) Limited resources are modeled in optimization problems as_____________ decision variables. alternatives. constraints. an objective function. Question 5 (1 point) The constraints X1 ≥ 0 and X2 ≥ 0 are referred to as _____________ nonnegativity conditions. optimality conditions.
positivity constraints. left hand sides. Question 6 (1 point) The constraints of an optimization model define the ___________ maximal region opportunity region practical region feasible region Question 7 (1 point) If there is a maximum of 4,000 hours of labor available per month and 300 standard bags (x1) or 125 deluxe bags (x2) can be produced per hour of labor, which of the following constraints reflects this situation? 300 x1 + 125 x2 = 4,000 300 x1 + 125 x2 > 4,000 300 x1 + 125 x2 <= 4,000 425(x1 + x2) < 4,000 Question 8 (1 point) What is the goal in optimization? Find the decision variable values that result in the best objective function and satisfy all constraints. Find the values of the decision variables that use all available resources Find the values of the decision variables that satisfy all constraints. None of these. Question 9 (1 point) If a new constraint is added to an optimization model, the feasible solution space will generally ____ increase. decrease. remain the same. become more feasible. Question 10 (1 point)
The constraint for resource 1 is 5*X + 4*Y ≥ 200. If Y = 20, what it the minimum value for X? 24 28 20 40 Question 11 (1 point) Which statement is correct? Constraints refer to the limited resources facing a business. Decision variables can not be changed. Only minimization is considered a valid objective function. Only maximization is considered a valid objective function. Question 12 (1 point) A company makes two products, X1 and X2. They require at least 20 of each be produced. Which set of lower bound constraints reflect this requirement? X1 ≥ 20, X2 ≥ 20 X1 ≥ 20, X2 ≥ 20, X1 + X2 ≤ 40 X1 + X2 ≥ 40 X1 + X2 ≥ 20 Question 13 (1 point) A redundant constraint is one which ________________ is added after the problem is already formulated. can only increase the objective function value. plays no role in determining the feasible region of the problem. is parallel to the level curve. Question 14 (1 point) Which of the following is a valid objective function for a linear optimization analysis? MAX: 2XY MIN: 2X/3Y MAX:2X/Y
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
MIN: 2X+3Y Question 15 (1 point) What are the three common elements of an optimization problem? objectives, resources, goals. decision variables, profit levels, costs. decisions, resource requirements, a profit function. decisions, constraints, an objective. Question 16 (1 point) The maximization or minimization of a quantity refers to the ____________. objective of optimization analyses slack of optimization analyses decision variables of optimization analyses constraints of optimization analyses Question 17 (1 point) The following linear programming problem has been written to plan the production of two products. The company wants to maximize its profits. X1 = number of product 1 produced in each batch X2 = number of product 2 produced in each batch MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 ≤ 200 3 X1 + 7 X2 ≤ 175 X1, X2 ≥ 0 How much profit is earned if the company produces 10 units of product 1 and 5 units of product 2? 2500 2750 3250 750 Question 18 (1 point)
The constraint for resource 1 is 5*X + 4*Y ≤ 200. If X = 20, what it the maximum value for Y? 50 40 25 20 Question 19 (1 point) The following linear programming problem has been written to plan the production of two products. The company wants to maximize its profits. X1 = number of product 1 produced in each batch X2 = number of product 2 produced in each batch MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 ≤ 200 3 X1 + 7 X2 ≤ 175 X1, X2 ≥ 0 How much profit is earned per each unit of product 2 produced? 175 250 150 200 Question 20 (1 point) All linear optimization problems have all of the following properties EXCEPT ______ alternative optimal solutions. variables that are all restricted to nonnegative values. linear objective function that is to be maximized or minimized. a set of linear constraints.