Deck 3: Linear programming: Formulation and applications

Question 1

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

Answer 1

False

Question 2

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

Answer 2

False

Question 3

A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model

Answer 3

False

Question 4

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

Question 5

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

Question 6

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

Question 7

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

Question 8

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

Question 9

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

Question 10

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

Question 11

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

Question 12

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

Question 13

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

Question 14

The objective cell is a special kind of output cell

Question 15

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

Question 16

Linear programming does not permit fractional solutions

Question 17

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 18

A benefit constraint refers to a functional constraint with a ≥ sign in a linear programming model

Question 19

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 20

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

Question 21

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

Question 22

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

Question 23

Model formulation should precede problem formulation

Question 24

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

Question 25

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 26

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

Question 27

Transportation problems always involve shipping goods from one location to another

Question 28

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

Question 29

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 30

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

Question 31

Blending problems are a special type of mixed linear programming problems

Question 32

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 33

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 34

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

Question 35

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

Question 36

An assignment problem is a special type of transportation problem

Question 37

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

Question 38

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

Question 39

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

Question 40

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

Question 41

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

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

Question 42

Resource-allocation problems have the following type of constraints:

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

Question 43

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 44

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 45

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 46

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

A)≤
B)>
C)=
D)All of the above
E)a and c only

Question 47

Where is the objective cell located?

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

Question 48

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 49

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 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 objective cell
E)All of the above

Question 51

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 52

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 53

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

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 55

Mixed problems may have the following type of constraints:

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

Question 56

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

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