Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa

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 (2)

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

Posted by

Vakul

View full answer

2

Posted by

sussy baka

View full answer

Similar Questions

Trending Articles/News

anam-khan

BITSAT 2024 application correction facility begins tomorrow; editable fields
anam-khan

BITSAT 2024 registration window closes tomorrow; exam from May 20
anam-khan

BITSAT 2024 registration deadline extended till April 16; session 1 exam from May 19 to 24

Latest Question