Linear programming with spheres and hemispheres of objective vectors

DOI10.1007/BF01586923MaRDI QIDQ1176803zbMATH OpenOpenAlexFDO

Authors B. Curtis Eaves, Hui Hu, Alan J. Hoffman

Publication date 25 June 1992

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01586923

Mathematics Subject Classification ID

Linear programming (90C05)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1134656
• Optimization of a linear fractional function on a hypersphere of an affine space
• Analysis of the objective space in multiple objective linear programming

Cites work

• Linear programming with spheres and hemispheres of objective vectors
• The simplex method. A probabilistic analysis

Cited in

(3)

• Linear programming with spheres and hemispheres of objective vectors
• On the structure of the inverse-feasible region of a linear program
• scientific article; zbMATH DE number 232497 (Why is no real title available?)

This page was built for publication: Linear programming with spheres and hemispheres of objective vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176803)