How to solve linear programming problem?
显示 更早的评论
I have a problem that looks like:
min z=sum(x_ij*c_ij) (sum across ij, c_ij are constants)
s.t.
sum (x_ij)=1 (sum across i)
sum (x_ij)=1 (sum across j)
x_ij=0or1 any ij
If I use linprog, the matrix of x is a n by 1 matrix, but here I have a n by n matrix, so I cannot directly use linprog. How can I solve this problem?
Thanks,
zwang244
回答（2 个）
Walter Roberson
2016-11-9
0 个投票
You reshape the n x n matrix into a vector.
Torsten
2016-11-9
0 个投票
By defining y((i-1)*n+j)=x(i,j), you get an (n^2x1) vector to be solved for.
Best wishes
Torsten.
类别
在 帮助中心 和 File Exchange 中查找有关 Linear Programming and Mixed-Integer Linear Programming 的更多信息
2016-11-8
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
