The transportation model allocates shipments to minimize what?
A Total machine speed
B Total shipping cost
C Number of routes only
D Demand variation
Answer: B. Total shipping cost. Transportation models minimize shipping cost while meeting supply and demand.
A balanced transportation model has total supply equal to what?
A Route count
B Total demand
C Unit cost
D Warehouse capacity only
Answer: B. Total demand. Balance requires aggregate supply to equal aggregate demand.
A dummy destination can balance excess what?
A Demand
B Shipping cost
C Supply
D Route distance
Answer: C. Supply. A dummy destination absorbs unused supply when total supply exceeds demand.
The northwest-corner method provides what?
A Optimality proof
B Shortest path
C Maximum flow cut
D Initial feasible solution
Answer: D. Initial feasible solution. The northwest-corner rule builds an initial transportation allocation.
The least-cost method allocates first to what cell?
A Highest demand
B Largest supply
C Lowest unit cost
D Upper-left cell always
Answer: C. Lowest unit cost. The least-cost rule chooses the currently cheapest route.
Vogel’s approximation uses what to choose allocations?
A Cost penalties
B Shortest distances only
C Random demand
D Dual prices only
Answer: A. Cost penalties. Vogel’s method calculates row and column penalties from cost differences.
The MODI method tests transportation solution what?
A Optimality
B Feasibility only
C Integer status
D Queue stability
Answer: A. Optimality. MODI computes opportunity costs to assess and improve a transportation plan.
A degenerate transportation solution may need what small allocation?
A Artificial demand
B Negative supply
C Epsilon allocation
D Infinite cost
Answer: C. Epsilon allocation. A small epsilon allocation can preserve the required number of basic cells.
An assignment problem matches agents to what?
A Multiple tasks freely
B Tasks one-to-one
C Routes to depots
D Machines to products only
Answer: B. Tasks one-to-one. Assignment models make one-to-one allocations at minimum cost or time.
The Hungarian method solves which model?
A Queueing model
B Inventory model
C Shortest-path model
D Assignment problem
Answer: D. Assignment problem. The Hungarian algorithm finds an optimal assignment efficiently.
A dummy job balances unequal numbers of what?
A Suppliers and customers
B Nodes and arcs
C Machines and shifts
D Agents and tasks
Answer: D. Agents and tasks. A dummy row or column makes the assignment matrix square.
A transshipment node allows what?
A Only final demand
B No flow
C Negative capacity
D Intermediate transfer
Answer: D. Intermediate transfer. Transshipment models permit goods to pass through intermediate nodes.
Dijkstra’s algorithm finds shortest paths with what edge condition?
A Negative cycles
B Nonnegative costs
C All equal costs
D No directed edges
Answer: B. Nonnegative costs. Dijkstra’s algorithm assumes nonnegative edge weights.
A minimum spanning tree connects all nodes with what total?
A Maximum flow
B Shortest single path
C Minimum edge weight
D Minimum node count
Answer: C. Minimum edge weight. A minimum spanning tree connects every node without cycles at minimum total edge cost.
The max-flow min-cut theorem equates maximum flow with what?
A Shortest path length
B Minimum cut capacity
C Total node count
D Minimum cost flow always
Answer: B. Minimum cut capacity. The maximum feasible source-to-sink flow equals the capacity of a minimum cut.
The critical path determines what project property?
A Minimum completion time
B Maximum inventory
C Minimum cost always
D Resource utilization
Answer: A. Minimum completion time. The longest-duration path sets the shortest possible project duration.
PERT uses optimistic, likely and what duration estimate?
A Pessimistic
B Average only
C Critical
D Guaranteed
Answer: A. Pessimistic. PERT uses three time estimates to account for uncertainty.
Total float is allowable delay without delaying what?
A Task start
B Resource arrival
C Project completion
D Cost estimate
Answer: C. Project completion. Total float measures activity delay that does not affect project completion time.
Crashing a project shortens duration by adding what?
A More float
B Fewer constraints
C Longer lead time
D Extra resources or cost
Answer: D. Extra resources or cost. Crashing trades additional direct cost for reduced activity duration.
CPM generally assumes activity durations are what?
A Randomly unknown
B Deterministic
C Always zero
D Normally distributed only
Answer: B. Deterministic. Traditional CPM treats activity times as known fixed estimates.
An activity-on-arrow network represents activities with what?
A Nodes only
B Costs only
C Queue states
D Arrows
Answer: D. Arrows. In AOA networks, arrows represent activities and nodes represent events.
Resource leveling adjusts schedule to address what?
A Resource over-allocation
B Product quality
C Transport cost only
D Demand forecast error
Answer: A. Resource over-allocation. Resource leveling shifts activities to smooth resource demand.
Johnson’s rule sequences jobs on how many machines?
A One machine
B Three machines always
C Two machines
D Unlimited machines
Answer: C. Two machines. Johnson’s rule finds an optimal sequence for a two-machine flow shop under its assumptions.
A dummy activity in a project network has what duration?
A Zero
B One day
C Critical duration
D Unknown duration
Answer: A. Zero. Dummy activities show precedence and consume no time or resources.
A shortest-path model minimizes what along a route?
A Total path cost
B Maximum throughput
C Total supply
D Number of constraints
Answer: A. Total path cost. The objective is the sum of arc costs along the chosen path.