how to solve convex optimization problem..?

hey everyone.. i have to minimize the convex optimization problem. the function is as follow.

min sum(Su)

subj to

sum Cl<=CL

sum Pl<=P

PL>=0

CL>=0

here Su is a vector and CL is bandwidth ,PL is transmission power and are some constant values. i don not how to solve this problem..? kindly help me with this.

[CLEDAT Emmanuel]

Hello,

If I understood well your problem, you can solve your problem with the function linprog.

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

You can replace min sum(Su) by f’ * Su where f = ones( length(Su) , 1)

And sum Cl <= CL by A1 * Cl <= b1 where A1 = ones( 1 , length(Cl) ) and b1 = CL

I cannot help you more at this point because you didn’t refer to your variable Su later on in your pseudo-code

Answer 1

[Alan Weiss]

I assume that the Su vector is related in some functional way to the variables CI and PI. Are CL and PL also variables, or are they given quantities?

In any case, take a look at Optimization Toolbox documentation, particularly the Getting Started example for nonlinear problems, and the Getting Started example for linear problems.

Alan Weiss

MATLAB mathematical toolbox documentation