Question 1

Which of the following combinations of constraints has no feasible region?

Accepted Answer

A) X + Y > 15 and X - Y 5 and X > 10 C) X > 10 and Y > 20 D) X + Y > 100 and X + Y < 50 E) All of the above have a feasible region. A) X + Y > 15 and X - Y 5 and X > 10 C) X > 10 and Y > 20 D) X + Y > 100 and X + Y < 50 E) All of the above have a feasible region.

Question 2

A linear programming problem contains a restriction that reads "the quantity of Q must be no larger than the sum of R,S,and T." Formulate this as a constraint ready for use in problem solving software.

Accepted Answer

A) Q + R + S + T ≤ 4 
B) Q ≥ R + S + T 
C) Q - R - S - T ≤ 0 
D) Q / (R + S + T)≤ 0 
E) Q × (R + S + T)≤ 4 
A) Q + R + S + T ≤ 4 
B) Q ≥ R + S + T 
C) Q - R - S - T ≤ 0 
D) Q / (R + S + T)≤ 0 
E) Q × (R + S + T)≤ 4

Question 3

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

Accepted Answer

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

Question 4

A linear programming maximization problem has been solved.In the optimal solution,two resources are scarce.If an added amount could be found for only one of these resources,how would the optimal solution be changed?

Accepted Answer

A) The shadow price of the added resource will rise. 
B) The solution stays the same;the extra resource can't be used without more of the other scarce resource. 
C) The extra resource will cause the value of the objective to fall. 
D) The optimal mix will be rearranged to use the added resource,and the value of the objective function will rise. 
E) The extra resource will cause the value of the objective to rise. 
A) The shadow price of the added resource will rise. 
B) The solution stays the same;the extra resource can't be used without more of the other scarce resource. 
C) The extra resource will cause the value of the objective to fall. 
D) The optimal mix will be rearranged to use the added resource,and the value of the objective function will rise. 
E) The extra resource will cause the value of the objective to rise.

Question 5

The graphical method of solving linear programming can handle only maximizing problems.

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

A linear programming problem has two constraints 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100,plus nonnegativity constraints on X and Y.Which of the following statements about its feasible region is true?

Accepted Answer

A) There are four corner points including (50,0)and (0,12.5). 
B) The two corner points are (0,0)and (50,12.5). 
C) The graphical origin (0,0)is not in the feasible region. 
D) The feasible region includes all points that satisfy one constraint,the other,or both. 
E) The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized. 
A) There are four corner points including (50,0)and (0,12.5). 
B) The two corner points are (0,0)and (50,12.5). 
C) The graphical origin (0,0)is not in the feasible region. 
D) The feasible region includes all points that satisfy one constraint,the other,or both. 
E) The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized.

Question 8

In sensitivity analysis,a zero shadow price (or dual value)for a resource ordinarily means that the resource has not been used up.

Accepted Answer

A) True 
 B)False

Question 9

Sensitivity analysis of linear programming solutions can use trial and error or the analytic postoptimality method.

Accepted Answer

A) True 
 B)False

Question 10

Rienzi Farms grows sugar cane and soybeans on its 500 acres of land.An acre of soybeans brings a $1000 contribution to overhead and profit;an acre of sugar cane has a contribution of $2000.Because of a government program no more than 200 acres may be planted in soybeans.During the planting season 1200 hours of planting time will be available.Each acre of soybeans requires 2 hours,while each acre of sugar cane requires 5 hours.The company seeks maximum contribution (profit)from its planting decision.
a.Algebraically state the decision variables,objective and constraints.
b.Plot the constraints
c.Solve graphically,using the corner-point method.

Accepted Answer

The problem statement is contained in th

Question 11

Suppose an LP problem was subject to constraints of
2X + Y> 10
X + 3Y> 20
Suppose that a new constraint is added,of the form 3X + A ∗ Y> 90.What is the largest value that A can have so that this new constraint is redundant?

Accepted Answer

Students should recognize that both this

Question 12

What is sensitivity analysis?

Accepted Answer

Sensitivity analysis projects

Question 13

For the two constraints given below,which point is in the feasible region of this minimization problem? (1)14x + 6y > 42 (2)x - y > 3

Accepted Answer

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

Question 14

What are corner points? What is their relevance to solving linear programming problems?

Accepted Answer

Corner points are the intersections of t

Question 15

What is linear programming?

Accepted Answer

Linear programming is a mathem

