Binary Linear Programm: find multiple / all solutions
조회 수: 1 (최근 30일)
이전 댓글 표시
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
채택된 답변
John D'Errico
2014년 12월 13일
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.
댓글 수: 0
추가 답변 (0개)
참고 항목
카테고리
Help Center 및 File Exchange에서 Get Started with Optimization Toolbox에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!