Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa
  • Home
  • NCERT
  • Solve the following Linear Programming Problems graphically Z= 3x + 2y

5. Solve the following Linear Programming Problems graphically:

 Maximise Z = 3x + 2y

 Subject to x+2y\leq 10,3x+y\leq 15,x,y\geq 0 

 Show that the minimum of Z occurs at more than two points.

Answers (1)

best_answer

The region determined by constraints, x+2y\leq 10,3x+y\leq 15,x,y\geq 0 is as follows,

               

The corner points of feasible region are A(5,0),B(4,3),C(0,5)

 The value of these points at these corner points are : 

Corner points            Z = 3x + 2y  
        A(5,0)                15  

        B(4,3)

                18 Maximum
       C(0,5)                 10  
                           

The maximum  value of Z is  18  at B(4,3)

Posted by

seema garhwal

View full answer

Crack CUET with india's "Best Teachers"

  • HD Video Lectures
  • Unlimited Mock Tests
  • Faculty Support
cuet_ads

Similar Questions

Trending Articles/News

anam-khan

PM Modi's Pariksha Pe Charcha 2025 to be held next month, registrations open till January 14
anam-khan

CBSE Board Exams 2025: Online portal for availing exemptions by CWSN students opens
anam-khan

Board Exams: States agree to equivalence; no question paper ‘jumbling’ from next year, says PARAKH CEO

Latest Question