Question 1

The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as

Accepted Answer

A)  surplus. 
B)  constraint. 
C)  slack. 
D)  shadow price. 
E)  None of the above 
A)  surplus. 
B)  constraint. 
C)  slack. 
D)  shadow price. 
E)  None of the above

Question 2

Sensitivity analysis may also be called

Accepted Answer

A)  postoptimality analysis. 
B)  parametric programming. 
C)  optimality analysis. 
D)  All of the above 
E)  None of the above 
A)  postoptimality analysis. 
B)  parametric programming. 
C)  optimality analysis. 
D)  All of the above 
E)  None of the above

Question 3

Any linear programming problem can be solved using the graphical solution procedure.

Accepted Answer

A) True 
 B)False

Question 4

Consider the following constraints from a two-variable linear program.
(1) X ≥ 0
(2) Y ≥ 0
(3) X + Y ≤ 50
If the optimal corner point lies at the intersection of constraints (2) and (3), what is the optimal solution (X, Y)?

Accepted Answer

Y = 0, so X + 0 = 50

Question 5

Consider the following constraints from a linear programming problem: 2X + Y ≤ 200
X + 2Y ≤ 200
X, Y ≥ 0
If these are the only constraints, which of the following points (X,Y) cannot be the optimal solution?

Accepted Answer

A)  (0, 0) 
B)  (0, 100) 
C)  (65, 65) 
D)  (100, 0) 
E)  (66.67, 66.67) 
A)  (0, 0) 
B)  (0, 100) 
C)  (65, 65) 
D)  (100, 0) 
E)  (66.67, 66.67)

Question 6

Which of the following is not a part of every linear programming problem formulation?

Accepted Answer

A)  an objective function 
B)  a set of constraints 
C)  non-negativity constraints 
D)  a redundant constraint 
E)  maximization or minimization of a linear function 
A)  an objective function 
B)  a set of constraints 
C)  non-negativity constraints 
D)  a redundant constraint 
E)  maximization or minimization of a linear function

Question 7

The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

Accepted Answer

A)  surplus. 
B)  constraint. 
C)  slack. 
D)  shadow price. 
E)  None of the above 
A)  surplus. 
B)  constraint. 
C)  slack. 
D)  shadow price. 
E)  None of the above

Question 8

The solution to a linear programming problem must always lie on a constraint.

Accepted Answer

A) True 
 B)False

Question 9

If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be

Accepted Answer

A)  unbounded. 
B)  non-negative. 
C)  infeasible. 
D)  redundant. 
E)  bounded. 
A)  unbounded. 
B)  non-negative. 
C)  infeasible. 
D)  redundant. 
E)  bounded.

Question 10

Which of the following is not acceptable as a constraint in a linear programming problem (minimization)?

Accepted Answer

A)  Constraint 1 
B)  Constraint 2 
C)  Constraint 3 
D)  Constraint 4 
E)  Constraint 5 
A)  Constraint 1 
B)  Constraint 2 
C)  Constraint 3 
D)  Constraint 4 
E)  Constraint 5

Question 11

A constraint with zero slack or surplus is called a

Accepted Answer

A)  nonbinding constraint. 
B)  resource constraint. 
C)  binding constraint. 
D)  nonlinear constraint. 
E)  linear constraint. 
A)  nonbinding constraint. 
B)  resource constraint. 
C)  binding constraint. 
D)  nonlinear constraint. 
E)  linear constraint.

Question 12

In order for a linear programming problem to have a unique solution, the solution must exist

Accepted Answer

A)  at the intersection of the non-negativity constraints. 
B)  at the intersection of a non-negativity constraint and a resource constraint. 
C)  at the intersection of the objective function and a constraint. 
D)  at the intersection of two or more constraints. 
E)  None of the above 
A)  at the intersection of the non-negativity constraints. 
B)  at the intersection of a non-negativity constraint and a resource constraint. 
C)  at the intersection of the objective function and a constraint. 
D)  at the intersection of two or more constraints. 
E)  None of the above

Question 13

Consider the following linear programming problem:   The maximum possible value for the objective function is

Accepted Answer

A)  360. 
B)  480. 
C)  1520. 
D)  1560. 
E)  None of the above 
A)  360. 
B)  480. 
C)  1520. 
D)  1560. 
E)  None of the above

Question 14

The addition of a redundant constraint lowers the isoprofit line.

Accepted Answer

A) True 
 B)False

