This note considers linear programming problems in which the components of the cost vector are linear functions of a set of parameters. The main result is a proof that the set of parameters which yield cost functions that have optimal solutions is a convex polyhedron.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.