Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
17 Cards in this Set
- Front
- Back
|
These often have constraints where percentages are involved
|
blending mdoels
|
|
|
describe flow in a connected system
|
network models
|
|
|
flow of stuff, people, money
|
Arcs
|
|
|
cities, warehouses, assembly lines, time points
|
nodes
|
|
|
Flow of goods within a supply chain
|
Transportation Models
|
|
|
Flow of individuals to tasks
|
Assignment Models
|
|
|
Supply chains with two stages of flow
|
Transshipment Models
|
|
|
what are three network models?
|
transportation models, assignment models, transshipment models
|
|
|
Involves shipment across the supply chain
Supply Sources With known capacities Demand Locations With known requirements Transportation Costs Unit costs between supply-demand pairs |
The Transportation Model
|
|
|
Find best assignment of people to tasks
All capacities =1 All requirements = 1 Total supply = Total demand |
assignment problems
|
|
|
Has two stages of flow instead of just one
Has two rectangular tables of costs Origin Nodes (Supply) Transshipment Nodes Destination Nodes (Demand) |
transshipment model
|
|
|
When one or more decision variables must be integers we have
|
interger programming
|
|
|
Rounding a standard LP ------------- an optimal IP solution
|
does not guarantee
|
|
|
, which takes on the values zero or one, can be used to represent a “go / no-go” decision.
|
binary variable
|
|
|
three types of relationships among projects
|
at least m projects must be selected
at most n projects must be selected exactly k projects must be selected |
|
|
in a set covering problem all variables are
|
binary
|
|
|
in a set covering problem parameters in the constraints are
|
binary
|
