An algorithm for the solution of linear programming problems using step-by-step addition of constraints.
Fenn, Michael Robert
Shudde, Rex H.
MetadataShow full item record
As linear programming techniques find applications in more diverse fields, the problem of solution time becomes increasingly important. A variation of the revised simplex algorithm, in which the constraints are added in a step-by-step fashion, is investigated as a potentially faster solution technique. A computational procedure, coded for the IBM 360 computer, is developed to compare this algorithm with the standard two-phase revised simplex algorithm. A limited number of problems, including several randomly generated problems, is solved by each of the two methods. The resulting comparison of solution times indicates that a significant improvement is obtained by the use of the procedure of step-by-step addition of constraints.
Approved for public release, distribution is unlimited.
Showing items related by title, author, creator and subject.
Sparks, Donald Leroy (Monterey, California. Naval Postgraduate School, 1968-06);Linear programming techniques are becoming of greater importance because the use of computerization has increased the fields for applications for linear programs. The primaldual algorithm, in which the constraints are ...
Royset, Johannes O.; der Kiureghian, Armen; Polak, Elijah (ASCE, 2006);Significant challenges are associated with solving optimal structural design problems involving the failure probability in the objective and constraint functions. In this paper, we develop gradient-based optimization ...
Caldwell, James F., Jr. (1987-09);A moving target is detected at long range with an initial position given by a probability distribution on a grid of N cells. Also located on the grid is a searcher, constrained by speed, who must find an optimal search ...