Three algorithms are developed and validated for finding a pointx inR n that satisfies a given system of inequalities,Ax≤b. A andb are a given matrix and a given vector inR m×n andR m, respectively, with the rows ofA assumed normalized. The algorithms are iterative and are based upon the orthogonal projection of an infeasible point onto the manifold of the bounding hyperplanes of some of the given constraints. The choice of the active constraints and the actual projection are accomplished through the use of surrogate constraints.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Agmon, S.,The Relaxation Method for Linear Inequalities, Canadian Journal of Mathematics, Vol. 6, pp. 382–392, 1954.
Motzkin, T. S., andSchoenberg, I. J.,The Relaxation Method for Linear Inequalities, Canadian Journal of Mathematics, Vol. 6, pp. 393–404, 1954.
Jeroslow, R. G.,Some Relaxation Methods for Linear Inequalities, Cahiers du CERO, Vol. 21, pp. 43–53, 1979.
Goffin, J. L.,The Relaxation Method for Solving Systems of Linear Inequalities, Mathematics of Operations Research, Vol. 5, pp. 388–414, 1980.
Todd, M. J.,Some Remarks on the Relaxation Method for Linear Inequalities, Technical Report No. 419, Cornell University, 1979.
Goldfarb, D., andTodd, M. J.,Modifications and Implementation of the Short Khachian Algorithm for Linear Programming, Technical Report No. 446, Cornell University, 1980.
Krol, Y., andMirman, B.,Some Practical Modifications of Ellipsoid Method for LP Problems, ARCON (undated report).
Hoffman, A. J.,On Approximate Solutions of Systems of Linear Inequalities, Journal of Research of the National Bureau of Standards, Vol. 49, pp. 263–265, 1952.
This work was supported in part by the City University of New York Research Center. The author thanks Professor D. Goldfarb for suggesting the problem and also for his valuable literature information and time. The word surrogate was borrowed from one of his works.
Communicated by F. Zirilli
About this article
Cite this article
Oko, S.O. Surrogate methods for linear inequalities. J Optim Theory Appl 72, 247–268 (1992). https://doi.org/10.1007/BF00940518
- Surrogate constraints
- orthogonal projections
- active constraints
- linear combinations
- outward normals