The objective function of a Linear Programmin | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) According to the Fundamental Theorem of Linear Programming,if an optimal solution exists for a linear programming problem,it must occur at one of

Vedclass · Accepted Answer

at least one of the corner points.

Vedclass · Answer

(D) According to the Fundamental Theorem of Linear Programming,if an optimal solution exists for a linear programming problem,it must occur at one of the corner points (vertices) of the feasible region. If the objective function attains the same optimal value at two corner points,then every point on the line segment joining these two points is also an optimal solution. Therefore,the objective function always attains its optimum value at at least one of the corner points.

The objective function of a Linear Programming Problem $(L.P.P.)$ defined over a convex set attains its optimum value at

Similar Questions

Maximum value of $z = 3x + 4y$ subject to the constraints $x - y \leqslant -1$,$-x + y \leqslant 0$,and $x, y \geqslant 0$ is:

Maximize the function $Z = 11x + 7y$,subject to the constraints:
$x \leq 3, y \leq 2, x \geq 0, y \geq 0$

Corner points of the feasible region for an $\operatorname{LPP}$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Let $F = 4x + 6y$ be the objective function. Find the value of $\text{Maximum of } F - \text{Minimum of } F$.

The corner points of the feasible region are $A(3,3), B(20,3), C(20,10), D(18,12)$ and $E(12, 12)$. The maximum value of $Z=2x+3y$ is $.......$

If the vertices of a feasible region are $O(0,0), A(10,0), B(0,20), C(15,15)$,then the minimum value of the objective function $Z = 10x - 20y + 30$ is . . . . . . .

Vedclass Test Series

Exam Paper Generator

Online Exam Module