solve the binary integer (0,1) problem

Could somebody please help me?

I am trying to solve the binary integer (0,1) problem by using a function from this link https://www.mathworks.com/matlabcentral/fileexchange/6990-mixed-integer-lp

f represent six possible places where I can put measuring devices.

My f is x1 to x6 = [1 1 1 1 1 1]

My A =

[ 1  1  1  1  1  1;
1  1  1  1  1  1;
1  0  1  1  1  1;
1  0  1  1  1  1;
1  0  1  1  1  1;
0  0  1  1  1  1]
Lb [0 0 0 0 0 0] and ub [1 1 1 1 1 1 ]
M = [1 1 1 1 1 1]
B = [3 3 3 3 3 3]

And e I left the same as in example. For answer I get

Ans = 
0
    0.3475
    0.0000
    0.0000
    0.0000
    0.0000

However, I would like to get binary answers that will give me information about where to put measuring devices considering given constrains.

[KALYAN ACHARJYA]

Read here How to ask a question?

[Bruno Luong]

What is "B"? There is "b" as input but not upper case. Your matrix A has duplicated row, meaning you put redundancy in the constraints, thus the problem doesn't seem to be well formulated to me.

If "B" is "b", the solutions are simply peak 3 random positions among 6.

Answer 1

[Stephan]

If you want to get binary output there should be a possibility to add integer constraints for x(1)...x(6). In combination with lower and upper bounds of 0 and 1 for all x, you would get what you want.

In the function you use this is done by defining vector M containing the indices of integer constrained variables.

M = 1:6;

If you have access to Optimization Toolbox you could also use intlinprog for this purpose.

Also follow the comments given above.

Best regards

Stephan

[Stephan]

If the answers you got were useful for you, you can accept and/or vote for them. This is how the volunteers here earn reputation.

Answer 2

[Pero Pajo]

I want to thank you all for your answers,