Consider a linear programming problem with two variable and two constraints. The objective function is maximize $x_{1} + x_{2} .$ The corner points of the feasible region are (0, 0), (0, 2), (2, 0) and (4/3, 4/3)

Let $Y_{1} and Y_{2}$ be the decision variables of the dual and $v_{1} and v_{2}$ be the slack variables of the dual of the given linear programming problem. The optimum dual variables are

Y_{1} and Y_{2}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Y_{1} and v_{2}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

v_{1} and v_{2}

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Y_{1} and v_{1}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C $v_{1} and v_{2}$
(d)

Suggest Corrections

Similar questions

Q. Consider a linear programming problem with two variables and two constraints. The objective function is to maximize

x_{1} + x_{2} .

The corner points of the feasible region are (0, 0), (0, 2), (2, 0) and (4/3, 4/3)

If an additional constraint

X_{1} + X_{2} \leq 5

is added, the optimal solution is

Q. If at the optimum in a linear programming problem, a dual variable corresponding to a particular primal constraint is zero, then it means that

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

Join BYJU'S Learning Program

The correct option is C v1 and v2(d)

The correct option is C $v_{1} and v_{2}$
(d)