Question 1

The simplex method only considers adjacent corner points

Accepted Answer

A) True 
 B)False  True

Question 2

Whenever possible,the initialization step of the simplex method chooses the origin to be the initial corner point

Accepted Answer

A) True 
 B)False  True

Question 3

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

Accepted Answer

A) True 
 B)False  False

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

Question 5

It is possible to have more than one corner point of the feasible region as an optimal solution to a linear programming problem

Accepted Answer

A) True 
 B)False

Question 6

If the feasible region in a linear programming problem is unbounded,then the problem is unbounded

Accepted Answer

A) True 
 B)False

Question 7

Interior-point algorithms have limited capability for what-if analysis

Accepted Answer

A) True 
 B)False

Question 8

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

Question 9

There are no feasible solutions to a problem when the constraints are too restrictive

Accepted Answer

A) True 
 B)False

Question 10

If some necessary constraints were not included in a linear programming model,it is possible to have no limit on the best objective function value

Accepted Answer

A) True 
 B)False

Question 11

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 ∞ 
D) None of the above 
E) All of the above 
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 ∞ 
D) None of the above 
E) All of the above

Question 12

Like the enumeration-of corner-points method,the simplex method evaluates all of the corner points of a problem

Accepted Answer

A) True 
 B)False

Question 13

The simplex method includes which of the following components?

Accepted Answer

A) An initialization step 
B) An optimality test 
C) A trial step 
D) All of the above 
E) a and b only 
A) An initialization step 
B) An optimality test 
C) A trial step 
D) All of the above 
E) a and b only

Question 14

If a linear programming problem does not have an optimal solution then it must be infeasible

Accepted Answer

A) True 
 B)False

Question 15

Most linear programming problems have just one optimal solution

Accepted Answer

A) True 
 B)False

Question 16

The data given in Solver's sensitivity report are obtained directly from the output of the simplex method

Accepted Answer

A) True 
 B)False

Question 17

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) 
A) (0,2) 
B) (0,3) 
C) (3,3) 
D) (5,1) 
E) (0,0)

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

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) 
A) (0,2) 
B) (0,3) 
C) (3,3) 
D) (5,1) 
E) (0,0)

Question 20

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

Accepted Answer

A) True 
 B)False

The simplex method only considers adjacent corner points

Whenever possible,the initialization step of the simplex method chooses the origin to be the initial corner point

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

If a problem has more than one optimal solution then:

It is possible to have more than one corner point of the feasible region as an optimal solution to a linear programming problem

If the feasible region in a linear programming problem is unbounded,then the problem is unbounded

Interior-point algorithms have limited capability for what-if analysis

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

There are no feasible solutions to a problem when the constraints are too restrictive

If some necessary constraints were not included in a linear programming model,it is possible to have no limit on the best objective function value

If a problem is unbounded then:

Like the enumeration-of corner-points method,the simplex method evaluates all of the corner points of a problem

The simplex method includes which of the following components?

If a linear programming problem does not have an optimal solution then it must be infeasible

Most linear programming problems have just one optimal solution

The data given in Solver's sensitivity report are obtained directly from the output of the simplex method

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

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

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

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

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 only considers adjacent corner points

Whenever possible,the initialization step of the simplex method chooses the origin to be the initial corner point

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

If a problem has more than one optimal solution then:

It is possible to have more than one corner point of the feasible region as an optimal solution to a linear programming problem

If the feasible region in a linear programming problem is unbounded,then the problem is unbounded

Interior-point algorithms have limited capability for what-if analysis

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

There are no feasible solutions to a problem when the constraints are too restrictive

If some necessary constraints were not included in a linear programming model,it is possible to have no limit on the best objective function value

If a problem is unbounded then:

Like the enumeration-of corner-points method,the simplex method evaluates all of the corner points of a problem

The simplex method includes which of the following components?

If a linear programming problem does not have an optimal solution then it must be infeasible

Most linear programming problems have just one optimal solution

The data given in Solver's sensitivity report are obtained directly from the output of the simplex method

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

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

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

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

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

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

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