Question 1

A synonym for shadow price is ________.

Accepted Answer

The answer of A synonym for shadow price is ________....

Question 2

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

Accepted Answer

A) The points (100,0)and (0,25)both lie outside the feasible region. 
B) The two corner points are (33-1/3,8-1/3)and (50,0). 
C) The graphical origin (0,0)is not in the feasible region. 
D) The feasible region is a straight line segment,not an area. 
E) All of the above are true. 
A) The points (100,0)and (0,25)both lie outside the feasible region. 
B) The two corner points are (33-1/3,8-1/3)and (50,0). 
C) The graphical origin (0,0)is not in the feasible region. 
D) The feasible region is a straight line segment,not an area. 
E) All of the above are true.

Question 3

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 4

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) 2X2 + 7Y ≥ 50 
E) 2X × 7Y ≥ 650 
A) 2X ≥ 7X × Y 
B) 2X × 7Y ≥ 500 
C) 2X + 7Y ≥ 100 
D) 2X2 + 7Y ≥ 50 
E) 2X × 7Y ≥ 650

Question 5

What is the feasible region in a linear programming problem?

Accepted Answer

The feasible region

Question 6

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

Accepted Answer

postoptima

Question 7

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) 2Y - X = 15 
A) X + Y = 15 
B) X - Y = 10 
C) Y - X = 10 
D) 2X + Y = 10 
E) 2Y - X = 15

Question 8

The optimal solution of a linear programming problem that consists of two variables and six constraints will probably not satisfy all six constraints as equalities.

Accepted Answer

A) True 
 B)False

Question 9

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 10

A linear programming problem has three constraints: 2X + 10Y ≤ 1004X + 6Y ≤ 1206X + 3Y ≤ 90
What is the largest quantity of X that can be made without violating any of these constraints?

Accepted Answer

A) 50 
B) 30 
C) 20 
D) 15 
E) 10 
A) 50 
B) 30 
C) 20 
D) 15 
E) 10

Question 11

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.

Accepted Answer

Objective:Minimize cost = 5X + 3Y + 8Z w

Question 12

Suppose that 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 13

If cars (C sell for $500 profit and trucks (T)sell for $300 profit which of the following represents the objective function?

Accepted Answer

A) Maximize = 500C + 300T 
B) Minimize = 500C + 300T 
C) Maximize = 500C - 300T 
D) Minimize = 300T- 500C 
E) Minimize = 500T - 300C 
A) Maximize = 500C + 300T 
B) Minimize = 500C + 300T 
C) Maximize = 500C - 300T 
D) Minimize = 300T- 500C 
E) Minimize = 500T - 300C

Question 14

Two methods of solving linear programming problems by hand include the corner-point method and the ________.

Accepted Answer

iso-profit

Question 15

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

Accepted Answer

A) True 
 B)False

Question 16

Suppose that a constraint for assembly time has a shadow price of $50/hour for 15 hours in either direction and that all available assembly time is currently used (would require overtime to do more).If the salary of workers is $30 and they receive 50% extra pay for overtime what should management do?

Accepted Answer

Reducing assembly time would save $30/ho

Question 17

A stereo mail order centre has 8,000 cubic feet available for storage of its private label loudspeakers.The ZAR3 speakers cost $295 each and require 4 cubic feet of space;the ZAR2ax speakers cost $110 each and require 3 cubic feet of space;and the ZAR4 model costs $58 and requires 1 cubic foot of space.The demand for the ZAR3 is at most 20 units per month.The wholesaler has $100,000 to spend on loudspeakers this month.Each ZAR3 contributes $105,each ZAR2ax contributes $50,and each ZAR4 contributes $28.The objective is to maximize total contribution.Write out the objective and the constraints.

Accepted Answer

The objective is to maximize 105 ZAR3 +

Question 18

Suppose that an iso-profit line is given to be X + Y = 15.What would be the profit made from producing 20X and 10Y?

Accepted Answer

A) 15 
B) 30 
C) 0 
D) 20X and 10Y is not a feasible solution. 
E) Unable to determine. 
A) 15 
B) 30 
C) 0 
D) 20X and 10Y is not a feasible solution. 
E) Unable to determine.

Question 19

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) They all maximize the profit lines. 
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) They all maximize the profit lines.

Question 20

Suppose that a constraint is given by X + Y≤10.If another constraint is given to be 3X + 2Y≥15 determine the corners of the feasible solution.If the profit from X is 5 and the profit from Y is 10,determine the maximum profit.

Accepted Answer

Corners are (10,0), (5,0), (0,

Exam 22: Linear Programming

A synonym for shadow price is ________.

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

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

Which of the following represents valid constraints in linear programming?

What is the feasible region in a linear programming problem?

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

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?

The optimal solution of a linear programming problem that consists of two variables and six constraints will probably not satisfy all six constraints as equalities.

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.

A linear programming problem has three constraints: 2X + 10Y ≤ 1004X + 6Y ≤ 1206X + 3Y ≤ 90 What is the largest quantity of X that can be made without violating any of these constraints?

Suppose that 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?

If cars (C sell for $500 profit and trucks (T)sell for $300 profit which of the following represents the objective function?

Two methods of solving linear programming problems by hand include the corner-point method and the ________.

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

Suppose that an iso-profit line is given to be X + Y = 15.What would be the profit made from producing 20X and 10Y?

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

Suppose that a constraint is given by X + Y≤10.If another constraint is given to be 3X + 2Y≥15 determine the corners of the feasible solution.If the profit from X is 5 and the profit from Y is 10,determine the maximum profit.

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

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