A Feasibility Criterion for Staircase Transportation Problems and an Application to a Scheduling Problem
RAND CORP SANTA MONICA CA
Pagination or Media Count:
A feasibility criterion for transportation problems in which certain variables are inadmissible is shown to yield a simple feasibility test for such problems when the admissible set has the form of a staircase. A simple rule is then presented for singling out a feasible solution for staircase problems. As an application of these results, it is shown that a particular case of the problem of minimizing the number of carriers to meet a fixed schedule can be solved explicitly by an appropriate interpretation of the staircase rule.
- Operations Research