recategorized by
872 views
2 votes
2 votes

Given the problem to maximize $f(x), X=(x_1, x_2, \dots , x_n)$ subject to m number of in equality constraints. $g_i(x) \leq b_i$, i=1, 2, .... m including the non-negativity constrains $x \geq 0$. Which of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at $\bar{x}$?

  1. $\frac{\partial L(\bar{X}, \bar{\lambda}, \bar{S})}{\partial x_j} = 0, j=1,2\dots m$
  2. $\bar{\lambda}_i [g_i(\bar{X})-b_i] = 0, i=1,2 \dots m$
  3. $g_i (\bar{X}) \leq b_i, i=1,2 \dots m$
  4. All of these
recategorized by

1 Answer

Answer:

Related questions

2 votes
2 votes
1 answer
1
3 votes
3 votes
1 answer
2
go_editor asked Jul 27, 2016
2,292 views
If the primal Linear Programming problem has unbounded solution, then it's dual problem will havefeasible solutionalternative solutionno feasible solution at allno altern...
1 votes
1 votes
1 answer
3
go_editor asked Aug 11, 2016
14,491 views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded
1 votes
1 votes
1 answer
4
go_editor asked Jul 12, 2016
4,231 views
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are681012