Does there exist a way to check if a linear programming problem is unbounded without solving it directly? In other words, How the unboundedness of an LP can be realized from its structure. Assume the corresponding feasible area is nonempty.
LP unboundedness
2
$\begingroup$
optimization
linear-programming
-
1I recommend asking on Math.SE. Hopefully you already know basics like the weak duality theorem. – 2012-07-20