Question 1

An optimal solution must lie on the boundary of the feasible region.

Accepted Answer

A) True 
 B)False

Question 2

Problems with multiple optimal solutions always have at least two optimal corner points.

Accepted Answer

A) True 
 B)False

Question 3

The simplex method is the standard procedure for solving linear programming problems with any number of decision problems because:

Accepted Answer

A)  it is an efficient procedure.
B)  spreadsheets are not always available.
C)  it provides the information necessary for what-if analysis.
D)  a and b only.
E)  a and c only.F) A) and C)
G) B) and C)

Question 4

If a problem has more than one optimal solution then:

Accepted Answer

A)  the slope of the objective function line is the same as one of the constraints.
B)  the problem was not formulated correctly.
C)  the problem must be re-solved.
D)  All of the above.
E)  None of the above.F) B) and D)
G) C) and E)

Question 5

If a problem is infeasible,the Solver will show the message "Set Cell values do not converge".

Accepted Answer

A) True 
 B)False

Question 6

A linear programming problem may have: I.no optimal solutions.
II) exactly one optimal solution.
III) as many optimal solutions as there are decision variables.
IV) an infinite number of optimal solutions.

Accepted Answer

A)  II and IV only.
B)  II and III only.
C)  I,II,and III only.
D)  I,II,and IV only.
E)  All of the above.F) D) and E)
G) A) and D)

Question 7

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

Accepted Answer

A)  1.
B)  2.
C)  30.
D)  100.
E)  unlimited.F) B) and D)
G) C) and D)

Question 8

For any linear programming problem,the best corner point must be an optimal solution.

Accepted Answer

A) True 
 B)False

Question 9

The simplex method chooses the adjacent corner point that is closest when searching for an optimal solution.

Accepted Answer

A) True 
 B)False

Question 10

If a problem is unbounded then:

Accepted Answer

A)  the problem may not have been formulated correctly.
B)  the data may not have been entered correctly.
C)  at least one of the decision variable will have an optimal value of  ∞\infty∞ .
D)  None of the above.
E)  All of the above. F) D) and E)
G) A) and D)

Question 11

The simplex method only considers adjacent corner points.

Accepted Answer

A) True 
 B)False

Question 12

It can be helpful for management to have multiple optimal solutions.

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A)  the solution is not optimal.
B)  multiple optimal solutions may exist.
C)  a single corner point optimal solution exists.
D)  no feasible solution exists.
E)  None of the above.F) B) and E)
G) C) and D)

Question 14

If a maximization problem has an objective function of 3x1 + 10x2,which of the following corner points is the optimal solution?

Accepted Answer

A)  (0,2) .
B)  (0,3) .
C)  (3,3) .
D)  (5,1) .
E)  (0,0) .F) A) and D)
G) A) and E)

Question 15

The simplex method is an algorithm that can be used for solving only large-scale problems.

Accepted Answer

A) True 
 B)False

Question 16

A linear programming problem can have multiple optimal solutions.

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

If a maximization problem has an objective function of 3x1 + 2x2,which of the following corner points is the optimal solution?

Accepted Answer

A)  (0,2) .
B)  (0,3) .
C)  (3,3) .
D)  (5,1) .
E)  (0,0) .F) B) and C)
G) None of the above

Question 19

Interior-point algorithms:

Accepted Answer

A)  are far more complicated than the simplex method.
B)  require more computation time per iteration that the simplex method.
C)  tend to be much faster than the simplex method for huge problems.
D)  All of the above.
E)  a and b only.F) A) and D)
G) C) and E)

Question 20

If a problem is infeasible then:

Accepted Answer

A)  it was not formulated correctly.
B)  it is the constraints that are to blame,not the objective function.
C)  at least one of the decision variable will have an optimal value of infinity.
D)  None of the above.
E)  All of the above.F) A) and E)
G) D) and E)

Exam 17: CD - Solution Concepts for Linear Programming

The simplex method chooses the adjacent corner point that is closest when searching for an optimal solution.

Correct AnswerverifiedShow Answer

Interior-point algorithms:

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

For any linear programming problem,the best corner point must be an optimal solution.

Correct AnswerverifiedShow Answer

An optimal solution must lie on the boundary of the feasible region.

Correct AnswerverifiedShow Answer

If a maximization problem has an objective function of 3x1 + 10x2,which of the following corner points is the optimal solution?

Correct AnswerverifiedShow Answer

A linear programming problem may have: I.no optimal solutions. II) exactly one optimal solution. III) as many optimal solutions as there are decision variables. IV) an infinite number of optimal solutions.

Correct AnswerverifiedShow Answer

If a problem has more than one optimal solution then:

Correct AnswerverifiedShow Answer

If a problem is infeasible then:

Correct AnswerverifiedShow Answer

If a problem is unbounded then:

Correct AnswerverifiedShow Answer

It can be helpful for management to have multiple optimal solutions.

Correct AnswerverifiedShow Answer

Problems with multiple optimal solutions always have at least two optimal corner points.

Correct AnswerverifiedShow Answer

The simplex method is the standard procedure for solving linear programming problems with any number of decision problems because:

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A linear programming problem can have multiple optimal solutions.

Correct AnswerverifiedShow Answer

The simplex method is an algorithm that can be used for solving only large-scale problems.

Correct AnswerverifiedShow Answer

If a maximization problem has an objective function of 3x1 + 2x2,which of the following corner points is the optimal solution?

Correct AnswerverifiedShow Answer

The simplex method only considers adjacent corner points.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

If a problem is infeasible,the Solver will show the message "Set Cell values do not converge".

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

If a maximization problem has an objective function of 3x₁ + 10x₂,which of the following corner points is the optimal solution?

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

If a maximization problem has an objective function of 3x₁ + 2x₂,which of the following corner points is the optimal solution?

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified