The solution to the minimization problem subject to the constraint is
Tap an option to check your answer.
JNU SIS 2017 Question 22: Constrained optimisation and linear programming
Answer and worked solution
Checking your account…
Plain-text version
The solution to the minimization problem min y = x₁ + x₂ subject to the constraint 1 - √(x₁) - x₂ = 0 is (A) x₁ = 1, x₂ = 2 (B) x₁ = 1/3, x₂ = 1 (C) x₁ = 1/4, x₂ = 1/2 (D) None of the above
Also written as: The solution to the minimization problem min y = x_1 + x_2 subject to the constraint 1 - sqrt(x_1) - x_2 = 0 is
Constrained optimisation and linear programming has come up 44 times in 7 exams since 2007.
What this question tests
This question is on Equality-constrained optimisation and Lagrange multipliers, part of Constrained optimisation and linear programming in Mathematics.
Optimising a function subject to equality constraints, and what the multiplier means.
TestStop has 14 past-paper questions on this subtopic.
Similar questions from other papers
- Consider the following statement in context of Linear Programming Problem (LPP). A. It has an objective function. B. It allows negative values of decision variable…
- The maximum value of the objective function (x+y) subject to the constraint (x²+y²)=2 is (*in integer*).
- Arrange the following steps in the proper sequence concerning the solution of a linear programming problem: (A) Graph each constraint as though it were binding, i.e.…
- Let f(x,y) = -x²-y²+2x+4y+5. Let (x*,y*) denote the solution to the following optimization problem: Maximize f(x,y) subject to x≥ 0, y≥ 0, 2x+y≤ 6 Then the value of…
- Match List-I with List-II. | List-I | List-II | A. Slack Variable | I. Best of all feasible solutions | B. Surplus Variable | II. Solution violating at least one…
Question from the JNU SIS 2017 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.