Linear programming with spheres and hemispheres of objective vectors (Q1176803): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The simplex method. A probabilistic analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear programming with spheres and hemispheres of objective vectors / rank | |||
Normal rank |
Revision as of 11:00, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear programming with spheres and hemispheres of objective vectors |
scientific article |
Statements
Linear programming with spheres and hemispheres of objective vectors (English)
0 references
25 June 1992
0 references
Consider the linear program \(\max\{cx\mid x\in P\}\) where \(P\) is a linearly constrained feasible region. Let \(X(P,c)\) denote the set of all optimal solutions. For any set \(C\) of possible \(c\)'s, define \(X(P,C)=\bigcup_{c\in C}X(P,c)\). The authors determine topological possibilities of \(X(P,C)\) for \(C\) a sphere or hemisphere. For this purpose the feasible region \(P\) is projected onto the linear span of objective vectors where the situation is simplified, then conclusions obtained in the projected space are transferred back to the original region.
0 references