Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

When choosing which corner point to advance to next,the simplex method chooses the one:

Accepted Answer

A)  that is closest 
B)  along the edge with the largest rate of improvement 
C)  along the edge with a negative rate of improvement 
D)  that is furthest from the origin 
E)  None of the above F) All of the above
G) None of the above

Question 3

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 B)
G) C) and D)

Question 4

The simplex method is which kind of algorithm?

Accepted Answer

A)  iterative 
B)  repetitive 
C)  systematic 
D)  All of the above 
E)  None of the above F) C) and D)
G) B) and E)

Question 5

The simplex method can only solve problems with up to 100 functional constraints

Accepted Answer

A) True 
 B)False

Question 6

The simplex method is a specific type of interior-point algorithm

Accepted Answer

A) True 
 B)False

Question 7

The enumeration-of-corner-points method is limited because it can only solve problems with two decision variables

Accepted Answer

A) True 
 B)False

Question 8

It can be helpful for management to have multiple optimal solutions

Accepted Answer

A) True 
 B)False

Question 9

The optimal solution of a feasible linear programming problem includes at least one corner point of the feasible region

Accepted Answer

A) True 
 B)False

Question 10

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) A) and B)
G) C) and D)

Question 11

Two corner points are adjacent to each other if they share all but one of the same constraint boundaries

Accepted Answer

A) True 
 B)False

Question 12

In a linear programming problem with two decision variables,it is possible to have no point that satisfies all of the constraints simultaneously

Accepted Answer

A) True 
 B)False

Question 13

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 E)
G) A) and D)

Question 14

A linear programming problem can have multiple optimal solutions

Accepted Answer

A) True 
 B)False

Question 15

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) B) and C)
G) A) and E)

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

Management science algorithms are typically iterative algorithms

Accepted Answer

A) True 
 B)False

Question 18

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 19

A linear programming problem may have:

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) B) and D)

Question 20

The computer time per iteration for an interior-point algorithm is approximately the same as for the simplex method

Accepted Answer

A) True 
 B)False

Exam 14: Solution concepts for linear programming

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

Correct AnswerverifiedShow Answer

It can be helpful for management to have multiple optimal solutions

Correct AnswerverifiedShow Answer

When choosing which corner point to advance to next,the simplex method chooses the one:

Correct AnswerverifiedShow Answer

The simplex method is which kind of algorithm?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

In a linear programming problem with two decision variables,it is possible to have no point that satisfies all of the constraints simultaneously

Correct AnswerverifiedShow Answer

The simplex method is a specific type of interior-point algorithm

Correct AnswerverifiedShow Answer

Management science algorithms are typically iterative algorithms

Correct AnswerverifiedShow Answer

The simplex method can only solve problems with up to 100 functional constraints

Correct AnswerverifiedShow Answer

The computer time per iteration for an interior-point algorithm is approximately the same as for the simplex method

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A linear programming problem may have:

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

The optimal solution of a feasible linear programming problem includes at least one corner point of the feasible region

Correct AnswerverifiedShow Answer

Interior-point algorithms:

Correct AnswerverifiedShow Answer

Two corner points are adjacent to each other if they share all but one of the same constraint boundaries

Correct AnswerverifiedShow Answer

The enumeration-of-corner-points method is limited because it can only solve problems with two decision variables

Correct AnswerverifiedShow Answer

If a problem is infeasible then:

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A linear programming problem can have multiple optimal solutions

Correct AnswerverifiedShow Answer

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

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