Skip to content
We use only essential cookies to keep you signed in and remember your preferences. See our Cookie Policy.
TestStop
MocksPracticeResourcesIndiaBlogPricing
Sign in
Questions › IIT JAM › IIT JAM 2021 › Q55
2 marksMathematics › Constrained optimisation and linear programming › Inequality constraints, second-order conditions and envelope theoremHardabout 3 min

IIT JAM 2021 Question 55: Constrained optimisation and linear programming

The optimal value of: minimize 2xy2xy2xy subject to 9x2+4y2≤369x^2 + 4y^2 \le 369x2+4y2≤36 is _______ (in integer).

Answer and worked solution

Answer: -6

The minimum of 2xy2xy2xy occurs on the boundary 9x2+4y2=369x^2 + 4y^2 = 369x2+4y2=36 with xxx and yyy of opposite sign. Lagrange conditions give ∣y∣=1.5∣x∣|y| = 1.5|x|∣y∣=1.5∣x∣, and the constraint yields x2=2x^2 = 2x2=2.

Taking x=2x = \sqrt{2}x=2​, y=−1.52y = -1.5\sqrt{2}y=−1.52​ gives 2xy=2(2)(−1.52)=−62xy = 2(\sqrt{2})(-1.5\sqrt{2}) = -62xy=2(2​)(−1.52​)=−6. The answer is −6-6−6.

Plain-text version

The optimal value of: minimize 2xy subject to 9x² + 4y² ≤ 36 is _ (in integer).

Also written as: The optimal value of: minimize 2xy subject to 9x^2 + 4y^2 <= 36 is _ (in integer).

Constrained optimisation and linear programming has come up 44 times in 7 exams since 2007.

What this question tests

This question is on Inequality constraints, second-order conditions and envelope theorem, part of Constrained optimisation and linear programming in Mathematics.

Optima with inequality constraints, tests for maxima, and how the optimal value changes with parameters.

TestStop has 8 past-paper questions on this subtopic.

Take this paper as a timed mockMore on Inequality constraints, second-order conditions and envelope theorem

Question from the IIT JAM 2021 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.