Question 1

Nonbinding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

Accepted Answer

A) True 
 B)False  False

Question 2

Nonzero slack or surplus is associated with a binding constraint.

Accepted Answer

A) True 
 B)False  False

Question 3

The theoretical limit on the number of constraints that can be handled by the simplex method in a single problem is

Accepted Answer

A) 1. 
B) 2. 
C) 3. 
D) 4. 
E) unlimited. 
A) 1. 
B) 2. 
C) 3. 
D) 4. 
E) unlimited. E

Question 4

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. What are optimal weekly profits?

Accepted Answer

A) $10,000 
B) $4,600 
C) $2,500 
D) $5,200 
E) $6,400 
A) $10,000 
B) $4,600 
C) $2,500 
D) $5,200 
E) $6,400

Question 5

_______________ in Excel is a routine that performs necessary calculations.

Accepted Answer

A) Execute 
B) Perform 
C) Solver 
D) Run 
E) Calculate 
A) Execute 
B) Perform 
C) Solver 
D) Run 
E) Calculate

Question 6

A shadow price indicates how much a one-unit decrease/increase in the right-hand-side value of a constraint will decrease/increase the optimal value of the objective function.

Accepted Answer

A) True 
 B)False

Question 7

A local bagel shop produces two products: bagels (B)and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's production run. Bagel profits are 20 cents each, and croissant profits are 30 cents each.
Which of the following is not a feasible production combination?

Accepted Answer

A) 0 B and 0 C 
B) 0 B and 1,100 C 
C) 800 B and 600 C 
D) 1,100 B and 0 C 
E) 0 B and 1,400 C 
A) 0 B and 0 C 
B) 0 B and 1,100 C 
C) 800 B and 600 C 
D) 1,100 B and 0 C 
E) 0 B and 1,400 C

Question 8

A local bagel shop produces two products: bagels (B)and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's production run. Bagel profits are 20 cents each, and croissant profits are 30 cents each.
What are optimal profits for today's production run?

Accepted Answer

A) $580 
B) $340 
C) $220 
D) $380 
E) $420 
A) $580 
B) $340 
C) $220 
D) $380 
E) $420

Question 9

_______________ is/are a mathematical expression that can be used to determine the total profit for a given solution.

Accepted Answer

A) Decision variables 
B) Constraints 
C) Objective function 
D) Feasible solution space 
E) Parameters 
A) Decision variables 
B) Constraints 
C) Objective function 
D) Feasible solution space 
E) Parameters

Question 10

A local bagel shop produces two products: bagels (B)and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's production run. Bagel profits are 20 cents each, and croissant profits are 30 cents each.
For the production combination of 600 bagels and 800 croissants, which resource is slack (not fully used)?

Accepted Answer

A) flour (only) 
B) sugar (only) 
C) flour and yeast 
D) flour and sugar 
E) yeast and sugar 
A) flour (only) 
B) sugar (only) 
C) flour and yeast 
D) flour and sugar 
E) yeast and sugar

Question 11

For the products A, B, C, and D, which of the following could be a linear programming objective function?

Accepted Answer

A) Z = 1 A + 2 B + 3 C + 4 D 
B) Z = 1 A + 2 BC + 3 D 
C) Z = 1 A + 2 AB + 3 ABC + 4 ABCD 
D) Z = 1 A + 2 B ÷ C + 3 D 
E) Z = 1 A + 2 B − 1 CD 
A) Z = 1 A + 2 B + 3 C + 4 D 
B) Z = 1 A + 2 BC + 3 D 
C) Z = 1 A + 2 AB + 3 ABC + 4 ABCD 
D) Z = 1 A + 2 B ÷ C + 3 D 
E) Z = 1 A + 2 B − 1 CD

Question 12

Which of the following is not a component of the structure of a linear programming model?

Accepted Answer

A) constraints 
B) decision variables 
C) parameters 
D) a goal or objective 
E) environmental uncertainty 
A) constraints 
B) decision variables 
C) parameters 
D) a goal or objective 
E) environmental uncertainty

Question 13

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L)and Dark (D). Two of his resources are constrained: production time, which is limited to 8 hours (480 minutes)per day; and malt extract (one of his ingredients), of which he can get only 675 gallons each day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract, while each keg of Dark beer needs 4 minutes of time and 3 gallons of malt extract. Profits for Lite beer are $3.00 per keg, and profits for Dark beer are $2.00 per keg. What is the objective function?

Accepted Answer

