Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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.

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

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.