Question 16

Suppose that a maximization LP problem has corners of (0,0), (10,0), (5,5),and (0,7).If profit is given to be X + 2Y what is the maximum profit the company can earn?

Accepted Answer

A) $0 
B) $10 
C) $15 
D) $14 
E) $12 
A) $0 
B) $10 
C) $15 
D) $14 
E) $12

Question 17

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

Accepted Answer

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

Question 18

A shadow price (or dual value)reflects which of the following in a maximization problem?

Accepted Answer

A) the marginal gain in the objective realized by subtracting one unit of a resource 
B) the market price that must be paid to obtain additional resources 
C) the increase in profit that would accompany one added unit of a scarce resource 
D) the reduction in cost that would accompany a one unit decrease in the resource 
E) the cost level that must be achieved for profitability 
A) the marginal gain in the objective realized by subtracting one unit of a resource 
B) the market price that must be paid to obtain additional resources 
C) the increase in profit that would accompany one added unit of a scarce resource 
D) the reduction in cost that would accompany a one unit decrease in the resource 
E) the cost level that must be achieved for profitability

Question 19

In which of the following has LP been applied successfully?

Accepted Answer

A) minimizing distance traveled by school buses carrying children 
B) minimizing 911 response time for police patrols 
C) minimizing labour costs for bank tellers while maintaining service levels 
D) determining the distribution system for multiple warehouses to multiple destinations 
E) all of the above 
A) minimizing distance traveled by school buses carrying children 
B) minimizing 911 response time for police patrols 
C) minimizing labour costs for bank tellers while maintaining service levels 
D) determining the distribution system for multiple warehouses to multiple destinations 
E) all of the above

Question 20

Using the iso-profit line solution method to solve a maximization problem requires that we

Accepted Answer

A) find the value of the objective function at the origin. 
B) move the iso-profit line away from the origin until it barely touches some part of the feasible region. 
C) move the iso-cost line to the lowest level that still touches some part of the feasible region. 
D) test the objective function value of every corner point in the feasible region. 
E) none of the above. 
A) find the value of the objective function at the origin. 
B) move the iso-profit line away from the origin until it barely touches some part of the feasible region. 
C) move the iso-cost line to the lowest level that still touches some part of the feasible region. 
D) test the objective function value of every corner point in the feasible region. 
E) none of the above.

Exam 22: Linear Programming

Which of the following combinations of constraints has no feasible region?

A linear programming problem contains a restriction that reads "the quantity of Q must be no larger than the sum of R,S,and T." Formulate this as a constraint ready for use in problem solving software.

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

A linear programming maximization problem has been solved.In the optimal solution,two resources are scarce.If an added amount could be found for only one of these resources,how would the optimal solution be changed?

The graphical method of solving linear programming can handle only maximizing problems.

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

A linear programming problem has two constraints 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100,plus nonnegativity constraints on X and Y.Which of the following statements about its feasible region is true?

In sensitivity analysis,a zero shadow price (or dual value)for a resource ordinarily means that the resource has not been used up.

Sensitivity analysis of linear programming solutions can use trial and error or the analytic postoptimality method.

Suppose an LP problem was subject to constraints of 2X + Y> 10 X + 3Y> 20 Suppose that a new constraint is added,of the form 3X + A ∗ Y> 90.What is the largest value that A can have so that this new constraint is redundant?

What is sensitivity analysis?

For the two constraints given below,which point is in the feasible region of this minimization problem? (1)14x + 6y > 42 (2)x - y > 3

What are corner points? What is their relevance to solving linear programming problems?

What is linear programming?

Suppose that a maximization LP problem has corners of (0,0), (10,0), (5,5),and (0,7).If profit is given to be X + 2Y what is the maximum profit the company can earn?

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

A shadow price (or dual value)reflects which of the following in a maximization problem?

In which of the following has LP been applied successfully?

Using the iso-profit line solution method to solve a maximization problem requires that we

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Sustainability in the Supply Chain and Design of Goods and Services

Managing Quality

Process Strategy and Sustainability

Location Strategies

Layout Strategies

Human Resources,job Design,and Work Measurement

Supply-Chain Management

Inventory Management

Aggregate Planning

Material Requirements Planning Mrpand ERP

Short-Term Scheduling

Jit and Lean Operations

Maintenance and Reliability

Statistical Process Control

Capacity and Constraint Management

Supply Chain Management Analytics

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Filters