No label defined (Q3755228)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4003905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4003905 |
Statements
1986
0 references
extreme point
0 references
polytope
0 references
system of linear equations
0 references
0.7690032124519348
0 references
The author starts with a given polytope \(Dy=v\), \(y\geq 0\) where D is \(q\neq n\) and of rank \(q<n\), and by using an earlier paper of him [Ann. Math. Statist. 36, 671-676 (1965; Zbl 0136.412)] he constructs an (n-y)\(\times n\)-matrix C orthogonal to D. Then it is asserted that the solution of the simultaneous equations \(Dy=v\), \(Cy=f\) for some f can be used to obtain an extreme point of the given polytope, and thus the solution of a linear or quadratic programming problem can always be found by solving a system of linear equations. Integer constraints appear only in the examples; therefore the reviewer is not able to recognize by which means in general such constraints will come into consideration.
0 references