Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule

Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule

$20.00 $20.00 Sale

A proof that the problem of determining the minimum number of carriers required to meet a fixed schedule of transportation can be made into a linear programming problem.