9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2

1 + 2x2 ≤ 18 - Sarthaks e…

LIVE Course
for free
Get app now
Rated by 1 million+
students

 
Login

 Test

 JEE
Ask a Question
 NEET

 Home

 Q&A

 Unanswered

 ByAskgraphical
a Question method, the solution of linear programming
problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18
 Learn

← Prev Question Next Question →

0
votes

7.3k views
asked
Jun 1, 2021
in Linear Programming
by Aeny
(46.8k points)

closed
Jun 3, 2021
by Aeny

By graphical method, the solution of linear programming problem

Maximize Z = 3x1 + 5x2

Subject to 3x1 + 2x2 ≤ 18

x1 ≤ 4

x2 ≤ 6

x1 ≥ 0, x2 ≥ 0, is

https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 1/7
9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18 - Sarthaks e…

A. x1 = 2, x2 = 0, Z = 6

B. x1 = 2, x2 = 6, Z = 36

C. x1 = 4, x2 = 3, Z = 27

D. x1 = 4, x2 = 6, Z = 12

linear programming
class-12

Share It On

 Facebook
 Twitter
 Email

comment

1 Answer

 
+1
vote

answered
Jun 1, 2021
by Vaiga
(49.0k points)

selected
Jun 3, 2021
by Aeny

Correct answer is B.

Given objective function is Z = 3x1 + 5x2 

https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 2/7
9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18 - Sarthaks e…

Subject to constraints:

3x1 + 2x2 ≤ 18

x1 ≤ 4

x2 ≤ 6

x1 ≥ 0, x2 ≥ 0

To solve this,

Consider the constraints as equations for a while, then we will have

3x1 + 2x2 = 18

x1 = 4

x2 = 6

x1 = 0, x2 = 0

Consider the 3x1 + 2x2 = 18, for graphing this, we can find the intercepts of this equation and
then plot the line.

By dividing the whole equation with 18 we get,

From this equation we know that, x1 will intercept the line x1 = 0 at (6, 0) and x2 will intercept
the line x2 = 0 at (0, 9)

Using these points to plot 3x1 + 2x2 = 18 in the graph, continue plotting the other equations,
x1 = 4 , x2 = 6 , x1 = 0, x2 = 0 on he graph.


https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 3/7
9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18 - Sarthaks e…

From the graph we can clearly see that the area under the polygon, OABCD is the feasible
solution.

For determining the maximum optimum value from the polygon, the points at the vertices of
OABCD are substituted in the Z function and see which point will maximize the value of Z =
3x1 + 5x2.


https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 4/7
9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18 - Sarthaks e…

Among the above points, the Z value maximized at point B where x1 = 2 and x2 = 6.

comment

← Prev Question Next Question →

Find MCQs & Mock Test

1 Free JEE Main Mock Test

2 Free NEET Mock Test

3 Class 12 Chapterwise MCQ Test

4 Class 11 Chapterwise Practice Test

5 Class 10 Chapterwise MCQ Test

6 Class 9 Chapterwise MCQ Test

7 Class 8 Chapterwise MCQ Test

8 Class 7 Chapterwise MCQ Test

Related questions

Solve each of the following linear

0 programming problems by graphical method.
votes
Minimize Z = 3x1 + 5x2

1
answer

https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 5/7
9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18 - Sarthaks e…

asked
May 29, 2021
in Linear Programming
by Vaiga
(49.0k
points)

linear programming
class-12

Solve each of the following linear

0 programming problems by graphical method.
votes
Maximize Z = - x1 + 2x2

asked
May 30, 2021
in Linear Programming
by Aeny
(46.8k
answer
points)

linear programming
class-12

Solve each of the following linear

0 programming problems by graphical method.
votes
Maximize Z = - x1 + 2x2

asked
May 30, 2021
in Linear Programming
by Aeny
(46.8k
answer
points)

linear programming
class-12

Maximize z = 4x1 + 3x2 subject to 3x1 + x2 ≤

0 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0
votes

1 asked
Dec 16, 2021
in Linear Programming
by Heena joseph
(26.5k points)
answer
linear programming
class-12

Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤

0 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which
votes
one of the following is feasible comer point?

asked
Nov 24, 2020
in Operations Research
by Chitranjan
(27.3k
answer
points)

operations research
class-11


https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 6/7
9/25/22, 1:41 PM By graphical method, the solution of linear programming problem Maximize Z = 3x1 + 5x2 Subject to 3x1 + 2x2 ≤ 18 - Sarthaks e…

Send feedback About Us Privacy Policy Terms of Use Copyright Contact Us FAQ
Advertise Careers
Managed by Sarthaks Digitizing India User Contribution to Sarthaks eConnect


https://www.sarthaks.com/1097814/graphical-method-the-solution-linear-programming-problem-maximize-3x1-5x2-subject-3x1-2x2 7/7