GATE ME 2015 Set 3 — Question 61

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+2 / -0.67MediumLP (Graphical & Simplex)Operations ResearchIndustrial Engineering

Industrial Engineering → Operations Research → LP (Graphical & Simplex)

Last updated

Question

For the linear programming problem:
Maximize Z=3X1+2X2Z = 3X_1 + 2X_2
Subject to
2X1+3X29-2X_1 + 3X_2 \leq 9
X15X220X_1 - 5X_2 \geq -20
X1,X20X_1, X_2 \geq 0
The above problem has
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE ME question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Operations Research