Question 1

________ is a mathematical technique designed to help operations managers plan and make decisions relative to the trade-offs necessary to allocate resources.

Accepted Answer

The answer of ________ is a mathematical technique designed to...

Question 2

The feasible region in the diagram below is consistent with which one of the following constraints?

Accepted Answer

A) 8X1 + 4X2 ≤ 160 
B) 8X1 + 4X2 ≥ 160 
C) 4X1 + 8X2 ≤ 160 
D) 8X1 - 4X2 ≤ 160 
E) 4X1 - 8X2 ≤ 160 
A) 8X1 + 4X2 ≤ 160 
B) 8X1 + 4X2 ≥ 160 
C) 4X1 + 8X2 ≤ 160 
D) 8X1 - 4X2 ≤ 160 
E) 4X1 - 8X2 ≤ 160

Question 3

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,the appropriate objective function would be

Accepted Answer

A) maximize $40Y = $25Z. 
B) maximize $40Y + $25Z. 
C) maximize $30Y + $20Z. 
D) maximize 0.25Y + 0.20Z. 
E) maximize $20Y + $50Z. 
A) maximize $40Y = $25Z. 
B) maximize $40Y + $25Z. 
C) maximize $30Y + $20Z. 
D) maximize 0.25Y + 0.20Z. 
E) maximize $20Y + $50Z.

Question 4

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 5

In sensitivity analysis,a zero shadow price (or dual value)for a resource ordinarily means that

Accepted Answer

A) the resource is scarce. 
B) the resource constraint was redundant. 
C) the resource has not been used up. 
D) something is wrong with the problem formulation. 
E) the resource is very costly. 
A) the resource is scarce. 
B) the resource constraint was redundant. 
C) the resource has not been used up. 
D) something is wrong with the problem formulation. 
E) the resource is very costly.

Question 6

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.

Question 7

A common form of the product-mix linear programming problem seeks to find that combination of products and the quantity of each that maximizes profit in the presence of limited resources.

Accepted Answer

A) True 
 B)False

Question 8

What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b,subject to (1)4a + 2b < 12 and (2)5a + 2b < 20 and (3)a,b ≥ 0.

Accepted Answer

A) a = 0,b = 0 
B) a = 3,b = 3 
C) a = 0,b = 6 
D) a = 6,b = 0 
E) cannot solve without values for a and b 
A) a = 0,b = 0 
B) a = 3,b = 3 
C) a = 0,b = 6 
D) a = 6,b = 0 
E) cannot solve without values for a and b

Question 9

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.

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

Constraints are needed to solve linear programming problems by hand,but not by computer.

Accepted Answer

A) True 
 B)False

Question 12

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 13

The Queen City Nursery manufactures bags of potting soil from compost and topsoil.Each cubic foot of compost costs 12 cents and contains 4 pounds of sand,3 pounds of clay,and 5 pounds of humus.Each cubic foot of topsoil costs 20 cents and contains 3 pounds of sand,6 pounds of clay,and 12 pounds of humus.Each bag of potting soil must contain at least 12 pounds of sand,12 pounds of clay,and 10 pounds of humus.Explain how this problem meets the conditions of a linear programming problem.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

The problem formulation appears in the s

Question 14

The region that satisfies the constraint 4X + 15Z ≥ 1000 includes the origin of the graph.

Accepted Answer

A) True 
 B)False

Question 15

What are the requirements of all linear programming problems?

Accepted Answer

Linear programming problems require (1)m

Question 16

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 17

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

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

The textbook gives m

Question 19

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 20

What is linear programming?

Accepted Answer

Linear programming is a mathem

Exam 22: Linear Programming

________ is a mathematical technique designed to help operations managers plan and make decisions relative to the trade-offs necessary to allocate resources.

The feasible region in the diagram below is consistent with which one of the following constraints?

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,the appropriate objective function would be

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

In sensitivity analysis,a zero shadow price (or dual value)for a resource ordinarily means that

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

A common form of the product-mix linear programming problem seeks to find that combination of products and the quantity of each that maximizes profit in the presence of limited resources.

What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b,subject to (1)4a + 2b < 12 and (2)5a + 2b < 20 and (3)a,b ≥ 0.

The corner-point solution method requires

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

Constraints are needed to solve linear programming problems by hand,but not by computer.

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?

The region that satisfies the constraint 4X + 15Z ≥ 1000 includes the origin of the graph.

What are the requirements of all linear programming problems?

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?

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

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

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.

What is linear programming?

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Statistical Process Control

Process Strategy and Sustainability

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 Mrpand Erp

Short-Term Scheduling

Jit and Lean Operations

Maintenance and Reliability

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Filters