---
type: "Chapter"
knowledge_type: "chapter"
entity_type: "chapter"
id: "66dfdfcd3f8b4e9e69bf7fb2"
title: "Linear Programming"
board: "CBSE"
curriculum: "CBSE"
class: "Class 12"
subject: "Mathematics"
book: "Mathematics Part - II"
chapter: "Linear Programming"
chapter_slug: "linear-programming"
canonical_url: "https://www.edzy.ai/cbse-class-12-mathematics-mathematics-part-ii-linear-programming"
markdown_url: "https://www.edzy.ai/okf/chapter/cbse-class-12-mathematics-mathematics-part-ii-linear-programming.md"
source_type: "examSubjectBookChapter"
source_id: "66dfdfcd3f8b4e9e69bf7fb2"
source_pdf: "https://edzy-ai.s3.ap-south-1.amazonaws.com/edzy-express-ts/1bd3cc4f-50a8-4707-9aa1-3e7f3ea5aa44.pdf"
source: "Edzy"
version: 1
last_updated: "2026-06-20"
---

# Linear Programming
In this chapter, we explore the concept of Linear Programming, which involves the optimization of a linear function subject to certain constraints. We will analyze how to efficiently utilize resources to achieve maximum profit through real-world examples and practical applications of linear programming.

---

## Knowledge Snapshot

| Field | Details |
| :--- | :--- |
| Class | Class 12 |
| Subject | Mathematics |
| Book | Mathematics Part - II |
| Chapter | Linear Programming |
| Pages | 394-405 |

---

## Chapter Summary

### Short Summary
This chapter discusses linear programming, a mathematical method to determine the best possible outcome in a given situation, subject to certain constraints. Using a furniture dealer's example, it focuses on maximizing profit through systematic investment strategies involving tables and chairs.

### Detailed Summary
The chapter begins with the introduction of optimization problems, specifically linear programming problems characterized by constraints and a linear objective function. Through the example of a furniture dealer with limited budget and storage, we form a mathematical representation of the problem, defining variables, constraints, and the objective function. The graphical method for solving these problems is presented, detailing the identification of feasible and optimal solutions using graphically represented constraints, corner point method, and key theorems associated with bounded and unbounded feasible regions.

---

## Topic-Wise Explanation

### Introduction
The chapter introduces the concept of linear programming and its relevance in solving real-world problems involving optimization.

### Linear Programming Problem and its Mathematical Formulation
Discusses mathematical formulation involving constraints and an objective function using the furniture dealer's investment problem as an example.

### Feasible Region
Defines the feasible region as the set of all possible solutions that satisfy the constraints of the problem. Illustrates the importance of identifying feasible solutions in the context of optimization.

### Optimal Solution
Explains the concept of achieving the maximal value of the objective function at a feasible solution within the defined feasible region.

### Theorems related to linear programming
Presents fundamental theorems which provide criteria for identifying optimal solutions at corner points of the feasible region. The chapter includes Theorems 1 and 2 regarding the characteristics of feasible regions and objective function optimization.

### Applications and Examples
Offers practical examples to demonstrate the application of the graphical method for solving linear programming problems, highlighting critical steps and considerations.

---

## Core Ideas

| Idea | Explanation |
| :--- | :--- |
| Optimization Problems | Involve maximizing or minimizing a function subject to constraints. |
| Linear Programming Problem | Special type of optimization problem focused on finding optimal linear outcomes under constraints. |
| Feasible Region | The region determined by constraints where solutions are viable. |
| Objective Function | A linear function to be maximized or minimized. |

---

## Key Concepts

| Concept | Meaning |
| :--- | :--- |
| Constraints | Linear inequalities that define the limits of the feasible region. |
| Decision Variables | Variables that we decide upon to optimize the objective function. |
| Corner Point Method | A method to find optimal solutions by evaluating the objective function at the vertices of the feasible region. |

---

## Important Points for Revision

* Linear Programming involves maximizing or minimizing a linear function subject to constraints.
* Define decision variables to represent quantities in the objective function.
* Constraints can be represented as linear inequalities.
* The feasible region is defined by the intersection of constraints and must satisfy non-negativity.
* Optimal solutions occur at corner points of the feasible region.
* The graphical method is effective for visualizing and solving linear programming problems with two variables.
* Theorems provide a structured approach to identifying optima based on corner points.
* Applications of linear programming span across various fields including economics, business, and engineering.

---

## Practice Questions

### Short Answer Questions
1. What is a linear programming problem?
2. Define feasible region in the context of linear programming.
3. What are decision variables?
4. Explain the significance of corner points in optimization.
5. How do constraints affect the feasible region?

### Long Answer Questions
1. Formulate the linear programming problem for a given scenario involving investment in multiple products.
2. Illustrate the graphical method with a detailed example, identifying feasible and optimal solutions.
3. Discuss the implications of unbounded feasible regions in linear programming.

---

## Related Concepts

* Systems of Linear Inequalities
* Graphical Solution Method
* Optimization Techniques

---

## Source Attribution

| Field | Value |
| :--- | :--- |
| Source | Edzy |
| Reference Type | examSubjectBookChapter |
| Reference ID | 66dfdfcd3f8b4e9e69bf7fb2 |
| Canonical URL | https://www.edzy.ai/cbse-class-12-mathematics-mathematics-part-ii-linear-programming |
| Markdown URL | https://www.edzy.ai/okf/chapter/cbse-class-12-mathematics-mathematics-part-ii-linear-programming.md |