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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 02, 1957
Accession Number
AD0606544

Entities

People

  • D. R. Fulkerson

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Coverings
  • Doctrine
  • Inequalities
  • Integrals
  • Logistics
  • Mathematics
  • Military Research
  • Scheduling (Production)
  • Sequences
  • Test And Evaluation
  • Transportation
  • Universities

Fields of Study

  • Mathematics

Readers

  • Aerospace logistics and air mobility.
  • Calculus or Mathematical Analysis
  • Theoretical Analysis.