A technique for speeding convergence in solving linear programs

Thumbnail Image
Files
Eastbrook.pdf (1.21 MB)
Authors
Easterbook, John Edmund
Subjects
Linear Programming
Primal - dual Algorithm
Modified primal - dual
Computer program for primal - dual
Advisors
Greenberg, Harold
Date of Issue
1968
Date
June 1968
Publisher
Language
en_US
Abstract
A technique for reducing the number of iterations necessary for solving linear programs using the primal-dual algorithm is presented. It appears that the new method will also decrease the number of iterations over any other simplex algorithm. A FORTRAN program incorporating the technique, as well as some comparative computational results are given.
Type
Thesis
Description
URI
https://hdl.handle.net/10945/27207
Series/Report No
Department
Department of Operations Analysis
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funder
Format
56 p.: ill.;28 cm.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Theses