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

  • A
    $z=\lambda x+(1-\lambda) y, \lambda \in R$ is also an optimal solution.
  • B
    $z=\lambda x+(1-\lambda) y, 0 \leq \lambda \leq 1$ is also an optimal solution.
  • C
    $z=\lambda x+(1+\lambda) y, 0 \leq \lambda \leq 1$ is also an optimal solution.
  • D
    $z=\lambda x+(1+\lambda) y, \lambda \in R$ is also an optimal solution.

Explore More

Similar Questions

Show that the minimum of $Z$ occurs at more than two points.
Minimise and Maximise $Z = x + 2y$
subject to $x + 2y \geq 100, 2x - y \leq 0, 2x + y \leq 200; x, y \geq 0$.

The feasible solution for a Linear Programming Problem $(LPP)$ is shown in the figure. Let $z = 3x - 4y$ be the objective function. The value of (Maximum value of $z$ + Minimum value of $z$) is equal to $....$

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

In solving the $LP$ problem: "Minimize $z = 6x + 10y$ subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$." The redundant constraints are $....$

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:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo