Question 1

Fixed-requirement constraints in a linear programming model are functional constraints that use an equal sign

Accepted Answer

A) True 
 B)False  True

Question 2

Linear programming does not permit fractional solutions

Accepted Answer

A) True 
 B)False  False

Question 3

Using techniques to test the initial versions of a model to identify errors and omissions is called:

Accepted Answer

A) model validation 
B) model enrichment 
C) model enhancement 
D) model debugging 
E) None of the above 
A) model validation 
B) model enrichment 
C) model enhancement 
D) model debugging 
E) None of the above A

Question 4

A mixed linear programming problem will always contain some of each of the three types of constraints in it

Accepted Answer

A) True 
 B)False

Question 5

Mixed problems may have the following type of constraints:

Accepted Answer

A) ≥ 
B) ≤ 
C) = 
D) All of the above 
E) None of the above 
A) ≥ 
B) ≤ 
C) = 
D) All of the above 
E) None of the above

Question 6

Once a linear programming problem has been formulated,it is rare to make major adjustments to it

Accepted Answer

A) True 
 B)False

Question 7

Cost-benefit tradeoff problems have the following type of constraints:

Accepted Answer

A) ≥ 
B) ≤ 
C) = 
D) < 
E) None of the above 
A) ≥ 
B) ≤ 
C) = 
D) < 
E) None of the above

Question 8

For cost-benefit-tradeoff problems,minimum acceptable levels for each kind of benefit are prescribed and the objective is to achieve all these benefits with minimum cost

Accepted Answer

A) True 
 B)False

Question 9

The transportation model method for evaluating location alternatives minimizes:

Accepted Answer

A) the number of sources 
B) the number of destinations 
C) total supply 
D) total demand 
E) total shipping cost 
A) the number of sources 
B) the number of destinations 
C) total supply 
D) total demand 
E) total shipping cost

Question 10

When formulating a transportation problem on a spreadsheet,which of the following are necessary?

Accepted Answer

A) A table of data 
B) A network representation 
C) A table for the solution 
D) a and c only 
E) All of the above 
A) A table of data 
B) A network representation 
C) A table for the solution 
D) a and c only 
E) All of the above

Question 11

The capacity row in a distribution-network formulation shows the maximum number of units than can be shipped through the network

Accepted Answer

A) True 
 B)False

Question 12

When formulating a linear programming model on a spreadsheet,the constraints are located (in part)in the output cells

Accepted Answer

A) True 
 B)False

Question 13

Financial planning is one of the most important areas of application for cost-benefit-tradeoff problems

Accepted Answer

A) True 
 B)False

Question 14

Where are the changing cells located?

Accepted Answer

A) B2:D2 
B) B2:D2,B4:D7,and G5:G7 
C) B10:D10 
D) E5:E7 
E) G10 
A) B2:D2 
B) B2:D2,B4:D7,and G5:G7 
C) B10:D10 
D) E5:E7 
E) G10

Question 15

Which of the following is not information needed to use the transportation model?

Accepted Answer

A) Capacity of the sources 
B) Demand of the destinations 
C) Unit shipping costs 
D) Unit shipping distances 
E) All of the above 
A) Capacity of the sources 
B) Demand of the destinations 
C) Unit shipping costs 
D) Unit shipping distances 
E) All of the above

Question 16

The requirements assumption states that each source has a fixed supply of units,where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units,where the entire demand must be received from the sources

Accepted Answer

A) True 
 B)False

Question 17

Blending problems are a special type of mixed linear programming problems

Accepted Answer

A) True 
 B)False

Question 18

An assignment problem:

Accepted Answer

A) is a special transportation problem 
B) will always have an integer solution 
C) has all supplies and demands equal to 1 
D) None of the above 
E) All of the above 
A) is a special transportation problem 
B) will always have an integer solution 
C) has all supplies and demands equal to 1 
D) None of the above 
E) All of the above

Question 19

A transportation problem requires a unit cost for every source-destination combination

Accepted Answer

A) True 
 B)False

Question 20

It is usually quite simple to obtain estimates of parameters in a linear programming problem

Accepted Answer

A) True 
 B)False

Fixed-requirement constraints in a linear programming model are functional constraints that use an equal sign

Linear programming does not permit fractional solutions

Using techniques to test the initial versions of a model to identify errors and omissions is called:

A mixed linear programming problem will always contain some of each of the three types of constraints in it

Mixed problems may have the following type of constraints:

Once a linear programming problem has been formulated,it is rare to make major adjustments to it

Cost-benefit tradeoff problems have the following type of constraints:

For cost-benefit-tradeoff problems,minimum acceptable levels for each kind of benefit are prescribed and the objective is to achieve all these benefits with minimum cost

The transportation model method for evaluating location alternatives minimizes:

When formulating a transportation problem on a spreadsheet,which of the following are necessary?

The capacity row in a distribution-network formulation shows the maximum number of units than can be shipped through the network

When formulating a linear programming model on a spreadsheet,the constraints are located (in part)in the output cells

Financial planning is one of the most important areas of application for cost-benefit-tradeoff problems

Where are the changing cells located?

Which of the following is not information needed to use the transportation model?

The requirements assumption states that each source has a fixed supply of units,where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units,where the entire demand must be received from the sources

Blending problems are a special type of mixed linear programming problems

An assignment problem:

A transportation problem requires a unit cost for every source-destination combination

It is usually quite simple to obtain estimates of parameters in a linear programming problem

Introduction

Linear programming: Basic Concepts

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

Solution concepts for linear programming

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 3: Linear programming: Formulation and applications

Fixed-requirement constraints in a linear programming model are functional constraints that use an equal sign

Linear programming does not permit fractional solutions

Using techniques to test the initial versions of a model to identify errors and omissions is called:

A mixed linear programming problem will always contain some of each of the three types of constraints in it

Mixed problems may have the following type of constraints:

Once a linear programming problem has been formulated,it is rare to make major adjustments to it

Cost-benefit tradeoff problems have the following type of constraints:

For cost-benefit-tradeoff problems,minimum acceptable levels for each kind of benefit are prescribed and the objective is to achieve all these benefits with minimum cost

The transportation model method for evaluating location alternatives minimizes:

When formulating a transportation problem on a spreadsheet,which of the following are necessary?

The capacity row in a distribution-network formulation shows the maximum number of units than can be shipped through the network

When formulating a linear programming model on a spreadsheet,the constraints are located (in part)in the output cells

Financial planning is one of the most important areas of application for cost-benefit-tradeoff problems

Where are the changing cells located?

Which of the following is not information needed to use the transportation model?

The requirements assumption states that each source has a fixed supply of units,where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units,where the entire demand must be received from the sources

Blending problems are a special type of mixed linear programming problems

An assignment problem:

A transportation problem requires a unit cost for every source-destination combination

It is usually quite simple to obtain estimates of parameters in a linear programming problem

Introduction

Linear programming: Basic Concepts

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

Solution concepts for linear programming

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