Question 181 markMCQSection A

The maximum value of the function z=7x+5yz = 7x + 5y, subject to the constraints x≤3,y≤2,x≥0,y≥0x \le 3, y \le 2, x \ge 0, y \ge 0 is :

Linear Programming
Linear Programming — Maximum at a Corner Point

Options

(A)10
(B)21
(C)31
(D)29

Official answer

The correct option is (C) 31.


Feasible region:

  • The constraints 0≤x≤30 \le x \le 3 and 0≤y≤20 \le y \le 2 form a rectangle with corners (0,0)(0,0), (3,0)(3,0), (3,2)(3,2), (0,2)(0,2).

Evaluate z=7x+5yz = 7x + 5y at each corner:

  • (0,0)(0,0): 0
  • (3,0)(3,0): 21
  • (0,2)(0,2): 10
  • (3,2)(3,2): 21+1021 + 10 = 31 (maximum)
Answer keywords:linear programmingobjective functionfeasible regioncorner point theoremmaximum valueconstraintsvertex evaluation

Marking scheme

  1. 1.1 mark: correct option (C) 31, ideally with z evaluated at the corner (3,2)(3,2).
  2. 2.Accept the working 7(3)+5(2)=317(3)+5(2)=31 as sufficient justification.

Hint

The region is a rectangle 0≤x≤30 \le x \le 3, 0≤y≤20 \le y \le 2; test z at each corner and pick the largest.

Quick oral answer

Since both coefficients are positive, z is maximum at the top-right corner (3,2)(3,2) of the rectangular feasible region, giving 7 times 3 plus 5 times 2, which equals 31.

Common mistakes

  1. 1.Substituting only one variable at its maximum and setting the other to zero, giving 21 or 10 instead of testing the corner (3,2).
  2. 2.Swapping the bounds of x and y, e.g. computing 7(2)+5(3)=297(2)+5(3)=29.
  3. 3.Assuming the maximum lies inside the region rather than at a vertex — for a linear objective the optimum is always at a corner point.

Analysis and explanation

This is a Linear Programming Problem where the objective function attains its maximum at a corner (vertex) of the feasible region — a direct application of the Corner Point Theorem.


Why (C) is correct:

  • Both coefficients (7 and 5) are positive, so z grows as x and y grow. The largest allowed values are x=3x = 3 and y=2y = 2, giving z=7(3)+5(2)=31z = 7(3) + 5(2) = 31.

Why the distractors are wrong:

  • (A) 10 — value at (0,2)(0,2), taking only y at maximum and x=0x = 0.
  • (B) 21 — value at (3,0)(3,0), taking only x at maximum and y=0y = 0.
  • (D) 29 — arises from a slip such as 7(2)+5(3)=297(2)+5(3) = 29 (swapping the x and y bounds).

Exam trap: With a simple rectangular region you can spot the answer, but always confirm by testing all corner points rather than assuming.

Interesting facts

The Corner Point Theorem guarantees that if an optimal solution to an LPP exists, it occurs at a vertex of the feasible region — this is why we only test corners, not interior points.

Linear programming was developed during the 1940s by George Dantzig, who created the Simplex method to solve large-scale optimisation problems for military logistics.

Question details

Q18 of 44 questions

Board
CBSE
Class
Class 12
Subject
Applied Mathematics
Year
2026
Section
Section A
Marks
1
Type
MCQ
Chapter
Linear Programming
Topic
Linear Programming — Maximum at a Corner Point
Bloom's level
apply
Syllabus topic
Unit: Linear Programming — Optimal value of the objective function over a feasible region
Author
CBSE
Reviewed by
Padhantu Academic Team

Spotted a mistake or something unclear?

Tell us and we will fix it.

Frequently asked questions

Why do we only check corner points in a linear programming problem?

Because the objective function is linear, its optimum value over a convex feasible region always occurs at a vertex (corner point). The Corner Point Theorem lets us avoid checking infinitely many interior points and simply compare the objective value at each finite vertex.

How is the feasible region formed from these constraints?

The constraints x≥0x \ge 0, y≥0y \ge 0 restrict us to the first quadrant, while x≤3x \le 3 and y≤2y \le 2 cap the variables. Together they enclose a rectangle with vertices (0,0), (3,0), (3,2) and (0,2), which is the feasible region.