Linear Programming 2010 1 (Convex) Cones Def: closed under nonnegative linear combinations, i.e. K is a cone provided a 1, …, a p K R n, 1, …, p.
Sec 2.6 – Marginals and Differentials 2012 Pearson Education, Inc. All rights reserved Let C(x), R(x), and P(x) represent, respectively, the total cost,
Linear Programming 2011 1 (Convex) Cones Def: closed under nonnegative linear combinations, i.e. K is a cone provided a 1, …, a p K R n, 1, …, p.
