Some Computational Experiments with Scolnik's Linear Programming Approach

Some Computational Experiments with Scolnik's Linear Programming Approach

Author: Stanford University. Department of Operations Research. Systems Optimization Laboratory

Publisher:

Published: 1974

Total Pages: 16

ISBN-13:

DOWNLOAD EBOOK

In this note the authors describe a reasonably efficient implementation of Scolnik's linear programming approach. The authors became interested in using the code to test the usefulness of this approach as a starting heuristic or 'crashing' technique, as the method is known to fail in general. The computational experience, however, leads the authors to believe that the method is too costly even for this modest objective.


More Remarks on Scolnik's Approach to Linear Programming

More Remarks on Scolnik's Approach to Linear Programming

Author: Cornell University. Department of Computer Science

Publisher:

Published: 1974

Total Pages: 14

ISBN-13:

DOWNLOAD EBOOK

This report briefly discusses certain points in Hugo Scolnik's letter (Spring 1974) to the SIGMAP membership, then examines whether superfluous constraints are responsible for the difficulties in Scolnik's approach to linear programming, and finally discusses possible starting heuristics, based on Scolnik's approach, for the simplex algorithm.


Finite Algorithm for the Linear Exchange Model

Finite Algorithm for the Linear Exchange Model

Author: Stanford University. Department of Operations Research. Systems Optimization Laboratory

Publisher:

Published: 1975

Total Pages: 128

ISBN-13:

DOWNLOAD EBOOK

It is shown that Lemke's algorithm can be used to compute, in a finite number of steps, an equilibrium or a reduction for the pure exchange model with linear utilities. (Author).