Hi,
I have a binary linear programm of the form
argmin_x 0s.t. Ax=bintlinprog( 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?
Best Answer