Cover: Notes on Linear Programming

Notes on Linear Programming

Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem

Published 1956

by L. R. Ford, D. R. Fulkerson

Download

Download Free Electronic Document

FormatFile SizeNotes
PDF file 0.7 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.

Purchase

Purchase Print Copy

 Format Price
Add to Cart Paperback17 pages $20.00

An algorithm for solving capacitated Hitchcock problems and a proof of convergence in a finite number of steps. The proposed algorithm is a generalization of a combinatorial method discovered by Kuhn for the optimal assignment problem. It uses as a subroutine the flow algorithm previously developed.

This report is part of the RAND research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.