GATE Exam > GATE Questions > Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 ...
Start Learning for Free
Maximize Z = 15X1 + 20X2
Subject to
12X1 + 4X2 > 36
12X1 - 6X2 < 24
X1, X2 > 0
The above linear programming problem has
Subject to
12X1 + 4X2 > 36
12X1 - 6X2 < 24
X1, X2 > 0
The above linear programming problem has
- a)infeasible solution
- b)unbounded solution
- c)alternative optimum solutions
- d)degenerate solution
Correct answer is option 'B'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X...
Max Z = 15x1 + 20x2
Subjected to
12x1 + 4x2 ≥ 36
12x1 - 6x2 ≤ 24
x1, x2 ≥ 0 ,
unbounded solution.
Subjected to
12x1 + 4x2 ≥ 36
12x1 - 6x2 ≤ 24
x1, x2 ≥ 0 ,
unbounded solution.
Most Upvoted Answer
Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X...
To maximize Z = 15X1 + 20X2 subject to 12X1 + 4X2 ≤ c, where c is some constant:
1. Graph the inequality 12X1 + 4X2 ≤ c on a coordinate plane.
2. The feasible region will be the area below the line formed by the inequality.
3. Identify the corner points of the feasible region. These are the points where the line intersects the x and y axes.
4. Substitute the values of the corner points into the objective function Z = 15X1 + 20X2.
5. Calculate the value of Z for each corner point.
6. The corner point that gives the highest value of Z is the optimal solution to the problem.
1. Graph the inequality 12X1 + 4X2 ≤ c on a coordinate plane.
2. The feasible region will be the area below the line formed by the inequality.
3. Identify the corner points of the feasible region. These are the points where the line intersects the x and y axes.
4. Substitute the values of the corner points into the objective function Z = 15X1 + 20X2.
5. Calculate the value of Z for each corner point.
6. The corner point that gives the highest value of Z is the optimal solution to the problem.
|
Explore Courses for GATE exam
|
|
Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer?
Question Description
Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer?.
Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer?.
Solutions for Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE.
Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.
Here you can find the meaning of Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Maximize Z = 15X1 + 20X2Subject to12X1 + 4X2 >3612X1 - 6X2 < 24X1, X2 > 0The above linear programming problem hasa)infeasible solutionb)unbounded solutionc)alternative optimum solutionsd)degenerate solutionCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice GATE tests.
|
|
Explore Courses for GATE exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup