Describe an algorithm that finds, among all vectom that maximize the primary objective function, the one that achieves the maximum value of the secondary objective function.
Suppose you want to solve the following LP: max crx Ax 6, but unfortunately it is infeasible (think e.g. about an inventory problem where the demand cannot be satisfied by the warehouse). Let A E Rm.?. Now suppose you can “augment” your LP by buying some more slack in your problem (think e.g. of buying … Read more