A Shrinking Boundary Algorithm for Discrete System Models
Robert M. Saunders, Roland Schinzinger · IEEE Transactions on Systems Science and Cybernetics · 1970
Improved mathematical optimization procedures are steadily finding wider use in engineering system studies, but the difficulties associated with the solution of discrete decision variable models remain formidable. An algorithm is described which will solve a certain class of problems formulated as linear integer programs. The procedure employs parallel shifts of selected boundary planes. This is accomplished by incrementing the appropriate slack variables which are constrained to be integers when the restraint conditions are formulated as diophantine equations. A hierarchy of variables is established to direct the boundary shifts. Feasibility and sensitivity tests truncate the search.
Cited by 9 works. doi:10.1109/tssc.1970.300288
Authors
References
- An Automatic Method for Solving Discrete Programming Problems
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming: Methods, Uses, Computations
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- An Automatic Method of Solving Discrete Programming Problems
- Minimum-redundancy coding for the discrete noiseless channel
- Industrial Scheduling
- Recent Advances in Mathematical Programming
- Elementary Number Theory
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS