Chap 3,4,6 Flashcards
dual value
the change in the objective value per unit increase in the RHS of constraints
Range of optimality
the range of values over which an objective value may vary without changing the optimal solution
objective function allowable increase/decrease
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
Sensitivity analysis
the study of how changes in the coefficients of a linear programming problem affect the optimal solution
reduced cost
the reduced cost of a variable is equal to the dual value on the non-negativilty constraint for that variable
range of feasibility
the range of values over which the dual value is applicable
RHS allowable increase/decrease
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.
Sunk cost
a cost that is not affected by the decision made. it will incurred no matter what values the decision variables assume
relevant costs
a cost that depends upon the decision made. Will vary depending on the decision variables
Transportation problem
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
network
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
nodes
the intersection or junction points of a network
arcs
the lines connecting the nodes in a network
dummy origin
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
capacitated transportation problem
a variation of the basic transportation problem in which some or all of the arcs are subject to capacity restrictions
assignment problem
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
transshipment problem
an extension of the transportation problem to distribution problems involving transfer points and possible shipments between any pair of nodes
capacitated transshipment problem
a variation of the transshipment problem in which some or all of the arcs are subject to capacity restrictions
shortest route
the shortest path between two nodes in a network
maximal flow
the max amount of flow that can enter and exit a network system during a given period of time…of course
flow capacity
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