Linear Algebra and Its Applications · Problem 8.2.7

Linear Programming and Game Theory — Gilbert Strang

Mathematics · simplex-method-maximization

Problem

If we wanted to maximize instead of minimize the cost (with

Ax = b

and

x \geq 0

), what would be the stopping test on

r

, and what rules would choose the column of

N

to make basic and the column of

B

to make free?