How to solve a potentially unbounded linear programming problem

2019 10 2
1 个回答
更新时间：2019 10 2
12 次查看（30 天）

0 个投票

I have this LP
IMG_3882.JPG
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?

请先登录，再回答此问题。

回答（1 个）

Matt J
Matt J 2019-10-2
编辑：Matt J 2019-10-2

0 个投票

Yes, it is solvable. Hint:
a*x+b*y <= c*z
is equivalent to
a*x+b*y -c*z <= 0

类别

在 帮助中心 和 File Exchange 中查找有关 Linear Programming and Mixed-Integer Linear Programming 的更多信息

产品

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by