Convex Programming Problems

[@bishaliitroorkee]

Great sir ....I have face problem when my teacher teach us in class ...after watched these video cleared my all doubt Thank you sir for making this video

[@DavidAlexander-tp9hh]

Brilliant explanation, my regards professor.

[@sauravpachauri]

Thank you so much sir!!! great deed

[@benjaminbenjamin8834]

Great job , Sir thank you.

[@shan35178]

I think there is a problem in the problem solved at time 33 minutes. The problem seems non-convex problem. I found it using by drawing the graph, plus by checking the eigenvalues for the problem. Can some one explain if I am missing something!

[@praneshsaisridhar2823]

Yes. Infact, there exists no maximum or minimum for this function. This is because the Lagrangian procedure can only be obtained when there exist a valid maxima or minima. We can keep reducing and increasing the values of x and y that satisfy the constraint. Hence, the lagrangian procedure should not be applied for this problem.

[@Vendettaa3752]

Sir I have a confusion in NLPP we take L=f-lemda g and in this problem why we r taking L= f+lemda g

[@depressedguy9467]

43:30

[@sweetysaini_mj2654]

Sir plz give me KT method proof

[@depressedguy9467]

2:00

[@depressedguy9467]

43:31

[@sushantkala1928]

I am IIT ropar student i think he is the brother of my teacher Dr.Arvind Gupta

[@amandubey6822]

Its sad but i have to let you know that he is my teacher and he never in his class mentioned about his brother.

[@depressedguy9467]

105:65

[@depressedguy9467]

105:23