Question 1

_________________ is a means of assessing the impact of changing parameters in a linear programming model.

Accepted Answer

A) simulplex 
B) simplex 
C) slack 
D) surplus 
E) sensitivity 
A) simulplex 
B) simplex 
C) slack 
D) surplus 
E) sensitivity E

Question 2

What is the sugar constraint (in tablespoons)?

Accepted Answer

A) 6 B + 3 C $\le$ 4,800 
B) 1 B + 1 C $\le$ 4,800 
C) 2 B + 4 C $\le$ 4,800 
D) 4 B + 2 C $\le$ 4,800 
E) 2 B + 3 C $\le$ 4,800 
A) 6 B + 3 C $\le$ 4,800 
B) 1 B + 1 C $\le$ 4,800 
C) 2 B + 4 C $\le$ 4,800 
D) 4 B + 2 C $\le$ 4,800 
E) 2 B + 3 C $\le$ 4,800 C

Question 3

The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.

Accepted Answer

A) True 
 B)False  False

Question 4

A linear programming problem can have multiple optimal solutions.

Accepted Answer

A) True 
 B)False

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

What is the storage space constraint?

Accepted Answer

A) 200K + 100Q $\le$ 18,000 
B) 200K + 90Q $\le$ 18,000 
C) 300K + 90Q $\le$ 18,000 
D) 500K + 100Q $\le$ 18,000 
E) 100K + 90Q $\le$ 18,000 
A) 200K + 100Q $\le$ 18,000 
B) 200K + 90Q $\le$ 18,000 
C) 300K + 90Q $\le$ 18,000 
D) 500K + 100Q $\le$ 18,000 
E) 100K + 90Q $\le$ 18,000

Question 7

What is the slack (unused amount) for each resource for the optimum production combination?

Accepted Answer

S(I)= 0; S

Question 8

What is the optimum production combination and its profits?

Accepted Answer

The answer of What is the optimum production combination and...

Question 9

Every change in the value of an objective function coefficient will lead to changes in the optimal solution.

Accepted Answer

A) True 
 B)False

Question 10

Using the enumeration approach, optimality is obtained by evaluating every coordinate.

Accepted Answer

A) True 
 B)False

Question 11

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 12

For the production combination of 800 boxes of Deluxe and 600 boxes of Classic, which resource is slack (not fully used)?

Accepted Answer

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

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

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

Question 15

Is the production combination 10 A's and 10 B's feasible?

Accepted Answer

The answer of Is the production combination 10 A's and...

Question 16

What is the production time constraint (in minutes)?

Accepted Answer

A) 2 R + 3 S $\le$ 720 
B) 2 R + 5 S $\le$ 720 
C) 3 R + 2 S $\le$ 720 
D) 3 R + 5 S $\le$ 720 
E) 5 R + 5 S $\le$ 720 
A) 2 R + 3 S $\le$ 720 
B) 2 R + 5 S $\le$ 720 
C) 3 R + 2 S $\le$ 720 
D) 3 R + 5 S $\le$ 720 
E) 5 R + 5 S $\le$ 720

Question 17

Which of the following is not a feasible production combination?

Accepted Answer

A) 0 R & 0 S 
B) 0 R & 240 S 
C) 180 R & 120 S 
D) 300 R & 0 S 
E) 180 R & 240 S 
A) 0 R & 0 S 
B) 0 R & 240 S 
C) 180 R & 120 S 
D) 300 R & 0 S 
E) 180 R & 240 S

Question 18

In linear programming, a non-zero reduced cost is associated with a:

Accepted Answer

A) decision variable in the solution 
B) decision variable not in the solution 
C) constraint for which there is slack 
D) constraint for which there is surplus 
E) constraint for which there is no slack or surplus 
A) decision variable in the solution 
B) decision variable not in the solution 
C) constraint for which there is slack 
D) constraint for which there is surplus 
E) constraint for which there is no slack or surplus

Question 19

When we use less of a resource than was available, in linear programming that resource would be called non- __________.

Accepted Answer

A) binding 
B) feasible 
C) reduced cost 
D) linear 
E) enumerated 
A) binding 
B) feasible 
C) reduced cost 
D) linear 
E) enumerated

Question 20

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

Accepted Answer

A) the solution is sub-optimal 
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 sub-optimal 
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

Exam 19: Linear Programming

_________________ is a means of assessing the impact of changing parameters in a linear programming model.

What is the sugar constraint (in tablespoons)?

The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.

A linear programming problem can have multiple optimal solutions.

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

What is the storage space constraint?

What is the slack (unused amount) for each resource for the optimum production combination?

What is the optimum production combination and its profits?

Every change in the value of an objective function coefficient will lead to changes in the optimal solution.

Using the enumeration approach, optimality is obtained by evaluating every coordinate.

What is the objective function?

For the production combination of 800 boxes of Deluxe and 600 boxes of Classic, which resource is slack (not fully used)?

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

What is the maximum profit?

Is the production combination 10 A's and 10 B's feasible?

What is the production time constraint (in minutes)?

Which of the following is not a feasible production combination?

In linear programming, a non-zero reduced cost is associated with a:

When we use less of a resource than was available, in linear programming that resource would be called non- __________.

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

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

MRP and ERP

Inventory Management

Jit and Lean Operations

Supply Chain Management

Scheduling

Project Management

Management of Waiting Lines

Extension 4: Reliability

Extension 5: Decision Theory

Extension 7: Learning Curves

Extension 8: The Transportation Model

Extension 10: Acceptance Sampling

Extension 14: Maintenance

Filters