Simple Computable Bounds for Solutions of Linear Complementarity Problems and Linear Programs.
- 1 November 1983
- report
- Published by Defense Technical Information Center (DTIC)
Abstract
Surprisingly simple bounds are given for solutions of fundamental constrained optimization problems such as linear and convex quadratic programs. It is shown that every nonoptimal primal-dual feasible point carries within it simple numerical information which bounds some or all components of all solution vectors. The results given permit one to compute bounds without even solving the optimization problems. (Author)Keywords
This publication has 0 references indexed in Scilit: