How to solve linear programming problem?
显示 更早的评论
I have a linear programming problem to solve. It looks like:
zx = max z
s.t. z ≤ c*y1 + y1*x
z ≤ c*y2 + y2*x
Σ x ≤ 5
Where:
c = 0
1
1
100
1
0
1
1
1
1
0
1
100
1
1
0
y1 = 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0
y2 = 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0.
x is an array of 16 numbers.
The result should be optimized for x.
How do I solve it using Matlab?
1 个评论
John D'Errico
2020-7-27
编辑：John D'Errico
2020-7-27
This question is morphing too many times, now on the third variation. I've closed the other copy of this question. Please stop reposting new duplicate questions if your question changes agian.
采纳的回答
Matt J
2020-7-27
0 个投票
3 个评论
Nika Dolnikava
2020-7-27
No, you said in your original post that the y variables were known and that you wanted to find x,
"The result should be optimized for x."
linprog is definitely the tool to use. Your problem is very much a linear program and that is the kind of problem that linprog solves. Although, be mindful that z must be solved for as well and therefore z and x must be viewed as part of a single vector of 17 unknowns p=[-z,x]
Nika Dolnikava
2020-7-27
更多回答（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 