Question 15

Define dual price.

Accepted Answer

The dual price for a constrain

Question 16

Solve the following linear programming problem using the corner point method:

Accepted Answer

Feasible corner poin

Question 17

Two models of a product - Regular (X) and Deluxe (Y) - are produced by a company. A linear programming model is used to determine the production schedule. The formulation is as follows:   The optimal solution is X = 100, Y = 0. How many units of the regular model would be produced based on this solution?

Accepted Answer

A)  0 
B)  100 
C)  50 
D)  120 
E)  None of the above 
A)  0 
B)  100 
C)  50 
D)  120 
E)  None of the above

Question 18

How does the case of alternate optimal solutions, as a special case in linear programming, compare to the two other special cases of infeasibility and unboundedness?

Accepted Answer

With multiple alternate solutions, any o

Question 19

One basic assumption of linear programming is divisibility. Explain its need.

Accepted Answer

Solutions can have fractional

Question 20

Which of the following is not one of the steps in formulating a linear program?

Accepted Answer

A)  Graph the constraints to determine the feasible region. 
B)  Define the decision variables. 
C)  Use the decision variables to write mathematical expressions for the objective function and the constraints. 
D)  Identify the objective and the constraints. 
E)  Completely understand the managerial problem being faced. 
A)  Graph the constraints to determine the feasible region. 
B)  Define the decision variables. 
C)  Use the decision variables to write mathematical expressions for the objective function and the constraints. 
D)  Identify the objective and the constraints. 
E)  Completely understand the managerial problem being faced.

The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as

Sensitivity analysis may also be called

Any linear programming problem can be solved using the graphical solution procedure.

Consider the following constraints from a two-variable linear program. (1) X ≥ 0 (2) Y ≥ 0 (3) X + Y ≤ 50 If the optimal corner point lies at the intersection of constraints (2) and (3), what is the optimal solution (X, Y)?

Consider the following constraints from a linear programming problem: 2X + Y ≤ 200 X + 2Y ≤ 200 X, Y ≥ 0 If these are the only constraints, which of the following points (X,Y) cannot be the optimal solution?

Which of the following is not a part of every linear programming problem formulation?

The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

The solution to a linear programming problem must always lie on a constraint.

If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be

Which of the following is not acceptable as a constraint in a linear programming problem (minimization)?

A constraint with zero slack or surplus is called a

In order for a linear programming problem to have a unique solution, the solution must exist

Consider the following linear programming problem: The maximum possible value for the objective function is

The addition of a redundant constraint lowers the isoprofit line.

Define dual price.

Solve the following linear programming problem using the corner point method:

How does the case of alternate optimal solutions, as a special case in linear programming, compare to the two other special cases of infeasibility and unboundedness?

One basic assumption of linear programming is divisibility. Explain its need.

Which of the following is not one of the steps in formulating a linear program?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation and Assignment Models

Integer Programming, Goal Programming, and Nonlinear Programming

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters

Exam 7: Linear Programming Models: Graphical and Computer Methods

The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as

Sensitivity analysis may also be called

Any linear programming problem can be solved using the graphical solution procedure.

Consider the following constraints from a two-variable linear program. (1) X ≥ 0 (2) Y ≥ 0 (3) X + Y ≤ 50 If the optimal corner point lies at the intersection of constraints (2) and (3), what is the optimal solution (X, Y)?

Consider the following constraints from a linear programming problem: 2X + Y ≤ 200 X + 2Y ≤ 200 X, Y ≥ 0 If these are the only constraints, which of the following points (X,Y) cannot be the optimal solution?

Which of the following is not a part of every linear programming problem formulation?

The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

The solution to a linear programming problem must always lie on a constraint.

If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be

Which of the following is not acceptable as a constraint in a linear programming problem (minimization)?

A constraint with zero slack or surplus is called a

In order for a linear programming problem to have a unique solution, the solution must exist

Consider the following linear programming problem: The maximum possible value for the objective function is

The addition of a redundant constraint lowers the isoprofit line.

Define dual price.

Solve the following linear programming problem using the corner point method:

How does the case of alternate optimal solutions, as a special case in linear programming, compare to the two other special cases of infeasibility and unboundedness?

One basic assumption of linear programming is divisibility. Explain its need.

Which of the following is not one of the steps in formulating a linear program?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation and Assignment Models

Integer Programming, Goal Programming, and Nonlinear Programming

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters