PARETO LINEAR PROGRAMMING
PARETO LINEAR PROGRAMMING. 3.4 Pareto Linear Programming. The Problem: P-opt Cx s.t Ax ≤ b x ≥ 0 where C is a kxn matrix so that Cx = (c (1) x, c (2) x, ..., c (k) x) where c (j) = jth row of C. . Example. z 1. z 2.
1.1k views • 85 slides