# Answer on Other Math Question for nate ruiz

Question #37293

L = Lagrangian.

If, for a given vector x* in C, there is lamda* >= 0 such that L(x*,lamda*) <= L(x,lamda*), for all x in C, and x*_ig_i(x*) = 0, for all i, then x* is feasible and x* solves the primal Convex Programming problem.

If, for a given vector x* in C, there is lamda* >= 0 such that L(x*,lamda*) <= L(x,lamda*), for all x in C, and x*_ig_i(x*) = 0, for all i, then x* is feasible and x* solves the primal Convex Programming problem.

Expert's answer

Dear visitor

Unfortunately, the statement of your question is a bit confusing.

What do you need to be done? Please, give us the details so we could help you.

Unfortunately, the statement of your question is a bit confusing.

What do you need to be done? Please, give us the details so we could help you.

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment