# unboundedness of an LP

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.

-
Perhaps look for a direction in which all the solutions will be feasible, that would guarantee unboundedness. – gt6989b Jul 20 '12 at 12:54
Check the dual. If the dual has a feasible solution then the primal can't be unbounded. – Shahab Jul 20 '12 at 15:33