Filters
Question type

Suppose that the feasible region of a maximization LP problem has corners of (0,0) , (5,0) ,and (0,5) .How many possible combinations of X and Y will yield the maximum profit if profit is given to be 5X + 5Y?


A) 0
B) 1
C) 2
D) 5
E) Infinite

F) A) and B)
G) B) and E)

Correct Answer

verifed

verified

Phil Bert's Nuthouse is preparing a new product,a blend of mixed nuts.The product must be at most 50 percent peanuts,must have more almonds than cashews,and must be at least 10 percent pecans.The blend will be sold in one-pound bags.Phil's goal is to mix the nuts in such a manner that all conditions are satisfied and the cost per bag is minimized.Peanuts cost $1 per pound.Cashews cost $3 per pound.Almonds cost $5 per pound and pecans cost $6 per pound.Formulate this problem as a linear program.

Correct Answer

verifed

verified

Call the variables PN,AL,CA,and PC
Minim...

View Answer

Linear programming helps operations managers make decisions necessary to make effective use of resources such as machinery,labor,money,time,and raw materials.

A) True
B) False

Correct Answer

verifed

verified

A linear programming problem contains a restriction that reads "the quantity of X must be at least three times as large as the quantity of Y." Which of the following inequalities is the proper formulation of this constraint?


A) 3X ≥ Y
B) X ≤ 3Y
C) X + Y ≥ 3
D) X - 3Y ≥ 0
E) 3X ≤ Y

F) All of the above
G) B) and E)

Correct Answer

verifed

verified

In linear programming,statements such as "the blend must consist of at least 10% of ingredient A,at least 30% of ingredient B,and no more than 50% of ingredient C" can be made into valid constraints even though the percentages do not add up to 100 percent.

A) True
B) False

Correct Answer

verifed

verified

Which of the following is not a requirement of a linear programming problem?


A) an objective function,expressed in linear terms
B) constraints,expressed as linear equations or inequalities
C) an objective function to be maximized or minimized
D) alternative courses of action
E) one constraint or resource limit for each decision variable

F) None of the above
G) B) and E)

Correct Answer

verifed

verified

________ is an analysis that projects how much a solution might change if there were changes in the variables or input data.

Correct Answer

verifed

verified

Sensitivit...

View Answer

In linear programming,if there are three constraints,each representing a resource that can be used up,the optimal solution must use up all of each of the three resources.

A) True
B) False

Correct Answer

verifed

verified

In linear programming,a statement such as "maximize contribution" becomes an objective function when the problem is formulated.

A) True
B) False

Correct Answer

verifed

verified

The optimal solution to a linear programming problem lies within the feasible region.

A) True
B) False

Correct Answer

verifed

verified

The ________ is the set of all feasible combinations of the decision variables.

Correct Answer

verifed

verified

Two methods of conducting sensitivity analysis on solved linear programming problems are ________ and ________.

Correct Answer

verifed

verified

the postop...

View Answer

In a linear programming formulation,a statement such as "maximize contribution" becomes a(n) :


A) constraint.
B) slack variable.
C) objective function.
D) violation of linearity.
E) decision variable.

F) A) and B)
G) C) and D)

Correct Answer

verifed

verified

What combination of x and y will yield the optimum for this problem? Maximize $3x + $15y,subject to (1) 2x + 4y ≤ 12 and (2) 5x + 2y ≤ 10 and (3) x,y ≥ 0.


A) x = 2,y = 0
B) x = 0,y = 3
C) x = 0,y = 0
D) x = 1,y = 5
E) x = 0,y = 5

F) A) and D)
G) B) and D)

Correct Answer

verifed

verified

What is the region that satisfies all of the constraints in linear programming called?


A) area of optimal solutions
B) area of feasible solutions
C) profit maximization space
D) region of optimality
E) region of non-negativity

F) A) and E)
G) A) and D)

Correct Answer

verifed

verified

The feasible region in the diagram below is consistent with which one of the following constraints? The feasible region in the diagram below is consistent with which one of the following constraints?   A) 8X1 + 4X2 ≤ 160 B) 8X1 + 4X2 ≥ 160 C) 4X1 + 8X2 ≤ 160 D) 8X1 - 4X2 ≤ 160 E) 4X1 - 8X2 ≤ 160


A) 8X1 + 4X2 ≤ 160
B) 8X1 + 4X2 ≥ 160
C) 4X1 + 8X2 ≤ 160
D) 8X1 - 4X2 ≤ 160
E) 4X1 - 8X2 ≤ 160

F) B) and D)
G) B) and E)

Correct Answer

verifed

verified

Which of the following sets of constraints results in an unbounded maximization problem?


A) X + Y ≥ 100 and X + Y ≤ 50
B) X + Y ≥ 15 and X - Y ≤ 10
C) X + Y ≤ 10 and X ≥ 5
D) X ≤ 10 and Y ≤ 20
E) All of the above have a bounded maximum.

F) C) and E)
G) C) and D)

Correct Answer

verifed

verified

Suppose that the shadow price for assembly time is $5/hour.The allowable increase for the assembly time constraint is 40 hours,and the allowable decrease is 30 hours.If all assembly hours were used under the initial LP solution and workers normally make $4/hour but can work overtime for $6/hour,what should management do?


A) do not change available hours for assembly time
B) decrease available hours for assembly time by 30 hours
C) increase available hours for assembly time by 40 hours
D) decrease available hours for assembly time by 5 hours
E) increase available hours for assembly time by 5 hours

F) C) and D)
G) None of the above

Correct Answer

verifed

verified

What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b,subject to (1) 4a + 2b ≤ 12 and (2) 5a + 2b ≤ 20 and (3) x,y ≥ 0.


A) a = 0,b = 0
B) a = 3,b = 3
C) a = 0,b = 6
D) a = 6,b = 0
E) a = 0,b = 10

F) C) and D)
G) A) and D)

Correct Answer

verifed

verified

Which of the following is an algorithm for solving linear programming problems of all sizes?


A) duplex method
B) multiplex method
C) shadow price method
D) simplex method
E) decision tree method

F) B) and D)
G) A) and D)

Correct Answer

verifed

verified

Showing 41 - 60 of 88

Related Exams

Show Answer