00:01
Hello everyone, here the function given we have to find whether the function is a convex programming problem.
00:07
So, let us see the first constraint.
00:08
First constraint is 2 x 1 minus 5 x 2 less than or equal to 2.
00:14
So, this constraint is linear and inequality constraint and there is no equality constraint and the acn matrix here is 2 0 0.
00:46
So, that is positive everywhere.
00:52
So, from this 3 the constraint is linear inequality and there exists no equality constraint and acn matrix is positive everywhere.
01:01
We can conclude that the given problem is the given problem is convex programming problem.
01:17
Next we have to write kuhn tucker condition for this problem.
01:28
So, necessary and sufficient condition for kuhn tucker condition is dou f by dou x 1.
01:36
So, we will be adding x 2 y x 2 plus 1 2 x 1 which gives you 2 x 1 x 2 y x 2 plus 1.
01:48
Next dou f by dou x 2.
01:53
So, this will be x 1 square x 2 x 2 plus 1 to the whole power minus 1...