What is the UB and LB in the following solver based approch optimisation question

Minimize f = 2x1 + 3x2 + 2x3-X4 + X5

subject to the constraints

3x1 - 3x2 + 4x3 + 2x4 - X5 = 0

X1 + x2 + x3 + 3x4 + x5= 2

x/ 20, i = 1 to 5

[Matt J]

The last constraint is not readable. What is "x/ 20" ?

[Deepak Singh]

It is x(i) 20

[Matt J]

Still not readable, as there is no relational operator. Is it x(i)>=20 or x(i)<=20 or something else?

[Deepak Singh]

[Deepak Singh]

Reply,

Picture of question sent.

Answer 1

[Abolfazl Chaman Motlagh]

your upper bound is infinity , lower bound is zeros:

f = [2;3;2;-1;1];
Aeq = [3 -3 4 2 -1;1 1 1 3 1];
beq = [0;2];
lb = zeros(5,1);
ub = inf(5,1);
[X,feval] = linprog(f,[],[],Aeq,beq,lb,ub)

Optimal solution found.

X = 5×1

0 0 0 0.4000 0.8000

feval = 0.4000