Question 1

It is possible in some cases for a point inside the boundary of the feasible region to be an optimal solution

Accepted Answer

A) True 
 B)False

Question 2

In a linear programming problem,there is always at least one optimal corner point

Accepted Answer

A) True 
 B)False

Question 3

The ability to solve large problems with the simplex method is limited primarily by:

Accepted Answer

A) the number of decision variables 
B) the size of the parameters in the model 
C) the number of functional constraints 
D) the software package chosen 
E) None of the above 
A) the number of decision variables 
B) the size of the parameters in the model 
C) the number of functional constraints 
D) the software package chosen 
E) None of the above

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

Management may choose a single product mix from among multiple optimal solutions because of:

Accepted Answer

A) a desire to highlight a new product 
B) needs of an important customer 
C) strategies adopted by competitors 
D) All of the above 
E) None of the above 
A) a desire to highlight a new product 
B) needs of an important customer 
C) strategies adopted by competitors 
D) All of the above 
E) None of the above

It is possible in some cases for a point inside the boundary of the feasible region to be an optimal solution

In a linear programming problem,there is always at least one optimal corner point

The ability to solve large problems with the simplex method is limited primarily by:

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

Management may choose a single product mix from among multiple optimal solutions because of:

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

It is possible in some cases for a point inside the boundary of the feasible region to be an optimal solution

In a linear programming problem,there is always at least one optimal corner point

The ability to solve large problems with the simplex method is limited primarily by:

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

Management may choose a single product mix from among multiple optimal solutions because of:

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