PadhoNaby JEE Master
  • Home
  • Learn
  • Plan & Focus
  • Community
  • Pricing
  • Play & Compete
  • Free Resources
Log inJoin Free
PadhoNaby JEE Master

Ask. Share. Learn. Grow Together. India's all-in-one community for JEE Main & JEE Advanced aspirants.

Explore

  • Learn
  • Plan & Focus
  • Community
  • Play & Compete
  • Free Resources

Resources

  • JEE Main PYQs
  • JEE Advanced PYQs
  • Formula Sheets
  • NCERT Mapping
  • Mock Analysis

Support

  • Help Center
  • Privacy Policy
  • Terms of Use
  • Contact Us

© 2026 PadhoNa. All rights reserved.

Unique PYQs / Maths

Linear Programming

1 PYQs → 1 unique concepts, 0 similar PYQs. The first 3 are free.

JEE Main 2021 · JEE Main 17 Mar 2021 Shift-I

Non-linear objective on a linear region: substitute the binding constraint

Linear Programming ProblemsAsked in 2021

The maximum value of z in the following equation z=6xy+y2, where 3x+4y≤100 and 4x+3y≤75 for x≥0 and y≥0 is ______
(Round off to the Nearest Integer)
Theory
In LP the optimum of a linear objective lies at a corner, but if z is non-linear (z = 6xy + y²) the optimum can lie on an edge. Find which constraint binds (here 4x + 3y ≤ 75 for x > 0), note z increases with x, so set x on that line, reduce z to a quadratic in y, and maximise at the vertex while checking x ≥ 0. Trap: checking only corner points as in linear LP.

How NTA asks it

Asked as the maximum value of z = 6xy + y² under two linear constraints, rounded to the nearest integer.