Binary Linear Programm: find multiple / all solutions

Question

Herbert 2014-12-13

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/166480-binary-linear-programm-find-multiple-all-solutions

回答： John D'Errico 2014-12-13

采纳的回答： John D'Errico

在 MATLAB Online 中打开

Hi,

I have a binary linear programm of the form

argmin_x 0
s.t. Ax=b
intlinprog( zeros(numVars,1), 1:numVars,[], [], A_eq, b_eq, zeros(numVars,1), ones(numVars,1), options );

meaning, a feasibility problem. Is it possible, .e.g. with intlinprog, to find several or even all solutions to that problem?

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

Answer 1

John D'Errico 2014-12-13

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/166480-binary-linear-programm-find-multiple-all-solutions#answer_162232

Optimization tools like intlinprog find ONE solution to a problem. They are not designed to search your space and return multiple feasible solutions.

You have no objective here, merely a goal of finding all feasible solutions to a linear system of equality constraints. I suppose you could assign various random objectives, and hope the IP solver generates a different solution for each objective.

Really, you are not looking to use an optimization tool. I have no idea what your constraint system is like or the size of your problem, so I cannot even suggest an alternative.