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.
1
Expert's answer
2014-02-26T13:58:57-0500
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.
"assignmentexpert.com" is professional group of people in Math subjects! They did assignments in very high level of mathematical modelling in the best quality. Thanks a lot
Comments
Leave a comment