Question

Reconsider Prob. 5.1-1. For the sequence of CPF solutions identified in part (e), construct the basis matrix B for each of the corresponding BF solutions. For each one, invert B manually, use this B-1 to calculate the current solution, and then perform the next iteration (or demonstrate that the current solution is optimal).
In problem.
Maximize Z = 3x1 + 2x2,
Subject to

And x1 ≥ 0, x2 ≥ 0

Sales0
Views26