Abstract
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.

This publication has 0 references indexed in Scilit: