Given a polytope
, the classical linear programming (LP) problem asks us to find a point in
which attains maximal inner product with a given real objective vector
. When the objective is a vector of unknown parameters, the LP problem amounts to computing certain information about the polytope
, such as its vertices and normal fan.