Question 1

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  True

Question 2

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)x,y ≥ 0.

Accepted Answer

A) a = 0,b = 0 
B) a = 3,b = 3 
C) a = 0,b = 6 
D) a = 6,b = 0 
E) a = 0,b = 10 
A) a = 0,b = 0 
B) a = 3,b = 3 
C) a = 0,b = 6 
D) a = 6,b = 0 
E) a = 0,b = 10 C

Question 3

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 in the feasible region. 
D) The feasible region is triangular in shape,bounded by (50,0),(33.3333,8.3333),and (100,0). 
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 in the feasible region. 
D) The feasible region is triangular in shape,bounded by (50,0),(33.3333,8.3333),and (100,0). 
E) The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized. D

Question 4

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 5

What is the usefulness of a shadow price (or dual value)?

Accepted Answer

Shadow prices are found in sensitivity a

Question 6

A shadow price (or dual value)reflects which of the following in a maximization problem?

Accepted Answer

A) the marginal gain in the objective realized by subtracting one unit of a resource 
B) the market price that must be paid to obtain additional resources 
C) the increase in profit that would accompany one added unit of a scarce resource 
D) the reduction in cost that would accompany a one unit decrease in the resource 
E) the profit contribution necessary for that item to be included in the optimal solution 
A) the marginal gain in the objective realized by subtracting one unit of a resource 
B) the market price that must be paid to obtain additional resources 
C) the increase in profit that would accompany one added unit of a scarce resource 
D) the reduction in cost that would accompany a one unit decrease in the resource 
E) the profit contribution necessary for that item to be included in the optimal solution

Question 7

What is the region that satisfies all of the constraints in linear programming called?

Accepted Answer

A) area of optimal solutions 
B) area of feasible solutions 
C) profit maximization space 
D) region of optimality 
E) region of non-negativity 
A) area of optimal solutions 
B) area of feasible solutions 
C) profit maximization space 
D) region of optimality 
E) region of non-negativity

Question 8

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

Accepted Answer

iso-profit

Question 9

A maximizing linear programming problem has two constraints: 2X + 4Y ≤ 100 and 3X + 10Y ≤ 210,in addition to constraints stating that both X and Y must be nonnegative.What are the corner points of the feasible region of this problem?

Accepted Answer

A) (0,0),(50,0),(0,21),and (20,15) 
B) (0,0),(70,0),(25,0),and (15,20) 
C) (20,15) 
D) (0,0),(0,100),and (210,0) 
E) (0,0),(0,25),(50,0),(0,21),and (70,0) 
A) (0,0),(50,0),(0,21),and (20,15) 
B) (0,0),(70,0),(25,0),and (15,20) 
C) (20,15) 
D) (0,0),(0,100),and (210,0) 
E) (0,0),(0,25),(50,0),(0,21),and (70,0)

Question 10

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 one minute 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,600 minutes for painting,and 420 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 11

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

Accepted Answer

the postop

Question 12

What are the requirements of all linear programming problems?

Accepted Answer

(1)maximization or minimization of an ob

Question 13

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 14

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 15

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

Accepted Answer

A) True 
 B)False

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

________ is a mathematical technique designed to help operations managers plan and make decisions necessary to allocate resources.

Accepted Answer

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

Question 18

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

Question 19

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

Accepted Answer

The textbook gives m

Question 20

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

Accepted Answer

A) True 
 B)False

Exam 23: Linear Programming

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

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)x,y ≥ 0.

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?

The diet problem is known in agricultural applications as the:

What is the usefulness of a shadow price (or dual value)?

A shadow price (or dual value)reflects which of the following in a maximization problem?

What is the region that satisfies all of the constraints in linear programming called?

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

A maximizing linear programming problem has two constraints: 2X + 4Y ≤ 100 and 3X + 10Y ≤ 210,in addition to constraints stating that both X and Y must be nonnegative.What are the corner points of the feasible region of this problem?

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

What are the requirements of all linear programming problems?

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 a linear programming formulation,a statement such as "maximize contribution" becomes a(n):

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

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

________ is a mathematical technique designed to help operations managers plan and make decisions necessary to allocate resources.

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

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

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

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategy

Capacity and Constraint Management

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

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 .