Question 1

________ is an assumption that the decision variables must be either positive or zero.

Accepted Answer

Nonnegativity

Question 2

Only corner points should be considered for the optimal solution to a linear programming problem.

Accepted Answer

A) True 
 B)False  True

Question 3

________ are the limitations that restrict the permissible choices for the decision variables.

Accepted Answer

Constraints

Question 4

One assumption of linear programming is that a decision maker cannot use negative quantities of the decision variables.

Accepted Answer

A) True 
 B)False

Question 5

The ________ represents all permissible combinations of the decision variables in a linear programming model.

Accepted Answer

The answer of The ________ represents all permissible combinations of...

Question 6

Each coefficient or given constant is known by the decision maker with ________.

Accepted Answer

The answer of Each coefficient or given constant is known...

Question 7

A binding constraint has slack but does not have surplus.

Accepted Answer

A) True 
 B)False

Question 8

Which of the following statements regarding linear programming is NOT true?

Accepted Answer

A) A parameter is also known as a decision variable. 
B) Linearity assumes proportionality and additivity. 
C) The product-mix problem is a one-period type of aggregate planning problem. 
D) One reasonable sequence for formulating a model is defining the decision variables,writing out the objective function,and writing out the constraints. 
A) A parameter is also known as a decision variable. 
B) Linearity assumes proportionality and additivity. 
C) The product-mix problem is a one-period type of aggregate planning problem. 
D) One reasonable sequence for formulating a model is defining the decision variables,writing out the objective function,and writing out the constraints.

Question 9

________ is the amount by which the left-hand side exceeds the right-hand side in a linear programming model.

Accepted Answer

The answer of ________ is the amount by which the...

Question 10

A(n)________ is a value that the decision maker cannot control and that does not change when the solution is implemented.

Accepted Answer

The answer of A(n)________ is a value that the decision...

Question 11

Decision variables are represented in both the objective function and the constraints while formulating a linear program.

Accepted Answer

A) True 
 B)False

Question 12

Linear programming is useful for allocating scarce resources among competing demands.

Accepted Answer

A) True 
 B)False

Question 13

A modeler is limited to two or fewer decision variables when using the ________.

Accepted Answer

The answer of A modeler is limited to two or...

Question 14

Suppose that the optimal values of the decision variables to a two-variable linear programming problem remain the same as long as the slope of the objective function lies between the slopes of the following two constraints: 2X1 + 3X2 < 26
2X1 + 2X2 < 20
The current objective function is:
8X1 + 9X2 = Z
Which of the following statements about the range of optimality on c1 is TRUE?

Accepted Answer

A) 0 < c1 < 2 
B) 2 < c1 < 6 
C) 6 < c1 < 9 
D) 9 < c1 < 12 
A) 0 < c1 < 2 
B) 2 < c1 < 6 
C) 6 < c1 < 9 
D) 9 < c1 < 12

Question 15

A(n)________ forms the optimal corner and limits the ability to improve the objective function.

Accepted Answer

The answer of A(n)________ forms the optimal corner and limits...

Question 16

A(n)________ is the marginal improvement in the objective function value caused by relaxing a constraint by one unit.

Accepted Answer

The answer of A(n)________ is the marginal improvement in the...

Question 17

For the line that has the equation 4X1 + 8X2 = 88,an axis intercept is

Accepted Answer

A) (0,22). 
B) (6,0). 
C) (6,22). 
D) (0,11). 
A) (0,22). 
B) (6,0). 
C) (6,22). 
D) (0,11).

Question 18

For an = constraint,only points ________ are feasible solutions.

Accepted Answer

The answer of For an = constraint,only points ________ are...

Question 19

The ________ problem is a one-period type of aggregate planning problem,the solution of which yields optimal output quantities of a group of products or services,subject to resource capacity and market demand conditions.

Accepted Answer

The answer of The ________ problem is a one-period type...

Question 20

Briefly describe the meaning of a shadow price.Provide an example of how a manager could use information about shadow prices to improve operations?

Accepted Answer

The shadow price is the margin

Exam 22: Linear Programming

________ is an assumption that the decision variables must be either positive or zero.

Only corner points should be considered for the optimal solution to a linear programming problem.

________ are the limitations that restrict the permissible choices for the decision variables.

One assumption of linear programming is that a decision maker cannot use negative quantities of the decision variables.

The ________ represents all permissible combinations of the decision variables in a linear programming model.

Each coefficient or given constant is known by the decision maker with ________.

A binding constraint has slack but does not have surplus.

Which of the following statements regarding linear programming is NOT true?

________ is the amount by which the left-hand side exceeds the right-hand side in a linear programming model.

A(n)________ is a value that the decision maker cannot control and that does not change when the solution is implemented.

Decision variables are represented in both the objective function and the constraints while formulating a linear program.

Linear programming is useful for allocating scarce resources among competing demands.

A modeler is limited to two or fewer decision variables when using the ________.

A(n)________ forms the optimal corner and limits the ability to improve the objective function.

A(n)________ is the marginal improvement in the objective function value caused by relaxing a constraint by one unit.

For the line that has the equation 4X1 + 8X2 = 88,an axis intercept is

For an = constraint,only points ________ are feasible solutions.

The ________ problem is a one-period type of aggregate planning problem,the solution of which yields optimal output quantities of a group of products or services,subject to resource capacity and market demand conditions.

Briefly describe the meaning of a shadow price.Provide an example of how a manager could use information about shadow prices to improve operations?

Creating Customer Value Through Operations

Supply Chain Management

Process Configuration

Capacity

Inventory Management

Quality and Process Improvement

Lean Systems

Managing Projects

Location and Layout

Managing Demand and Forecasting

Operations Planning and Scheduling

Resource Planning

Waiting Lines

Decision Making

Financial Analysis

Work Measurement

Learning Curve Analysis

Computer-Integrated Manufacturing

Acceptance Sampling Plans

Simulation

Special Inventory Models

Filters