Question 1

________ follows a path of points inside the feasible region to find an optimal solution.

Accepted Answer

A) The graphical approach 
B) The simplex method 
C) Karmarkar's method 
D) Trial-and-error 
E) none of the above 
A) The graphical approach 
B) The simplex method 
C) Karmarkar's method 
D) Trial-and-error 
E) none of the above

Question 2

A redundant constraint is eliminated from a linear programming model.What effect will this have on the optimal solution?

Accepted Answer

A) feasible region will decrease in size 
B) feasible region will increase in size 
C) a decrease in objective function value 
D) an increase in objective function value 
E) no change 
A) feasible region will decrease in size 
B) feasible region will increase in size 
C) a decrease in objective function value 
D) an increase in objective function value 
E) no change

Question 3

Consider the following linear programming model: $$\begin{array} { l } 
\text { Max } \quad \mathrm { X } _ { 1 } ^ { 2 } + \mathrm { X } _ { 2 } + 3 \mathrm { X } _ { 3 } \
\text { Subject to: } \
\qquad \begin{array} { l } 
\mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 3 \
\mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 1 \
\mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0
\end{array}
\end{array}$$
This problem violates which of the following assumptions?

Accepted Answer

A) certainty 
B) proportionality 
C) divisibility 
D) linearity 
E) integrality 
A) certainty 
B) proportionality 
C) divisibility 
D) linearity 
E) integrality

Question 4

Consider the following linear programming problem.
 $$\begin{array} { l } 
\text { Minimize } \quad 6 ^ { X _ { 1 } } + 3 ^ { X _ { 2 } } \
\text { Subject to: } \
2 ^ { X _ { 1 } } + 4 ^ { X _ { 2 } } \geq 16 \quad 4 ^ { X _ { 1 } } + 3 ^ { X _ { 2 } } \geq 24 \
\mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0 \
\end{array}$$ 
Use Solver to find the optimal values of X₁ and X₂.

Accepted Answer

The answer of Consider the following linear programming problem.
 \[\begin{array}...

Question 5

A meat packing store produces a dog food mixture that is sold to pet retail outlets in bags of 10 pounds each.The food mixture contains the ingredients turkey and beef.The cost per pound of each of these ingredients is as follows:
   
Each bag must contain at least 5 pounds of turkey.Moreover,the ratio of turkey to beef must be at least 2 to 1.What is the optimal mixture of the ingredients that will minimize total cost?

Accepted Answer

The answer of A meat packing store produces a dog...

Question 6

Consider the following linear programming problem.
 $$\begin{array} { l l } 
\text { Minimize } & 3 \mathrm { X } _ { 1 } + 2 \mathrm { X } _ { 2 } \
\text { Subject to: } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \geq 10 \
& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 20 \
& \mathrm { X } _ { 2 } \leq 10 \
& \mathrm { X } _ { 1 } \leq 18 \
& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0
\end{array}$$ 
Use Solver to find the optimal values of X₁ and X₂.

Accepted Answer

The answer of Consider the following linear programming problem.
 \[\begin{array}...

Question 7

Consider the following linear programming model:
$$\begin{array} { l l } 
\operatorname { Min } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \
\text { Subject to: } \
& \mathrm { X } _ { 1 } + 2 \mathrm { X } _ { 2 } \leq 1 \
& \mathrm { X } _ { 2 } \leq 1 \
& \mathrm { X } _ { 1 } \geq 0 , \mathrm { X } _ { 2 } \leq 0
\end{array}$$
This problem violates which of the following assumptions?

Accepted Answer

A) additivity 
B) divisibility 
C) non-negativity 
D) proportionality 
E) linearity 
A) additivity 
B) divisibility 
C) non-negativity 
D) proportionality 
E) linearity

Question 8

An isoprofit line represents a line whereby all profits are the same along the line.

Accepted Answer

A) True 
 B)False

________ follows a path of points inside the feasible region to find an optimal solution.

A redundant constraint is eliminated from a linear programming model.What effect will this have on the optimal solution?

Consider the following linear programming model: Max ++3 Subject to: +\leq3 +\leq1 ,\geq0 This problem violates which of the following assumptions?

Consider the following linear programming problem. Minimize + Subject to: +\geq16+\geq24 ,\geq0 Use Solver to find the optimal values of X₁ and X₂.

Consider the following linear programming problem. Minimize 3+2 Subject to: +\geq10 +\leq20 \leq10 \leq18 ,\geq0 Use Solver to find the optimal values of X₁ and X₂.

Consider the following linear programming model: Min 2+3 Subject to: +2\leq1 \leq1 \geq0,\leq0 This problem violates which of the following assumptions?

An isoprofit line represents a line whereby all profits are the same along the line.

Introduction to Managerial Decision Making

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Transportation, Assignment, and Network Models

Integer, Goal, and Nonlinear Programming Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters

Exam 2: Linear Programming Models: Graphical and Computer Methods

________ follows a path of points inside the feasible region to find an optimal solution.

A redundant constraint is eliminated from a linear programming model.What effect will this have on the optimal solution?

Consider the following linear programming model: Max ++3 Subject to: +\leq3 +\leq1 ,\geq0 This problem violates which of the following assumptions?

Consider the following linear programming problem. Minimize + Subject to: +\geq16+\geq24 ,\geq0 Use Solver to find the optimal values of X₁ and X₂.

Consider the following linear programming problem. Minimize 3+2 Subject to: +\geq10 +\leq20 \leq10 \leq18 ,\geq0 Use Solver to find the optimal values of X₁ and X₂.

Consider the following linear programming model: Min 2+3 Subject to: +2\leq1 \leq1 \geq0,\leq0 This problem violates which of the following assumptions?

An isoprofit line represents a line whereby all profits are the same along the line.

Introduction to Managerial Decision Making

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Transportation, Assignment, and Network Models

Integer, Goal, and Nonlinear Programming Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters