Question 1

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.

Accepted Answer

A) True 
 B)False

Question 2

Profit maximization could be an objective of an LP problem; but cost minimization cannot be the objective of an LP problem.

Accepted Answer

A) True 
 B)False

Question 3

In the graphical approach to linear programming, finding values for the decision variables at the intersection of corners requires the solving of

Accepted Answer

A) linear constraints. 
B) surplus variables. 
C) slack variables. 
D) simultaneous equations. 
E) binding constraints. 
A) linear constraints. 
B) surplus variables. 
C) slack variables. 
D) simultaneous equations. 
E) binding constraints.

Question 4

_______________ represent choices available to the decision maker in terms of the amounts of either inputs or outputs.

Accepted Answer

A) Decision variables 
B) Constraints 
C) Objectives 
D) Feasible 
E) Parameters 
A) Decision variables 
B) Constraints 
C) Objectives 
D) Feasible 
E) Parameters

Question 5

What combination of x and y will provide a minimum for this problem?

Accepted Answer

A) x = 0, y = 0 
B) x = 0, y = 3 
C) x = 0, y = 5 
D) x = 1, y = 2.5 
E) x = 6, y = 0 
A) x = 0, y = 0 
B) x = 0, y = 3 
C) x = 0, y = 5 
D) x = 1, y = 2.5 
E) x = 6, y = 0

Question 6

Once we go beyond two decision variables, typically the ___________ method of linear programming must be used.

Accepted Answer

A) simplicit 
B) unidimensional 
C) simplex 
D) dynamic 
E) exponential 
A) simplicit 
B) unidimensional 
C) simplex 
D) dynamic 
E) exponential

Question 7

The term range of feasibility refers to coefficients of the objective function.

Accepted Answer

A) True 
 B)False

Question 8

The region which satisfies all of the constraints in graphical linear programming is called the

Accepted Answer

A) optimum solution space. 
B) region of optimality. 
C) lower left hand quadrant. 
D) region of non-negativity. 
E) feasible solution space. 
A) optimum solution space. 
B) region of optimality. 
C) lower left hand quadrant. 
D) region of non-negativity. 
E) feasible solution space.

Question 9

The feasible solution space only contains points that satisfy all constraints.

Accepted Answer

A) True 
 B)False

Question 10

An electronics firm produces two models of pocket calculators: the A-100 (A), which is an inexpensive four-function calculator, and the B-200 (B), which also features square root and percent functions. Each model uses one (the same)circuit board, of which there are only 2,500 available for this week's production. Also, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators, of which the A-100 requires 15 minutes (.25 hours)each, and the B-200 requires 30 minutes (.5 hours)each to produce. The firm forecasts that it could sell a maximum of 4,000 A-100s this week and a maximum of 1,000 B-200s. Profits for the A-100 are $1.00 each, and profits for the B-200 are $4.00 each. Which of the following is not a feasible production/sales combination?

Accepted Answer

A) 0 A and 0 B 
B) 0 A and 1,000 B 
C) 1,800 A and 700 B 
D) 2,500 A and 0 B 
E) 100 A and 1,600 B 
A) 0 A and 0 B 
B) 0 A and 1,000 B 
C) 1,800 A and 700 B 
D) 2,500 A and 0 B 
E) 100 A and 1,600 B

Question 11

The production planner for Fine Coffees, Inc., produces two coffee blends: American (A)and British (B). Two of his resources are constrained: Columbia beans, of which he can get at most 300 pounds (4,800 ounces)per week; and Dominican beans, of which he can get at most 200 pounds (3,200 ounces)per week. Each pound of American blend coffee requires 12 ounces of Colombian beans and 4 ounces of Dominican beans, while a pound of British blend coffee uses 8 ounces of each type of bean. Profits for the American blend are $2.00 per pound, and profits for the British blend are $1.00 per pound.
What is the objective function?

Accepted Answer

A) $1 A + $2 B = Z 
B) $12 A + $8 B = Z 
C) $2 A + $1 B = Z 
D) $8 A + $12 B = Z 
E) $4 A + $8 B = Z 
A) $1 A + $2 B = Z 
B) $12 A + $8 B = Z 
C) $2 A + $1 B = Z 
D) $8 A + $12 B = Z 
E) $4 A + $8 B = Z

Question 12

The logistics/operations manager of a mail order house purchases two products for resale: king beds (K)and queen beds (Q). Each king bed costs $500 and requires 100 cubic feet of storage space, and each queen bed costs $300 and requires 90 cubic feet of storage space. The manager has $75,000 to invest in beds this week, and her warehouse has 18,000 cubic feet available for storage. Profit for each king bed is $300 and for each queen bed is $150.
Which of the following is not a feasible purchase combination?

Accepted Answer

A) 0 king beds and 0 queen beds 
B) 0 king beds and 250 queen beds 
C) 150 king beds and 0 queen beds 
D) 90 king beds and 100 queen beds 
E) 0 king beds and 200 queen beds 
A) 0 king beds and 0 queen beds 
B) 0 king beds and 250 queen beds 
C) 150 king beds and 0 queen beds 
D) 90 king beds and 100 queen beds 
E) 0 king beds and 200 queen beds

Question 13

In graphical linear programming, when the objective function is parallel to one of the binding constraints, then

Accepted Answer

A) the solution is suboptimal. 
B) multiple optimal solutions exist. 
C) a single corner point solution exists. 
D) no feasible solution exists. 
E) the constraint must be changed or eliminated. 
A) the solution is suboptimal. 
B) multiple optimal solutions exist. 
C) a single corner point solution exists. 
D) no feasible solution exists. 
E) the constraint must be changed or eliminated.

Question 14

Graphical linear programming can handle problems that involve any number of decision variables.

Accepted Answer

A) True 
 B)False

Question 15

Coordinates of all corner points are substituted into the objective function when we use the approach called

Accepted Answer

A) least squares. 
B) regression. 
C) enumeration. 
D) graphical linear programming. 
E) constraint assignment. 
A) least squares. 
B) regression. 
C) enumeration. 
D) graphical linear programming. 
E) constraint assignment.

Question 16

A maximization problem is limited by all greater than or equal to constraints.

Accepted Answer

A) True 
 B)False

Question 17

For a linear programming problem with the following constraints, which point is in the feasible solution space assuming this is a maximization problem?

Accepted Answer

A) x = 1, y = 5 
B) x = −1, y = 1 
C) x = 4, y = 4 
D) x = 2, y = 1 
E) x = 2, y = 8 
A) x = 1, y = 5 
B) x = −1, y = 1 
C) x = 4, y = 4 
D) x = 2, y = 1 
E) x = 2, y = 8

Question 18

A shadow price reflects which of the following in a maximization problem?

Accepted Answer

A) marginal cost of adding additional resources 
B) marginal gain in the objective that would be realized by adding one unit of a resource 
C) net gain in the objective that would be realized by increasing an objective function coefficient 
D) marginal gain in the objective that would be realized by subtracting one unit of a resource 
E) expected value of perfect information 
A) marginal cost of adding additional resources 
B) marginal gain in the objective that would be realized by adding one unit of a resource 
C) net gain in the objective that would be realized by increasing an objective function coefficient 
D) marginal gain in the objective that would be realized by subtracting one unit of a resource 
E) expected value of perfect information

Question 19

The owner of Crackers, Inc., produces two kinds of crackers: Deluxe (D)and Classic (C). She has a limited amount of the three ingredients used to produce these crackers available for her next production run: 4,800 ounces of sugar; 9,600 ounces of flour, and 2,000 ounces of salt. A box of Deluxe crackers requires 2 ounces of sugar, 6 ounces of flour, and 1 ounce of salt to produce; while a box of Classic crackers requires 3 ounces of sugar, 8 ounces of flour, and 2 ounces of salt. Profits for a box of Deluxe crackers are $.40; and for a box of Classic crackers, $.50.
What is the objective function?

Accepted Answer

