Consider the multiobjective LP max 6x1 + 4x2 max x2 s.t. 3x1 + 2x2 … 12 x1 + 2x2 … 10 x1 … 3 x1, x2 Ú 0

(a) State and solve graphically a sequence of linear programs to compute a preemptive solution giving priority to the first objective.

Also verify that the result is an efficient point.

(b) State and solve graphically a sequence of linear programs to compute a preemptive solution giving priority to the second objective. Also verify that the result is an efficient point.