all chapters Flashcards

(43 cards)

1
Q

The problem which deals with the distribution of goods from several sources to several destinations is the

A

transportation problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

the parts of a network that represent the origins are

A

the nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

the number of units shipped from origin i to destination j is respresented by

A

Xij

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

IN a transshipment formulation in which you have two plants shipping centers three in turn can ship to any one of six customer zones, the number of constraints is

A

11

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

IF you have a transportation problem in which the total supply is greater than the total demand,you will need to

A

make no additional changes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The difference between the transportation and assignment problems is that

A

each supply and demand value is 1 in the assignment problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

which of the following is not true regarding an LP model of the assignment problem

A

all constraints are of the > or equal too form

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

if a transportation problem has four origin and five destinations, the LP formulation of the problem will have

A

9 constraints

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

the assignment problem constraint x31+x32 +x33+x34

A

agent 3 can be assigned to 1 task

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

consider a shortest route problem in whcih a bank courier must travel between branches and the main operations center. When represented with a network,

A

the branches and the operations center are all nodes and the streetsare the arcs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

THe shortest route problme finds the shortest-route

A

from the source to any other note

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

rounding the solution of an lp relaxation to the nearest integer values provide s

A

an integer solution that might be neither feasible nor optimal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Let x1, x2, and x3 be 0-1 variables whose values indidcate whether the projects are not done(0) or are done(1). Which answer below indicatest hat at least two of the projects must be done?

A

X1+X2+x3 >2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

In an all-integer linear program,

A

all variables must be integer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

most practical applications of integer linear programming involve

A

only 0-1 integer variables and not ordinary integer variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

project management differs from management of more traditional day-to-day activities because:

A

it has limited time frame

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Arcs in a project network indicate

A

prrecedence relationships

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

The critical path is the _____ path through the network

19
Q

IF an activity cannot be delayed without affecting the entire project, then it is a _____ activity

20
Q

A PERT/CPM activity has an optimistic time estimate of 4 days, a most likely time estimate of 6 days, and a pessimistic time estimate of 10 days. the expected time is

21
Q

When activity times are uncertain

A

calculate the expected time, using (a+4m+b)/6

22
Q

To determine how to crash activity times

A

all of the alternatives are true

23
Q

In deciding which activities to crash, one must

A

crash activities on the critical paths only

24
Q

_____ demand items are final products demanded by an external customer.

25
Safety Stock
depends on the variability of demand during lead time
26
Annual purchase cost is included in the total cost in
the quantity discount model
27
in the single-period inventory model with probabilistic demand,
probabilities are used to calculate expected losses
28
A firm that is presently using the eoq model and is planning to switch to the economic production lot-size model can expect
the Q* to increase
29
The objective of the EOQ with quantity discounts model is to
minimize the sum of anual carrying, holding, and purchase costs
30
Inventory position is defined as the amount of inventory on hand plus the amount
on order
31
Decision alternatives
should be identified before decision criteria are established
32
A model that uses a system of symbols to represent a problem is called
mathematical
33
a one-machine shop producing olts has a fixed cost of 2,000,000 and a variable cost of 2.00 per bolt. The selling price is 6.00 per unit. The breakeven volume of production is
500
34
Decision variables
tell how much or how many of something to produce, invest, purchase, hire, etc
35
a solution that satisfies all of the constraints on a linear programming problem except the nonnegativity constraints is called
infeasile
36
a complete formulation for a linear programming problem must include
variable definition, objective function, constraints, and non-negativity
37
which of the following special cases does not require reformulation of the problem in order to obtain a solution?
alternate optimality
38
Which of the following statements is not true
an infeasible solution violates all constraints
39
INfeasibility means that the number of solutions to the linear programming models that satisfies all constraints is
0
40
A constraint that does not affect the feasible region is a
redundant constraint
41
a negative dual price for a >= constraint in a minimization problem means
as the right-hand side increases, the objective function value will increase
42
A constraint with a positive slack value
will have a dual price o zero
43
which of the following is not a question answered by sensitivity analysis
by how much will the objective function value change if the right-hand side value of a constraint changes beyond the range of feasibility