Given the following two constraints, which solution is a feasible solution for a maximization problem?

Constraint1: 4x, +3x_{2} \leq 18

Constraint 2: x_{1}-x_{2}\leq 3

  • Option 1)

    x_{1},x_{2}=\left ( 1,5 \right )

  • Option 2)

    x_{1},x_{2}=\left ( 4,1 \right )

  • Option 3)

    x_{1},x_{2}=\left ( 4,0 \right )

  • Option 4)

    x_{1},x_{2}=\left ( 2,1 \right )

 

Answers (1)
V Vakul

As we learnt in

Corner Point Method -

This method of solving a LPP graphically is based on the principle of extreme points theorem.

-

 

 

 

4x_{1}+3x_{2}\leq 18

x_{1}-x_{2}\leq 3

From figure only (2, 1) lies in region. 


Option 1)

x_{1},x_{2}=\left ( 1,5 \right )

Incorrect

Option 2)

x_{1},x_{2}=\left ( 4,1 \right )

Incorrect

Option 3)

x_{1},x_{2}=\left ( 4,0 \right )

Incorrect

Option 4)

x_{1},x_{2}=\left ( 2,1 \right )

correct

Preparation Products

Knockout BITSAT 2021

It is an exhaustive preparation module made exclusively for cracking BITSAT..

₹ 4999/- ₹ 2999/-
Buy Now
Knockout BITSAT-JEE Main 2021

An exhaustive E-learning program for the complete preparation of JEE Main and Bitsat.

₹ 27999/- ₹ 16999/-
Buy Now
Exams
Articles
Questions