BRAINBIT
CoursesExamsUse casesPricingAbout
Get started
CoursesExamsUse casesPricingAbout
CoursesMathematicsConstraints, Feasible Region & Corner Points

Chapter 15: Linear Programming

Constraints, Feasible Region & Corner Points

Write a linear programming problem, shade the feasible region and find the optimum with the corner-point method.

JEE MainJEE Advanced

Explanation

Welcome to The Factory Floor

A factory has limited machines, hours and money. How many of each product should it make to earn the most?

Linear programming turns that question into lines on a graph, and the best answer always sits at a corner.

Objective Z = ax + by (maximise or minimise) ·…

A linear programming problem has three parts: an objective Z to maximise or minimise, a few linear constraints, and the rule that x and y can't be negative.

Objective Z = ax + by (maximise or minimise) · linear constraints · x ≥ 0, y ≥ 0

Each constraint is a half-plane

Each inequality cuts the plane in half. Draw its boundary line, then test the origin.

If the origin satisfies the inequality, shade its side; if not, shade the other side.

Each constraint is a half-plane: draw the line, test (0, 0), shade the side that works

Feasible region = where all the constraints overlap

The feasible region is where every shaded half overlaps. Any point inside is a plan the factory can actually carry out.

Feasible region = where all the constraints overlap

Corner-point method

Here's the key fact: the best value of Z is always at a corner of the feasible region. So list every corner, put each into Z, and pick the largest or smallest.

Corner-point method: the optimum of a bounded region is at a corner · find all corners, evaluate Z

Two corners tie

If two corners give the same best value, every point on the edge joining them is also best. And if the region runs off to infinity, a minimum may still exist, but a maximum might not.

Two corners tie → every point on the edge between them is optimal · unbounded region → a maximum may not exist

Worked example

Maximise Z = 2x + 5y with x + y ≤ 5, x ≤ 3, x, y ≥ 0. The corners are (0, 0), (3, 0), (3, 2) and (0, 5), giving Z = 0, 6, 16 and 25.

The maximum is 25 at (0, 5).

Memory tricks

  • Test the origin; if it fits, shade the origin's side.Origin daal ke dekho, sach hai toh usi taraf shade.
  • Go to the corners, plug in Z, pick the best one you see.Kone pe jao, Z ko lagao, sabse bada ya chhota uthao.
  • An unbounded region may have no maximum at all.Unbounded region mein maximum ho bhi sakta hai, nahi bhi.

Try 3 practice questions

  1. Q1. Minimise Z = 3x + 4y subject to x + y ≥ 2, x ≥ 0, y ≥ 0

    1. A. 6
    2. B. 8
    3. C. 0
    4. D. 7
    Show answer

    Answer: 6

    The corners (2, 0) and (0, 2) give 6 and 8, and Z only grows further out

  2. Q2. The region x + y ≤ 4 lies on which side of the line x + y = 4?

    1. A. the side containing the origin
    2. B. the side away from the origin
    3. C. on the line only
    4. D. both sides
    Show answer

    Answer: the side containing the origin

    The origin gives 0 ≤ 4, which is true

  3. Q3. The corner points of x + 2y ≤ 8, x ≥ 0, y ≥ 0

    1. A. (0, 0), (8, 0), (0, 4)
    2. B. (0, 0), (4, 0), (0, 8)
    3. C. (8, 0), (0, 4) only
    4. D. (0, 0), (8, 4)
    Show answer

    Answer: (0, 0), (8, 0), (0, 4)

    The line x + 2y = 8 meets the axes at (8, 0) and (0, 4), plus the origin

Learn Constraints, Feasible Region & Corner Points the fun way

Voice-explained cards, mini-games, full practice and the exam round. Free with one account.

Start Mathematics
PreviousThe Principle of Mathematical Induction
BRAINBIT

Bite-sized, game-like lessons for JEE, NEET, Banking and SSC aspirants.

Courses

  • Inorganic Chemistry
  • Organic Chemistry
  • Physical Chemistry
  • Physics
  • Mathematics
  • Biology
  • Logical Reasoning
  • Quantitative Aptitude
  • Data Interpretation
  • English Language
  • General Awareness
  • Typing
  • Vedic Math
  • Abacus
  • Logical Puzzles

Exams

  • JEE Main
  • JEE Advanced
  • NEET
  • IBPS PO
  • SBI PO
  • SSC CGL
  • CAT
  • RRB NTPC

Brainbit

  • Courses
  • Exams
  • Use cases
  • Pricing
  • About

© 2026 Brainbit. All rights reserved.

Privacy PolicyTerms & Conditions
Sign in
Get started
Start Mathematics