Question 1

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 
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

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

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 4

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 
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

Question 5

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 
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

Question 6

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 
A) iterative 
B) repetitive 
C) systematic 
D) All of the above 
E) None of the above

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 
A) 1 
B) 2 
C) 30 
D) 100 
E) unlimited

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

A linear programming problem can have multiple optimal solutions

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

It can be helpful for management to have multiple optimal solutions

Accepted Answer

A) True 
 B)False

Question 12

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 13

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 14

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 
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

Question 15

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 16

Management science algorithms are typically iterative algorithms

Accepted Answer

A) True 
 B)False

Question 17

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

Question 18

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 
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

Question 19

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 20

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

Accepted Answer

A) True 
 B)False

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

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

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

Interior-point algorithms:

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

The simplex method is which kind of algorithm?

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

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

A linear programming problem can have multiple optimal solutions

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

It can be helpful for management to have multiple optimal solutions

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

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

If a problem is infeasible then:

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

Management science algorithms are typically iterative algorithms

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

A linear programming problem may have:

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

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

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

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:

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

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

Interior-point algorithms:

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

The simplex method is which kind of algorithm?

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

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

A linear programming problem can have multiple optimal solutions

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

It can be helpful for management to have multiple optimal solutions

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

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

If a problem is infeasible then:

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

Management science algorithms are typically iterative algorithms

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

A linear programming problem may have:

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

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

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters