Question:

The solution x₁ = 1, x₂ = 1, x₃ = 0 and z = 3 to the system of equations
x₁+x₂+x₃=2
x₁+x₂-x₃=2
x₁,x₂,x₃≥0
which minimizes z = x₁ + 2x₂ + 3x₃ is

Updated On: May 2, 2025

not feasible
not basic
feasible and basic
basic but not feasible

Hide Solution

Verified By Collegedunia

The Correct Option is B

Solution and Explanation

The correct answer is(B): not basic

Was this answer helpful?

0

1

Top Questions on Linear Programmig Problem

The corner points of the feasible region determined by $x + y \leq 8$, $2x + y \geq 8$, $x \geq 0$, $y \geq 0$ are $A(0, 8)$, $B(4, 0)$, and $C(8, 0)$. If the objective function $Z = ax + by$ has its maximum value on the line segment $AB$, then the relation between $a$ and $b$ is:
- CUET (UG) - 2024
- Mathematics
- Linear Programmig Problem
View Solution
Which one of the following represents the correct feasible region determined by the following constraints of an LPP?
\[ x + y \geq 10, \quad 2x + 2y \leq 25, \quad x \geq 0, \quad y \geq 0 \]
- CUET (UG) - 2024
- Mathematics
- Linear Programmig Problem
View Solution
\(\text{The feasible region represented by the constraints } 4x + y \geq 80, \; x + 5y \geq 115, \; 3x + 2y \leq 150, \; x, y \geq 0 \; \text{of an LPP is:}\)
- CUET (UG) - 2024
- Mathematics
- Linear Programmig Problem
View Solution
Solve the following linear programming problem graphically: Maximise \( Z = 2x + 3y \), subject to the constraints: \( x + y \leq 6, \, x \geq 2, \, y \geq 3, \, x \geq 0, \, y \geq 0. \)
- CBSE CLASS XII - 2024
- Mathematics
- Linear Programmig Problem
View Solution
Assertion (A): The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of \( Z = x + 2y \) occurs at infinite points.
Reason (R): The optimal solution of a LPP having bounded feasible region must occur at corner points.
- CBSE CLASS XII - 2024
- Mathematics
- Linear Programmig Problem
View Solution

View More Questions

Questions Asked in CUET PG exam

View More Questions