Question 1

What are the requirements of all linear programming problems?

Accepted Answer

(1)maximization or minimization of an ob

Question 2

Which of the following correctly describes all iso-profit lines for an LP maximization problem?

Accepted Answer

A) They all pass through the origin 
B) They are all parallel. 
C) They all pass through the point of maximum profit. 
D) Each line passes through at least 2 corners. 
E) all of the above 
A) They all pass through the origin 
B) They are all parallel. 
C) They all pass through the point of maximum profit. 
D) Each line passes through at least 2 corners. 
E) all of the above

Question 3

A financial advisor is about to build an investment portfolio for a client who has $100,000 to invest.The four investments available are A,B,C,and D.Investment A will earn 4 percent and has a risk of two "points" per $1,000 invested.B earns 6 percent with 3 risk points;C earns 9 percent with 7 risk points;and D earns 11 percent with a risk of 8.The client has put the following conditions on the investments: A is to be no more than one-half of the total invested.A cannot be less than 20 percent of the total investment.D cannot be less than C.Total risk points must be at or below 1,000.
Let A be the amount invested in investment A,and define B,C,and D similarly.
Formulate the linear programming model.

Accepted Answer

Maximize return = 0.04A + 0.06B + 0.09C

Question 4

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/100 grams,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.The feedlot can get no more than 200 grams per day per cow of any of the feed types.Formulate the problem as a linear program.

Accepted Answer

Let X,Y,Z be number of grams of each res

Question 5

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 6

In the graphical solution to a linear program,the region that satisfies the constraint 4X + 15Z ≥ 1000 includes the origin of the graph.

Accepted Answer

A) True 
 B)False

Question 7

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 8

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

Accepted Answer

The answer of The ________ is the set of all...

Question 9

A firm makes two products,Y and Z.Each unit of Y costs $10 and sells for $40.Each unit of Z costs $5 and sells for $25.If the firm's goal were to maximize profit,what would be the appropriate objective function?

Accepted Answer

A) Maximize profit = $40Y = $25Z 
B) Maximize profit = $40Y + $25Z 
C) Maximize profit = $30Y + $20Z 
D) Maximize profit = 0.25Y + 0.20Z 
E) Maximize profit = $50(Y + Z) 
A) Maximize profit = $40Y = $25Z 
B) Maximize profit = $40Y + $25Z 
C) Maximize profit = $30Y + $20Z 
D) Maximize profit = 0.25Y + 0.20Z 
E) Maximize profit = $50(Y + Z)

Question 10

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

Accepted Answer

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. 
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.

Question 11

The diet problem is known in agricultural applications as the:

Accepted Answer

A) fertilizer problem. 
B) feed-mix problem. 
C) crop-rotation problem. 
D) egg-choice problem. 
E) genetic-transformation problem. 
A) fertilizer problem. 
B) feed-mix problem. 
C) crop-rotation problem. 
D) egg-choice problem. 
E) genetic-transformation problem.

Question 12

Linear programming is an appropriate problem-solving technique for decisions that have no alternative courses of action.

Accepted Answer

A) True 
 B)False

Question 13

Identify three examples of resources that are typically constrained in a linear programming problem.

Accepted Answer

The textbook gives m

Question 14

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?

Accepted Answer

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

Question 15

A difference between minimization and maximization problems is that:

Accepted Answer

A) minimization problems cannot be solved with the corner-point method. 
B) maximization problems often have unbounded regions. 
C) minimization problems often have unbounded regions. 
D) minimization problems cannot have shadow prices. 
E) minimization problems are more difficult to solve than maximization problems. 
A) minimization problems cannot be solved with the corner-point method. 
B) maximization problems often have unbounded regions. 
C) minimization problems often have unbounded regions. 
D) minimization problems cannot have shadow prices. 
E) minimization problems are more difficult to solve than maximization problems.

Question 16

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 labor 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 labor 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 17

A linear programming problem contains a restriction that reads "the quantity of Q must be at least as large as the sum of R,S,and T." Formulate this as a linear programming constraint.

Accepted Answer

Q ≥ R + S

Question 18

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,w

Question 19

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.

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

the postop

Exam 23: Linear Programming

What are the requirements of all linear programming problems?

Which of the following correctly describes all iso-profit lines for an LP maximization problem?

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 the graphical solution to a linear program,the region that satisfies the constraint 4X + 15Z ≥ 1000 includes the origin of the graph.

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

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

A firm makes two products,Y and Z.Each unit of Y costs $10 and sells for $40.Each unit of Z costs $5 and sells for $25.If the firm's goal were to maximize profit,what would be the appropriate objective function?

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

The diet problem is known in agricultural applications as the:

Linear programming is an appropriate problem-solving technique for decisions that have no alternative courses of action.

Identify three examples of resources that are typically constrained in a linear programming problem.

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 difference between minimization and maximization problems is that:

In which of the following has LP been applied successfully?

A linear programming problem contains a restriction that reads "the quantity of Q must be at least as large as the sum of R,S,and T." Formulate this as a linear programming constraint.

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.

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

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategy

Location Strategies

Layout Strategies

Human Resources,job Design,and Work Measurement

Supply Chain Management

Inventory Management

Aggregate Planning and Sop

Material Requirements Planning Mrpand Erp

Short-Term Scheduling

Jit,tps,and Lean Operations

Maintenance and Reliability

Sustainability in the Supply Chain

Statistical Process Control

Capacity and Constraint Management

Supply Chain Management Analytics

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Filters

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