Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

The Multi-Index Problem

K. B. Haley
Operations Research
Vol. 11, No. 3 (May - Jun., 1963), pp. 368-379
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/168025
Page Count: 12
  • Download ($30.00)
  • Cite this Item
The Multi-Index Problem
Preview not available

Abstract

The multi-index transportation problem is defined and a summary of the algorithm described in an earlier paper is given. This paper discusses the theorems justifying the use of the algorithm and gives a necessary condition for the existence of a solution. It also describes the formulation of three special-structure linear-programming problems as examples of multi-index problems. The three problems discussed are the capacitated Hitchcock problem, transportation where there is more than one method of transport available, and the transformation of one type of multi-index problem into another. A final section describes problems that have restrictions in the form of inequalities.

Page Thumbnails

  • Thumbnail: Page 
368
    368
  • Thumbnail: Page 
369
    369
  • Thumbnail: Page 
370
    370
  • Thumbnail: Page 
371
    371
  • Thumbnail: Page 
372
    372
  • Thumbnail: Page 
373
    373
  • Thumbnail: Page 
374
    374
  • Thumbnail: Page 
375
    375
  • Thumbnail: Page 
376
    376
  • Thumbnail: Page 
377
    377
  • Thumbnail: Page 
378
    378
  • Thumbnail: Page 
379
    379