Accession Number:

AD0606544

Title:

A Feasibility Criterion for Staircase Transportation Problems and an Application to a Scheduling Problem

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1957-10-02

Pagination or Media Count:

18.0

Abstract:

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE