Electronic Resource
Springer
Journal of optimization theory and applications
38 (1982), S. 1-24
ISSN:
1573-2878
Keywords:
Minimal representation
;
systems of linear constraints
;
linear inequalities
;
linear equalities
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A system of linear inequality and equality constraints determines a convex polyhedral set of feasible solutionsS. We consider the relation of all individual constraints toS, paying special attention to redundancy and implicit equalities. The main theorem derived here states that the total number of constraints together determiningS is minimal if and only if the system contains no redundant constraints and/or implicit equalities. It is shown that the existing theory on the representation of convex polyhedral sets is a special case of the theory developed here.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00934319
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
