How to find all the possible feasible solutions to a integer linear programme?

5 次查看（过去 30 天）
parag patil
parag patil 2021-4-17
评论： parag patil 2021-4-18
I have following question:
  1. # of decision variables : 20; These can take the values {0,1} (integers)
  2. I have linear inequality constraints ( functions of above decision variables)
  3. I do not have any objective function.
Can I get set of all feasible solutions ( which just satisfty the linear inequality / equality constraints ? I do not want to optimize anything. I want to have the set of all feasible points.
Is it doable ?

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

采纳的回答

Matt J
Matt J 2021-4-17
编辑：Matt J 2021-4-17
For R^20, yes. Just do an exhaustive search,
[x{1:20}]=ndgrid([0,1]);
x=reshape( cat(21,x{:}) ,[],20).';
feasible = x(:, all(A*x<=b+tolerance,1) ); %20xN matrix of feasible solutions.

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Genetic Algorithm 的更多信息

标签

产品


版本

R2020b

Community Treasure Hunt

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

Start Hunting!

Translated by