Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
8.1k views
in Operations Research by (26.1k points)
closed by

Solve the linear programming problem by graphical method.

Maximize Z = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.

1 Answer

+1 vote
by (26.4k points)
edited ago by
 
Best answer

Given that 960x1 + 640x2 ≤ 15360

Let 960x1 + 640x2 = 15360

3x1 + 2x2 = 48

x1 0 16
x2 24 0

Also given that x1 + x2 ≤ 20

Let x1 + x2 = 20

x1 0 20
x2 20 0

To get point of intersection

3x1 + 2x2= 48 … (1)

x1 + x2 = 20 ... (2)

(2) x -2 ⇒ -2x1 – 2x2 = -40 … (3)

(1) + (3) ⇒ x1 = 8

x1 = 8 substitute in (2),

8 + x2 = 20

x2 = 12

The feasible region satisfying all the given conditions is OABC.

The co-ordinates of the comer points are O(0, 0), A(16, 0), B(8,12) and C(0, 16).

The maximum value of Z occurs at B(8, 12).

∴ The optimal solution is x1 = 8, x2 = 12 and Zmax = 392

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

...