Linear Algebra and Its Applications · Problem 8.3.4

Linear Programming and Game Theory — Gilbert Strang

Mathematics · linear-programming-duality-infeasible

Problem

Construct a 1 by 1 example in which

Ax \geq b

x \geq 0

is unfeasible, and the dual problem is unbounded.