Utilizing fmincon or fminsearch

I'm given these objective functions:

Objective function

Minf = 55x1 + 90x2 + 105x3 + 55x4 + 85x5 + 120x6 
X1,x2,x3</ 0.5
Minf = 65x1 + 100x2 + 115x3 + 55x4 + 85x5 + 120x6
X1,x2,x3 >/ 0.5

and these constraints:

Inequality/constraints

C1: x1 + x4 >/ 0.9
C2: x2 + x5 >/ 0.7
C3: x3 + x6 >/ 0.3

Nonnegativity: Xi > 0

X1 + x2 + x3 </ 0.5
X1 = 0.8
X2 = 0
X3 = 0.3
X4 = 0.1
X5 = 0.7
X6 = 0 
F=140.50
 
>/0.5
X1= 0.08
X2 = 0
X3 = 0.3
X4 = 0.1
X5 = 0.7
X6 = 0
F= 151.50

And told fmincon or fminsearch would be the easiest way to solve. Any suggestions?

[Matt J]

Since the constraints and objectives all look linear, linprog would be ideal.

[Jami Turnquist]

How do you code this for this many variables though?

[Matt J]

See here for numerous example

https://www.mathworks.com/help/optim/ug/linprog.html#buusznx-4

Answer 1

[Puru Kathuria]

Hi,

I understand that you want to solve this optimization problem. This can be achieved using linprog. Please go through the following link to see how to use linprog for your problem.

https://www.mathworks.com/help/optim/ug/linprog.html