Let x and y be optimal solutions of a Linear | vedclass

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

Question

(B) In a Linear Programming $(LP)$ problem,the feasible region is a convex set.If $x$ and $y$ are two optimal solutions,then the objective function va

Vedclass · Accepted Answer

$z=\lambda x+(1-\lambda) y, 0 \leq \lambda \leq 1$ is also an optimal solution.

Vedclass · Answer

(B) In a Linear Programming $(LP)$ problem,the feasible region is a convex set.If $x$ and $y$ are two optimal solutions,then the objective function value at these points is the same,say $Z^*$.Since the objective function is linear,for any convex combination $z = \lambda x + (1 - \lambda) y$ where $0 \leq \lambda \leq 1$,the value of the objective function is:$f(z) = f(\lambda x + (1 - \lambda) y) = \lambda f(x) + (1 - \lambda) f(y) = \lambda Z^* + (1 - \lambda) Z^* = Z^*$.Thus,any convex combination of two optimal solutions is also an optimal solution.

Let $x$ and $y$ be optimal solutions of a Linear Programming $(LP)$ problem. Then,which of the following is true?

Similar Questions

The coordinates of the corner points of the bounded feasible region are $(0,10), (5,5), (15,15)$,and $(0,20)$. The maximum value of the objective function $Z = 10x + 20y$ is:

The feasible region for an $LPP$ is shown in the figure. Let $z = 3x - 4y$ be the objective function. The minimum value of $Z$ is:

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

Maximize and minimize $Z = 3x - 4y$ subject to the constraints $x - 2y \leq 0$,$-3x + y \leq 4$,$x - y \leq 6$,and $x, y \geq 0$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module