How to solve a potentially unbounded linear programming problem
Ältere Kommentare anzeigen
I have this LP
I have no idea how to do the linprog when there are variables on the RHS of the constraints.
Is this unbounded?
Is there a way to solve this with matlab?
Antworten (1)
Yes, it is solvable. Hint:
a*x+b*y <= c*z
is equivalent to
a*x+b*y -c*z <= 0
Kategorien
Mehr zu Linear Programming and Mixed-Integer Linear Programming finden Sie in Hilfe-Center und File Exchange
Produkte
am 2 Okt. 2019
am 2 Okt. 2019
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
