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
366 views
in Linear Programming by (49.3k points)
closed by

Solve the following L.P.P. by converting it into its dual.

Min Z = 20x1 + 10x2

S.T.

x1 + x2 ≥ 10

3x1 + 2x2 ≥ 24

x1, x2, ≥ 0

1 Answer

+1 vote
by (48.2k points)
selected by
 
Best answer

The dual of the above L.P.P. can be written as

Max ZD = 10W1 + 24W2

S.T.

W1 + 3W2 ≤ 20

W1 + 2W2 ≤ 10

W1, W2 ≥ 0

By using slack variables convert the problem into standard form, we have

Max Z = 10W1 + 24W2 + 0S1 + 0S2

S.T. W1 + 3W2 + S1 = 20

W+ 2W2 + S2 = 10

W1, W2, S1, S2 ≥ 0

Initial basic feasible solution is given by

W1 = W2 = 0, S1 = 20, S2 = 10

Now prepare initial simplex table, we have

Converting the key element 2 as unity and then taking R1 → R1 – 3R2, we have

Here, all values of Zj – Cj ≥ 0. Hence, optimum solution exists, i.e.,

Min Z = 120, x1 = 0, x2 = 12

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

...