Deck 3: Linear Programming: Formulation and Applications

Question 1

When studying a resource-allocation problem,it is necessary to determine the contribution per unit of each activity to the overall measure of performance.

Answer 1

True

Question 2

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

Answer 2

False

Question 3

A benefit constraint refers to a functional constraint with a $\ge$ sign in a linear programming model.

Answer 3

True

Question 4

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

Question 5

When formulating a linear programming model on a spreadsheet,the measure of performance is located in the target cell.

Question 6

In most cases,the minimum acceptable level for a cost-benefit-tradeoff problem is set by how much money is available.

Question 7

A resource constraint refers to any functional constraint with a $\ge$ sign in a linear programming model.

Question 8

Strict inequalities (i.e.,< or >)are not permitted in linear programming formulations.

Question 9

A key assumption of linear programming is that the equation for each of the output cells,including the target cell,can be expressed as a SUMPRODUCT (or SUM)function.

Question 10

When formulating a linear programming model on a spreadsheet,the decisions to be made are located in the data cells.

Question 11

A mathematical model will be an exact representation of the real problem.

Question 12

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.

Question 13

In the algebraic form of a resource constraint,the coefficient of each decision variable is the resource usage per unit of the corresponding activity.

Question 14

Approximations and simplifying assumptions generally are required to have a workable model.

Question 15

Cost-benefit-tradeoff problems are linear programming problems involving the allocation of limited resources to activities.

Question 16

Resource-allocation problems are linear programming problems involving the allocation of limited resources to activities.

Question 17

When formulating a linear programming problem on a spreadsheet,data cells will show the levels of activities for the decisions being made.

Question 18

The target cell is a special kind of output cell.

Question 19

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

Question 20

Linear programming does not permit fractional solutions.

Question 21

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.

Question 22

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

Question 23

It is fairly common to have both resource constraints and benefit constraints in the same formulation.

Question 24

Model formulation should precede problem formulation.

Question 25

Transportation problems always involve shipping goods from one location to another.

Question 26

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

Question 27

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

Question 28

Transportation problems are concerned with distributing commodities from sources to destinations in such a way as to minimize the total distribution cost.

Question 29

A linear programming model contains which of the following components?

A)Data.
B)Decisions.
C)Constraints.
D)Measure of performance.
E)All of the above.

Question 30

It is the nature of the restrictions imposed on the decisions regarding the mix of activity levels that determines the classification of the resulting linear programming formulation.

Question 31

Generally,assignment problems match people to an equal number of tasks at a minimum cost.
Multiple Choice Questions

Question 32

Blending problems are a special type of mixed linear programming problems.

Question 33

Choosing the best tradeoff between cost and benefits is a managerial judgement decision.

Question 34

It is the nature of the application that determines the classification of the resulting linear programming formulation.

Question 35

Having one requirement for each location is a characteristic common to all transportation problems.

Question 36

When dealing with huge real problems,there is no such thing as the perfectly correct linear programming model for the problem.

Question 37

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

Question 38

Which of the following are categories of linear programming problems?

A)Resource-allocation problems.
B)Cost-benefit-tradeoff problems.
C)Distribution-network problems.
D)All of the above.
E)None of the above.

Question 39

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

Question 40

An assignment problem is a special type of transportation problem

Question 41

Resource-allocation problems have the following type of constraints:

A) $\ge$ .
B) $\le$ .
C)=.
D)<.
E)None of the above.

Question 42

Starting with a simple version of a model and adding to it until it reflects the real problem is called:

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

Question 43

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

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

Question 44

Mixed problems may have the following type of constraints:

A) $\ge$ .
B) $\le$ .
C)=.
D)All of the above.
E)None of the above.

Question 45

Transportation problems have the following type of constraints:

A) $\ge$ .
B) $\le$ .
C)=.
D)<.
E)None of the above.

Question 46

The transportation model method for evaluating location alternatives minimizes:

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

Question 47

Applications of assignment problems may include:

A)matching personnel to jobs.
B)assigning machines to tasks.
C)designing bussing routes.
D)a and b only.
E)All of the above.

Question 48

A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called:

A)a resource-allocation problem.
B)a blending problem.
C)a cost-benefit tradeoff problem.
D)a mixture problem.
E)None of the above.

Question 49

Figure
Where are the output cells located?

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

Question 50

When formulating a linear programming problem on a spreadsheet,which of the following is true?

A)Parameters are called data cells.
B)Decision variables are called changing cells.
C)Right hand sides are part of the constraints.
D)The objective function is called the target cell.
E)All of the above.

Question 51

In linear programming formulations,it is possible to have the following types of constraints:

A) $\le$ .
B)>.
C)=.
D)a and c only.
E)All of the above.

Question 52

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

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

Question 53

Figure
Where are data cells located?

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

Question 54

An assignment problem:

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 55

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

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 56

Figure
Where are the changing cells located?

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

Question 57

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

A) $\ge$ .
B) $\le$ .
C)=.
D)<.
E)None of the above.

Question 58

Figure
Where is the target cell located?

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