Chap 3,4,6

Question 1

dual value

Answer 1

the change in the objective value per unit increase in the RHS of constraints

Question 2

Range of optimality

Answer 2

the range of values over which an objective value may vary without changing the optimal solution

Question 3

objective function allowable increase/decrease

Answer 3

the amount the coefficient may increase/decrease without causing any change in the values of the decision variables in the optimal solution. it can be used to calculate the range of optimality

Question 4

Sensitivity analysis

Answer 4

the study of how changes in the coefficients of a linear programming problem affect the optimal solution

Question 5

reduced cost

Answer 5

the reduced cost of a variable is equal to the dual value on the non-negativilty constraint for that variable

Question 6

range of feasibility

Answer 6

the range of values over which the dual value is applicable

Question 7

RHS allowable increase/decrease

Answer 7

the amount the RHS may increase/decrease without causing any change in the dual value for that constraint.
Can be used to calculate the range of feasibility for that constraint.

Question 8

Sunk cost

Answer 8

a cost that is not affected by the decision made. it will incurred no matter what values the decision variables assume

Question 9

relevant costs

Answer 9

a cost that depends upon the decision made. Will vary depending on the decision variables

Question 10

Transportation problem

Answer 10

a network flow problem that often involves minimizing the cost of shipping goods from a set of origins to a set of destinations. It can be formulated and solved as a linear program by including a variable for each arc and a constraint for each node

Question 11

network

Answer 11

a graphical representation of a problem consisting of numbered circles (nodes) interconnected by a series of lines (arcs), arrowheads on the arcs show the direction of flow (duh). transportation, assignment, and transshipment problems are network flow problems

Question 12

nodes

Answer 12

the intersection or junction points of a network

Question 13

arcs

Answer 13

the lines connecting the nodes in a network

Question 14

dummy origin

Answer 14

an origin added to a transportation problem to make the total supply equal to the total demand. the supply assigned to the dummy origin is the difference between the total demand and the total supply

Question 15

capacitated transportation problem

Answer 15

a variation of the basic transportation problem in which some or all of the arcs are subject to capacity restrictions

Question 16

assignment problem

Answer 16

a network flow problem that often involves the assignment of agents to tasks. it can be formulated as a linear program and is a special case of the transportation problem

Question 17

transshipment problem

Answer 17

an extension of the transportation problem to distribution problems involving transfer points and possible shipments between any pair of nodes

Question 18

capacitated transshipment problem

Answer 18

a variation of the transshipment problem in which some or all of the arcs are subject to capacity restrictions

Question 19

shortest route

Answer 19

the shortest path between two nodes in a network

Question 20

maximal flow

Answer 20

the max amount of flow that can enter and exit a network system during a given period of time…of course

Question 21

flow capacity

Answer 21

the max flow for an arc of the network. the flow capacity is one direction may not equal the flow capacity in the reverse direction