Question 1

__________ are restrictions that limit the degree to which a manager can pursue an objective.

Accepted Answer

The answer of __________ are restrictions that limit the degree...

Question 2

In terms of linear programming, the fact that the solution is infeasible implies that the "profit" can increase without limit.

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

Sensitivit

Question 4

The __________ is a mathematical expression in linear programming that maximizes or minimizes some quantity.

Accepted Answer

The answer of The __________ is a mathematical expression in...

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

Corner points are the intersections of t

Question 7

A craftsman builds two kinds of birdhouses, one for wrens (X1), and one for bluebirds (X2). Each wren birdhouse takes four hours of labor and four units of lumber. Each bluebird house requires two hours of labor and twelve units of lumber. The craftsman has available 60 hours of labor and 120 units of lumber. Wren houses profit $6 each and bluebird houses profit $15 each.
Use the software output that follows to interpret the problem solution. Include a statement of the solution quantities (how many of which product), a statement of the maximum profit achieved by your product mix, and a statement of "resources unused" and "shadow prices."

Accepted Answer

The optimal solution is X1 = 12, X2 = 6,

Question 8

What is the simplex method?

Accepted Answer

The simplex method i

Question 9

A feedlot is trying to decide on the lowest cost mix that will still provide adequate nutrition for its cattle. Suppose that the numbers in the chart represent the number of grams of ingredient per 100 grams of feed and that the cost of Feed X is $5/100grams, Feed Y is $3/100grams, and Feed X is $8/100 grams. Each cow will need 50 grams of A per day, 20 grams of B, 30 grams of C, and 10 grams of D. If the feedlot can get no more than 200 grams per day per cow of any of the feed types determine the constraints governing the problem.
 $$\begin{array} { | l | l | l | l | } 
\hline \text { Ingredient } & \text { X } & \text { Y } & Z \
\hline \mathrm { A } & 10 & 15 & 5 \
\hline \mathrm { B } & 30 & 10 & 20 \
\hline \mathrm { C } & 40 & 0 & 20 \
\hline \mathrm { D } & 0 & 20 & 30 \
\hline
\end{array}$$

Accepted Answer

To determine the constraints for the low

Question 10

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 11

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. Identify the decision variables of this problem. Write out the objective and the set of constraints for the problem. Do not solve.

Accepted Answer

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

Question 12

Suppose that an iso-profit line is given to be X+Y=10. Which of the following represents another iso-profit line for the same scenario?

Accepted Answer

A)  X+Y=15 
B)  X-Y=10 
C)  Y-X=10 
D)  2X+Y=10 
E)  None of the above 
A)  X+Y=15 
B)  X-Y=10 
C)  Y-X=10 
D)  2X+Y=10 
E)  None of the above

Question 13

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.

Accepted Answer

A) True 
 B)False

Question 14

Sensitivity analysis helps to

Accepted Answer

A)  see the value of increased scarce resources 
B)  determine even better solutions 
C)  see the impact of parameter changes 
D)  A and C 
E)  A, B, and C 
A)  see the value of increased scarce resources 
B)  determine even better solutions 
C)  see the impact of parameter changes 
D)  A and C 
E)  A, B, and C

Question 15

A linear programming problem contains a restriction that reads "the quantity of X must be at least twice as large as the quantity of Y." Formulate this as a constraint ready for use in problem solving software.

Accepted Answer

The quoted sentence translates into the

Question 16

The region that satisfies all of the constraints in graphical linear programming is called the region of optimality.

Accepted Answer

A) True 
 B)False

Question 17

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)  none of the above 
A)  Q + R + S + T ≤ 4 
B)  Q ≥ R + S + T 
C)  Q - R - S - T ≤ 0 
D)  Q / (R + S + T) ≤ 0 
E)  none of the above

Question 18

A linear programming problem contains a restriction that reads "the quantity of S must be no less than one-fourth as large as T and U combined." Formulate this as a constraint ready for use in problem solving software.

Accepted Answer

A)  S / (T + U) ≥ 4 
B)  S - .25T -.25U ≥ 0 
C)  4S ≤ T + U 
D)  S ≥ 4T / 4U 
E)  none of the above 
A)  S / (T + U) ≥ 4 
B)  S - .25T -.25U ≥ 0 
C)  4S ≤ T + U 
D)  S ≥ 4T / 4U 
E)  none of the above

Question 19

Which of the following represents valid constraints in linear programming?

Accepted Answer

A)  2X ≥ 7X × Y 
B)  2X × 7Y ≥ 500 
C)  2X + 7Y ≥100 
D)  2X² + 7Y ≥ 50 
E)  All of the above are valid linear programming constraints. 
A)  2X ≥ 7X × Y 
B)  2X × 7Y ≥ 500 
C)  2X + 7Y ≥100 
D)  2X² + 7Y ≥ 50 
E)  All of the above are valid linear programming constraints.

Question 20

The corner-point solution method requires

Accepted Answer

A)  identifying the corner of the feasible region that has the sharpest angle 
B)  moving the iso-profit line to the highest level that still touches some part of the feasible region 
C)  moving the iso-profit line to the lowest level that still touches some part of the feasible region 
D)  finding the coordinates at each corner of the feasible solution space 
E)  none of the above 
A)  identifying the corner of the feasible region that has the sharpest angle 
B)  moving the iso-profit line to the highest level that still touches some part of the feasible region 
C)  moving the iso-profit line to the lowest level that still touches some part of the feasible region 
D)  finding the coordinates at each corner of the feasible solution space 
E)  none of the above

Exam 22: Linear Programming

__________ are restrictions that limit the degree to which a manager can pursue an objective.

In terms of linear programming, the fact that the solution is infeasible implies that the "profit" can increase without limit.

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

The __________ is a mathematical expression in linear programming that maximizes or minimizes some quantity.

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

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

What is the simplex 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?

Suppose that an iso-profit line is given to be X+Y=10. Which of the following represents another iso-profit line for the same scenario?

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.

Sensitivity analysis helps to

A linear programming problem contains a restriction that reads "the quantity of X must be at least twice as large as the quantity of Y." Formulate this as a constraint ready for use in problem solving software.

The region that satisfies all of the constraints in graphical linear programming is called the region of optimality.

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.

A linear programming problem contains a restriction that reads "the quantity of S must be no less than one-fourth as large as T and U combined." Formulate this as a constraint ready for use in problem solving software.

Which of the following represents valid constraints in linear programming?

The corner-point solution method requires

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Statistical Process Control

Process Strategy

Capacity and Constraint Management

Location Strategies

Layout Strategies

Human Resources, Job Design, and Work Measurement

Supply-Chain Management

Outsourcing as a Supply-Chain Strategy

Inventory Management

Aggregate Planning

Material Requirements Planning MRP and ERP

Short-Term Scheduling

Just-In-Time and Lean Options

Maintenance and Reliability

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Filters