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 › CUET-PG › CUET-PG 2019 › Q45
4 marks, −1Mathematics › Constrained optimisation and linear programming › Linear programming: formulation and graphical solutionModerateabout 1 min

CUET-PG 2019 Question 45: Constrained optimisation and linear programming

Linear Programming theory states that the optimal solution to any problem will lie at

Tap an option to check your answer.

Answer and worked solution

Checking your account…

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

What this question tests

This question is on Linear programming: formulation and graphical solution, part of Constrained optimisation and linear programming in Mathematics.

Setting up a linear program and finding its optimum at a corner of the feasible region.

TestStop has 15 past-paper questions on this subtopic; the nearest in year are below.

  • IIT JAM 2021 · Q56For some β > 0, let x₁ and x₃ be the optimal basic feasible solution of: maximize x₁ + 2x₂ + 3x₃ subject to…
  • IIT JAM 2022 · Q58Maximize Z = -0.2x₁ + x₂ subject to 2x₁ + 5x₂ ≤ 70, x₁ + x₂ ≤ 20, x₁, x₂ ≥ 0. If x₁ = a and x₂ = b is the…
Take this paper as a timed mockMore on Linear programming: formulation and graphical solution

Similar questions from other papers

  • CUET-PG 2026 · Q60Consider the following statement in context of Linear Programming Problem (LPP). A. It has an objective function. B. It allows negative values of decision variable…
  • IIT JAM 2026 · Q49The maximum value of the objective function (x+y) subject to the constraint (x²+y²)=2 is (*in integer*).
  • CUET-PG 2025 · Q52Arrange 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.…
  • GATE 2025 · Q63Let 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…
  • UGC-NET 2025 · Q8Match 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 CUET-PG 2019 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.