Accession Number:

ADA137949

Title:

Simple Computable Bounds for Solutions of Linear Complementarity Problems and Linear Programs.

Descriptive Note:

Technical summary rept.,

Corporate Author:

WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER

Personal Author(s):

• Mangasarian,O. L.

Report Date:

1983-11-01

Pagination or Media Count:

25.0

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

Descriptors:

• *Linear programming
• Optimization
• Computations
• Solutions(General)
• Problem solving
• Matrices(Mathematics)
• Vector analysis

Subject Categories:

• Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE