Linear programming with partial information

We study a particular class of linear programming problems in which only ordinal information concerning the objective function coefficients is known. Specifically, we assume the decision maker(s) can place partial orders (possibly incomplete) on the components of the contribution vector. The concept of tangent and polar cones forms the basis for the analytical and solution technique. An example problem is included.