Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
–1 vote
384 views
in Linear Programming by (14 points)
recategorized by

Solve the following LPP by two phase method Maximize \( z=3 x_{1}+x_{2} \) 

Subject to the constraints \[ \begin{array}{l} x_{1}+2 x_{2} \geq 2 \\ 2 x_{1}+x_{2} \geq 2 \\ x_{1}+x_{2} \leq 2 \\ x_{1}, x_{2} \geq 0 \end{array} \]

Please log in or register to answer this question.

1 Answer

0 votes
by (323k points)

 

For line x1 + 2x2 = 2,

x1 0 2 2/3 -2
x2 1 0 2/3 2

For line 2x1 + x2 = 2,

x1 0 1 2/3 2
x2 2 0 2/3 -2

For line x1 + x2 = 2

x1 2 0 1 -1
x2 0 2 1 3


\(\triangle\)ABE is feasible region whose corner points are A(2, 0), B(0, 2) and E(2/3, 2/3).

Corner points Objective function max Z = 3x1 + x2
(2, 0) 6(max)
(0, 2) 2
(2/3, 2/3) 8/3


\(\therefore\) solution of given linear programming problem is x1 = 2, x2 = 0 and max z = 6.

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.

Categories

...