Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

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

Question 3

The Queen City Nursery manufactures bags of potting soil from compost and topsoil. Each cubic foot of compost costs 20 cents and contains 4 pounds of sand, 3 pounds of clay, and 5 pounds of humus. Each cubic foot of topsoil costs 30 cents and contains 3 pounds of sand, 5 pounds of clay, and 7 pounds of humus. Each bag of potting soil must contain at least 12 pounds of sand, at least 15 pounds of clay, and at least 10 pounds of humus. Formulate the problem as a linear program. Plot the constraints and identify the feasible region. Graphically or with corner points find the best combination of compost and topsoil that meets the stated conditions at the lowest cost per bag. Identify the lowest cost possible.

Accepted Answer

Let C = cubic feet of compost used per b

Question 4

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 5

The requirements of linear programming problems include an objective function, the presence of constraints, objective and constraints expressed in linear equalities or inequalities, and ________.

Accepted Answer

alternativ

Question 6

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

Accepted Answer

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

Question 7

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

Accepted Answer

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

Question 8

In a linear programming formulation, 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 9

One requirement of a linear programming problem is that the objective function must be expressed as a linear function.

Accepted Answer

A) True 
 B)False

Question 10

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" cannot be made into valid constraints because the percentages do not add up to 100 percent.

Accepted Answer

A) True 
 B)False

Question 11

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 12

What is linear programming?

Accepted Answer

Linear programming is a mathem

Question 13

A manager must decide on the mix of products to produce for the coming week. Product A requires three minutes per unit for molding, two minutes per unit for painting, and two minutes for packing. Product B requires two minutes per unit for molding, four minutes for painting, and three minutes per unit for packing. There will be 600 minutes available for molding, 720 minutes for painting, and 480 minutes for packing. Both products have contributions of $1.50 per unit.
(a) Algebraically state the objective and constraints of this problem.
(b) Plot the constraints on the grid below and identify the feasible region.

Accepted Answer

The objective of the problem i

Question 14

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

Question 15

A linear programming problem has three constraints, plus nonnegativity constraints on X and Y. The constraints are: 2X + 10Y ≤ 100; 4X + 6Y ≤ 100; 6X + 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)  25 
D)  15 
E)  10 
A)  50 
B)  30 
C)  25 
D)  15 
E)  10

Question 16

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 300 acres may be planted in soybeans. During the planting season 1500 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. What is the maximum profit?

Accepted Answer

A)  $1,000,000 
B)  $700,000 
C)  $660,000 
D)  $600,000 
E)  $300,000 
A)  $1,000,000 
B)  $700,000 
C)  $660,000 
D)  $600,000 
E)  $300,000

Question 17

Based on the number of meals sold per day, Mr. Parker, the food service director at Woodland College, has determined that the following number of workers is needed for each day of the week:
   Assume each worker will work consecutively for 5 days followed by 2 days off. Formulate the problem as an LP for Mr. Parker to minimize the total number of workers that must be hired.

Accepted Answer

Let S1 be the number of workers working

Question 18

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 $2500. Because of a government program no more than 150 acres may be planted in soybeans. During the planting season 1800 hours of planting time will be available. Each acre of soybeans requires 2 hours, while each acre of sugar cane requires 6 hours. The company seeks maximum contribution (profit) from its planting decision.
(a) Formulate the problem as a linear program.
(b) Solve using the corner-point method.

Accepted Answer

Let X1 = number of acres of soybeans to

Question 19

The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A + 2B ≤ 600, 2A + 4B ≤ 600, 1A + 3B ≤ 420, and A,B ≥ 0.
(a) Plot the constraints on the grid below.
(b) Identify the feasible region and its corner points. Show your work.
(c) What is the optimal product mix for this problem?

Accepted Answer

The plot and feasible region appear in t

Question 20

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

Accepted Answer

A) True 
 B)False

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

In which of the following has LP been applied successfully?

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

The requirements of linear programming problems include an objective function, the presence of constraints, objective and constraints expressed in linear equalities or inequalities, and ________.

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

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

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

One requirement of a linear programming problem is that the objective function must be expressed as a linear function.

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" cannot be made into valid constraints because the percentages do not add up to 100 percent.

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

What is linear programming?

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?

A linear programming problem has three constraints, plus nonnegativity constraints on X and Y. The constraints are: 2X + 10Y ≤ 100; 4X + 6Y ≤ 100; 6X + 3Y ≥ 90. What is the largest quantity of X that can be made without violating any of these constraints?

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

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategies

Location Strategies

Human Resources, Job Design, and Work Measurement

Supply Chain Management

Inventory Management

Aggregate Planning and Sop

Material Requirements Planning Mrp and Erp

Short-Term Scheduling

Lean Operations

Maintenance and Reliability

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Applying Analytics to Big Data in Operations Management

Filters

Exam 18: Linear Programming

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

In which of the following has LP been applied successfully?

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

The requirements of linear programming problems include an objective function, the presence of constraints, objective and constraints expressed in linear equalities or inequalities, and ________.

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

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

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

One requirement of a linear programming problem is that the objective function must be expressed as a linear function.

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" cannot be made into valid constraints because the percentages do not add up to 100 percent.

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

What is linear programming?

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?

A linear programming problem has three constraints, plus nonnegativity constraints on X and Y. The constraints are: 2X + 10Y ≤ 100; 4X + 6Y ≤ 100; 6X + 3Y ≥ 90. What is the largest quantity of X that can be made without violating any of these constraints?

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

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategies

Location Strategies

Human Resources, Job Design, and Work Measurement

Supply Chain Management

Inventory Management

Aggregate Planning and Sop

Material Requirements Planning Mrp and Erp

Short-Term Scheduling

Lean Operations

Maintenance and Reliability

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Applying Analytics to Big Data in Operations Management

Filters