DTMB UNIVAC TRANSPORTATION SIMPLEX.

This report describes the methods and UNIVAC I routines developed to obtain initial solutions for Suzuki's Transportation Simplex Method (PB-128 850). The initial solutions considered are the column, row, and matrix minimal (or maximal) and the Northwest Passage solution. At present the m x n c...

Full description

Bibliographic Details
Main Author: Gray,Gilbert R.
Other Authors: DAVID TAYLOR MODEL BASIN WASHINGTON D C
Format: Text
Language:English
Published: 1958
Subjects:
TRANSPORTATION
LINEAR PROGRAMMING
COMPUTER PROGRAMMING
UNIVAC
Northwest Passage
Northwest passage
Online Access:http://www.dtic.mil/docs/citations/AD0615325
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0615325
Description
Summary:This report describes the methods and UNIVAC I routines developed to obtain initial solutions for Suzuki's Transportation Simplex Method (PB-128 850). The initial solutions considered are the column, row, and matrix minimal (or maximal) and the Northwest Passage solution. At present the m x n cost matrix is limited by m < or = 30 and m + n < or = 719. The starting routines developed serve two main purposes: (1) To obviate tedious hand calculations and data tape preparations, and (2) To reduce the machine time required to solve a complete transportation problem. (Author)

Similar Items