I want to optimize two variables

I end up on equation as shown below.

[Ku]*[u]+[Kp]*[p]=[C]*B.^2*Ui

B is bounded and Ui is known.

I want to find maximum of u and p combination by varing B.

how can i do that? can i have a plot also?

[Torsten]

Unclear what you mean.

What is "maximum of u and p" ?

The parameters in [ ] are matrices ?

Please explain in more detail.

[MEKDES KASSA]

the parameters in [] are matrixes. and also B may be vary between 1 and 3. for each value of B there will be a combination of u and p which can be the solution. and among these solution i want to identify the maximum ones.

[Torsten]

and among these solution i want to identify the maximum ones.

The maximum u or the maximum p or the maximum u+p or ... ?

[Sam Chak]

@MEKDES KASSA

Can you provide more information, especially the matrices on [Ku], [Kp], and [C]?

Now we know that u is constrained to [0, 200] and p is function of u, which implies p = f(u), and the optimization problem can be pobably solved by searching through u via an iterative approach.

[MEKDES KASSA]

p is a variable not a function of u

[MEKDES KASSA]

p get a priority .....but u shouldn't be low too

size(kp)=size(ku)=293X293

size(c)=293X1

[Torsten]

p get a priority .....but u shouldn't be low too

Too vague for an optimization.

Answer 1

[Sam Chak]

@MEKDES KASSA

Since u and p are the variables, geometrically, this equation is a plane (flat surface)

By varying B, the plane moves can up and down in the z-axis direction in the 3D space.

I'm visualizing, do you think there are maxima if u and p are unconstrained?

[Walter Roberson]

If they are constrained to non-negative then you could set the other to 0 and solve... but I am not clear at the moment whether they are scalar or matrices

[MEKDES KASSA]

they are matrixes and u is between 0 and 200. p rely on u.

Answer 2

[M Mirrashid]

https://ch.mathworks.com/matlabcentral/fileexchange/112600-transit-search-optimization-algorithm-matlab-codes