A) $.50 D + $.40 C = Z 
B) $.20 D + $.30 C = Z 
C) $.40 D + $.50 C = Z 
D) $.10 D + $.20 C = Z 
E) $.60 D + $.80 C = Z 
A) $.50 D + $.40 C = Z 
B) $.20 D + $.30 C = Z 
C) $.40 D + $.50 C = Z 
D) $.10 D + $.20 C = Z 
E) $.60 D + $.80 C = Z

Question 20

The logistics/operations manager of a mail order house purchases two products for resale: king beds (K)and queen beds (Q). Each king bed costs $500 and requires 100 cubic feet of storage space, and each queen bed costs $300 and requires 90 cubic feet of storage space. The manager has $75,000 to invest in beds this week, and her warehouse has 18,000 cubic feet available for storage. Profit for each king bed is $300 and for each queen bed is $150.
What is the maximum profit?

Accepted Answer

A) $0 
B) $30,000 
C) $42,000 
D) $45,000 
E) $54,000 
A) $0 
B) $30,000 
C) $42,000 
D) $45,000 
E) $54,000

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.

Profit maximization could be an objective of an LP problem; but cost minimization cannot be the objective of an LP problem.

In the graphical approach to linear programming, finding values for the decision variables at the intersection of corners requires the solving of

_______________ represent choices available to the decision maker in terms of the amounts of either inputs or outputs.

What combination of x and y will provide a minimum for this problem?

Once we go beyond two decision variables, typically the ___________ method of linear programming must be used.

The term range of feasibility refers to coefficients of the objective function.

The region which satisfies all of the constraints in graphical linear programming is called the

The feasible solution space only contains points that satisfy all constraints.

In graphical linear programming, when the objective function is parallel to one of the binding constraints, then

Graphical linear programming can handle problems that involve any number of decision variables.

Coordinates of all corner points are substituted into the objective function when we use the approach called

A maximization problem is limited by all greater than or equal to constraints.

For a linear programming problem with the following constraints, which point is in the feasible solution space assuming this is a maximization problem?

A shadow price reflects which of the following in a maximization problem?

Introduction to Operations Management

Competitiveness, Strategy, and Productivity

Forecasting

Product and Service Design

Strategic Capacity Planning for Products and Services

Process Selection and Facility Layout

Work Design and Measurement

Location Planning and Analysis

Management of Quality

Quality Control

Aggregate Planning and Master Scheduling

Inventory Management

MRP and ERP

Jit and Lean Operations

Supply Chain Management

Scheduling

Project Management

Management of Waiting Lines

Filters

Exam 19: Linear Programming

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.

Profit maximization could be an objective of an LP problem; but cost minimization cannot be the objective of an LP problem.

In the graphical approach to linear programming, finding values for the decision variables at the intersection of corners requires the solving of

_______________ represent choices available to the decision maker in terms of the amounts of either inputs or outputs.

What combination of x and y will provide a minimum for this problem?

Once we go beyond two decision variables, typically the ___________ method of linear programming must be used.

The term range of feasibility refers to coefficients of the objective function.

The region which satisfies all of the constraints in graphical linear programming is called the

The feasible solution space only contains points that satisfy all constraints.

In graphical linear programming, when the objective function is parallel to one of the binding constraints, then

Graphical linear programming can handle problems that involve any number of decision variables.

Coordinates of all corner points are substituted into the objective function when we use the approach called

A maximization problem is limited by all greater than or equal to constraints.

For a linear programming problem with the following constraints, which point is in the feasible solution space assuming this is a maximization problem?

A shadow price reflects which of the following in a maximization problem?

Introduction to Operations Management

Competitiveness, Strategy, and Productivity

Forecasting

Product and Service Design

Strategic Capacity Planning for Products and Services

Process Selection and Facility Layout

Work Design and Measurement

Location Planning and Analysis

Management of Quality

Quality Control

Aggregate Planning and Master Scheduling

Inventory Management

MRP and ERP

Jit and Lean Operations

Supply Chain Management

Scheduling

Project Management

Management of Waiting Lines

Filters