Consider the following linear programming problem :

Maximize:12x + 10y

subject to 4x+3y\leq 480

2x+3y\leq 360

All variables \geq 0

which of the following points \left (x,y \right ) could be a feasible corner point?

  • Option 1)

    \left ( 40,48 \right )

  • Option 2)

    \left ( 120,0 \right )

  • Option 3)

    \left ( 180,120 \right )

  • Option 4)

    \left (30,36 \right )

 

Answers (1)

As we learnt in 

Corner Point Method -

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

-

 

 

Z=12x + 10y

 4x+3y\leq 480

2x+3y\leq 360

 Corner points are A(120, 0) B(180, 0) C(0, 120) D(0, 160) and (60, 80)


Option 1)

\left ( 40,48 \right )

Incorrect

Option 2)

\left ( 120,0 \right )

correct

Option 3)

\left ( 180,120 \right )

Incorrect

Option 4)

\left (30,36 \right )

Incorrect

Preparation Products

Knockout BITSAT 2020

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

₹ 4999/- ₹ 1999/-
Buy Now
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
Knockout BITSAT-JEE Main 2020

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

₹ 14999/- ₹ 7999/-
Buy Now
Exams
Articles
Questions