Question 1

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 2

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 3

Sensitivity analysis can be applied to linear programming solutions by either (1)trial and error or (2)the analytic postoptimality method.

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

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 6

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

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 9

Consider the following constraints from a two-variable linear program:X ≥ 1;Y ≥ 1;X + Y ≤ 9. If these are the only constraints,which of the following points (X,Y)CANNOT be the optimal solution?

Accepted Answer

A) (1,1) 
B) (1,8) 
C) (8,1) 
D) (4,4) 
E) The question cannot be answered without knowing the objective function. 
A) (1,1) 
B) (1,8) 
C) (8,1) 
D) (4,4) 
E) The question cannot be answered without knowing the objective function.

Question 10

What is the simplex method?

Accepted Answer

The simplex method i

Question 11

An iso-profit line:

Accepted Answer

A) can be used to help solve a profit maximizing linear programming problem. 
B) is parallel to all other iso-profit lines in the same problem. 
C) is a line with the same profit at all points. 
D) all of the above 
E) none of the above 
A) can be used to help solve a profit maximizing linear programming problem. 
B) is parallel to all other iso-profit lines in the same problem. 
C) is a line with the same profit at all points. 
D) all of the above 
E) none of the above

Question 12

A stereo mail order center 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.Formulate this problem as a linear program.

Accepted Answer

Maximize contribution = 105 ZA

Question 13

What is linear programming?

Accepted Answer

Linear programming is a mathem

Question 14

Suppose that the shadow price for assembly time is $5/hour.The allowable increase for the assembly time constraint is 40 hours,and the allowable decrease is 30 hours.If all assembly hours were used under the initial LP solution and workers normally make $4/hour but can work overtime for $6/hour,what should management do?

Accepted Answer

A) do not change available hours for assembly time 
B) decrease available hours for assembly time by 30 hours 
C) increase available hours for assembly time by 40 hours 
D) decrease available hours for assembly time by 5 hours 
E) increase available hours for assembly time by 5 hours 
A) do not change available hours for assembly time 
B) decrease available hours for assembly time by 30 hours 
C) increase available hours for assembly time by 40 hours 
D) decrease available hours for assembly time by 5 hours 
E) increase available hours for assembly time by 5 hours

Question 15

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

Accepted Answer

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

Question 16

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 17

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

Accepted Answer

A) True 
 B)False

Question 18

Solving a linear programming problem with the iso-profit line solution method requires that we move the iso-profit line to each corner of the feasible region until the optimum is identified.

Accepted Answer

A) True 
 B)False

Question 19

For a linear programming problem with the constraints 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100,two of its corner points are (0,0)and (0,25).

Accepted Answer

A) True 
 B)False

Question 20

What is the feasible region in a linear programming problem?

Accepted Answer

The feasible region

Exam 23: Linear Programming

The corner-point solution method requires:

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

Sensitivity analysis can be applied to linear programming solutions by either (1)trial and error or (2)the analytic postoptimality method.

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

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

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

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.

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

Consider the following constraints from a two-variable linear program:X ≥ 1;Y ≥ 1;X + Y ≤ 9. If these are the only constraints,which of the following points (X,Y)CANNOT be the optimal solution?

What is the simplex method?

An iso-profit line:

What is linear programming?

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

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

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

Solving a linear programming problem with the iso-profit line solution method requires that we move the iso-profit line to each corner of the feasible region until the optimum is identified.

For a linear programming problem with the constraints 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100,two of its corner points are (0,0)and (0,25).

What is the feasible region in a linear programming problem?

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