A) $2 L + $3 D = Z 
B) $2 L + $4 D = Z 
C) $3 L + $2 D = Z 
D) $4 L + $2 D = Z 
E) $5 L + $3 D = Z 
A) $2 L + $3 D = Z 
B) $2 L + $4 D = Z 
C) $3 L + $2 D = Z 
D) $4 L + $2 D = Z 
E) $5 L + $3 D = Z

Question 14

A local bagel shop produces two products: bagels (B)and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's production run. Bagel profits are 20 cents each, and croissant profits are 30 cents each. What is the objective function?

Accepted Answer

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

Question 15

_______________ is/are numerical constants used in linear programming.

Accepted Answer

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

Question 16

The production planner for a private label soft drink maker is planning the production of two soft drinks: root beer (R)and sassafras soda (S). Two resources are constrained: production time (T), of which she has at most 12 hours per day; and carbonated water (W), of which she can get at most 1,500 gallons per day. A case of root beer requires 2 minutes of time and 5 gallons of water to produce, while a case of sassafras soda requires 3 minutes of time and 5 gallons of water. Profits for the root beer are $6.00 per case, and profits for the sassafras soda are $4.00 per case. What is the objective function?

Accepted Answer

A) $4 R + $6 S = Z 
B) $2 R + $3 S = Z 
C) $6 R + $4 S = Z 
D) $3 R + $2 S = Z 
E) $5 R + $5 S = Z 
A) $4 R + $6 S = Z 
B) $2 R + $3 S = Z 
C) $6 R + $4 S = Z 
D) $3 R + $2 S = Z 
E) $5 R + $5 S = Z

Question 17

In a linear programming problem, the objective function was specified as follows:
Z = 2 A + 4 B + 3 C
The optimal solution calls for A to equal 4, B to equal 6, and C to equal 3. It has also been determined that the coefficient associated with A can range from 1.75 to 2.25 without the optimal solution changing. This range is called A's

Accepted Answer

A) range of optimality. 
B) range of feasibility. 
C) shadow price. 
D) slack. 
E) surplus. 
A) range of optimality. 
B) range of feasibility. 
C) shadow price. 
D) slack. 
E) surplus.

Question 18

A novice linear programmer is dealing with a three-decision-variable problem. To compare the attractiveness of various feasible decision-variable combinations, values of the objective function at corners are calculated. This is an example of

Accepted Answer

A) empiritation. 
B) explicitation. 
C) evaluation. 
D) enumeration. 
E) elicitation. 
A) empiritation. 
B) explicitation. 
C) evaluation. 
D) enumeration. 
E) elicitation.

Question 19

If a single optimal solution exists to a graphical LP problem, it will exist at a corner point.

Accepted Answer

A) True 
 B)False

Question 20

An objective function represents a family of parallel lines.

Accepted Answer

A) True 
 B)False

Nonbinding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

Nonzero slack or surplus is associated with a binding constraint.

The theoretical limit on the number of constraints that can be handled by the simplex method in a single problem is

_______________ in Excel is a routine that performs necessary calculations.

A shadow price indicates how much a one-unit decrease/increase in the right-hand-side value of a constraint will decrease/increase the optimal value of the objective function.

_______________ is/are a mathematical expression that can be used to determine the total profit for a given solution.

For the products A, B, C, and D, which of the following could be a linear programming objective function?

Which of the following is not a component of the structure of a linear programming model?

_______________ is/are numerical constants used in linear programming.

A novice linear programmer is dealing with a three-decision-variable problem. To compare the attractiveness of various feasible decision-variable combinations, values of the objective function at corners are calculated. This is an example of

If a single optimal solution exists to a graphical LP problem, it will exist at a corner point.

An objective function represents a family of parallel lines.

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

Nonbinding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

Nonzero slack or surplus is associated with a binding constraint.

The theoretical limit on the number of constraints that can be handled by the simplex method in a single problem is

_______________ in Excel is a routine that performs necessary calculations.

A shadow price indicates how much a one-unit decrease/increase in the right-hand-side value of a constraint will decrease/increase the optimal value of the objective function.

_______________ is/are a mathematical expression that can be used to determine the total profit for a given solution.

For the products A, B, C, and D, which of the following could be a linear programming objective function?

Which of the following is not a component of the structure of a linear programming model?

_______________ is/are numerical constants used in linear programming.

A novice linear programmer is dealing with a three-decision-variable problem. To compare the attractiveness of various feasible decision-variable combinations, values of the objective function at corners are calculated. This is an example of

If a single optimal solution exists to a graphical LP problem, it will exist at a corner point.

An objective function represents a family of parallel lines.

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