##### VMC VIQ Scholarship Test

ApplyRegister for Vidyamandir Intellect Quest. Get Scholarship and Cash Rewards.

Edited By Ramraj Saini | Updated on Apr 23, 2022 01:25 PM IST

Linear Programming belongs to the 12 chapter of NCERT. The NCERT Class 12 Maths chapter 12 notes cover up the main portions of the chapter. Class 12 Math chapter 12 notes are mainly focused on the important formulas, the way to approach the problem. A Class 12 Maths chapter 12 note has the objective to either maximize or minimize the numerical values.

This Story also Contains

- NCERT Class 12 Maths Chapter 12 Notes
- Linear Programming Problem And Its Mathematical Formula
- Mathematical Formulation Of The Problem
- Some Basic Terminology
- Graphical Method Of Solving Linear Programming Problems
- Methods Of Solving A Linear Problem
- Different Types Of Linear Programming Problems
- Significance Of NCERT Class 12 Math Chapter 12 Notes
- NCERT Books and Syllabus

Notes for Class 12 Maths chapter 12 is made in such a way that it contains linear function. These functions are based on the factor in the form of linear equations or inequalities. CBSE class 12 maths chapter 12 notes not only covers the NCERT notes but also covers NCERT notes for Class 12 Maths chapter 12.

After going through Class 12 Linear Programming notes

**Also, students can refer,**

- NCERT Notes for Class 12 Maths
- NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming
- NCERT Exemplar Class 12 Maths Chapter 12 Solutions Linear Programming

Linear programming is generally defined as the technique for maximizing or minimizing a linear function of several variables like input or output cost.

A Mountaineering equipment dealer deals in only two items–tent and rucksacks. He has Rs 50,000 for investment and has storage of compiling a maximum of 60 pieces. A tent is priced at Rs 2500 and a rucksack Rs 500. He estimates that by selling one tent he can get a profit of Rs 250 and that from the. sale of one rucksack he earns a profit of Rs 75. So how many tents and rucksacks should he buy from the money to maximize his total profit, assuming: he can sell all the products he buys.

Here we can observe

- The dealer can invest his money in buying a tent or rucksacks or a combination thereof. Later he would earn different ways of profits by following different investment strategies.
- There are a lot of conditions i.e.His investment is of the maximum of Rs 50,000 and he has storage of a maximum of 60 pieces.

Let us assume that he decides to buy a tent only and no rucksacks, so he can buy 50000 ÷ 2500, i.e., 20 tents. Thus his profit can be written as: Rs (250 × 20), i.e., Rs 5000.

Suppose he chooses to buy rucksacks only and no tent. With the capital of Rs 50,000, he can buy 50000 ÷ 500, i.e. 100 rucksacks. But he can only store 60 pieces. Therefore, he can only buy 60 rucksacks which will give a profit of Rs (60 × 75), i.e., Rs 4500.

There are other possibilities too; like, he may choose to buy 10 tents and 50 rucksacks, as his storage is limited to only 60 pieces. The total profit would be calculated as Rs (10 × 250 + 50 × 75), i.e., Rs 6250 and so on.

Thus, we find that the dealer can invest his money in many different ways so that he would earn different profits by the given different investment strategies.

Now the question arises how should he invest to get the maximum profit. For this let us see the process mathematically.

Let x be the number of tents and y be the number of rucksacks that the dealer buys. Here, x and y must be non-negative, i.e.,

Mathematically,

2500x + 500y ≤ 50000 (investment)

or 5x + y ≤ 100 ... (3)

and x + y ≤ 60 (storage) ... (4)

Z = 250x + 75y ( objective function) ... (5)

Now, the given problems now reduces to:

Maximize Z = 250x + 75y

5x + y ≤ 100

x + y ≤ 60

x ≥ 0, y ≥ 0

Such a problem is called linear programming.

**Objective function :**

Let Z = ax + by being a linear function, where a, b are the constants, Linear objective function goes by the computation of the maximum or the minimum of X

Let, Z = ax + by be a linear objective function. Then the variables x and y are called decision variables.

**Constraints :**

Constraints are the limitations or the restrictions imposed on the decision variables.

**Optimization problem:**

A problem that asks to maximize or minimize a linear function limited to certain constraints.

Let us see a graph

5x + y ≤ 100 ... (1)

x + y ≤ 60 ... (2)

x ≥ 0 ... (3)

y ≥ 0 ... (4)

Each point in the shaded region represents a feasible choice, therefore, is called the feasible region.

Any points outside feasible points are called infeasible points.

**Optimal (feasible) solution:**

Any point in the feasible region that gives the maximum or minimum value of the objective function is called an optimal solution.

Find the feasible region of the problem and find the vertices.

Find the objective function Z = ax + by. Let M and m be the largest and the smallest point of the problem

i) When the area is bounded. "M" and "m" are maximum and minimum values If a feasible area is unbounded then

JEE Main Highest Scoring Chapters & Topics

Just Study 40% Syllabus and Score upto 100%

Download EBookax +by > M no common points common with the feasible region.

- ax +by < m no common points common with the feasible region.

Manufacturing Problem: - Here we describe the different types of unit that should be produced in a firm

Diet Problems: - Here we discuss the requirement of essential nutrients required for our body.

Transportation Problem: - Here we discuss the cheapest way of transporting materials from factories to different locations

This brings us to the end of the chapter.

Class 12 linear programming notes will be helping the students to revise the chapter and get a gist of the important topics required. Here all the important parts are nicely covered starting from basic to advance. Also, Class 12 Math chapter 12 notes are useful for completing the Class 12 CBSE Syllabus and for competitive exams like BITSAT, and JEE MAINS. Class 12 Maths chapter 12 notes pdf download can be used to prepare in offline mode.

Linear programming Class 12 notes pdf download: link

- NCERT Exemplar Class 12 Solutions
- NCERT Exemplar Class 12 Maths
- NCERT Exemplar Class 12 Physics
- NCERT Exemplar Class 12 Chemistry
- NCERT Exemplar Class 12 Biology

- NCERT Solutions for Class 12 Mathematics
- NCERT Solutions for Class 12 Chemistry
- NCERT Solutions for Class 12 Physics
- NCERT Solutions for Class 12 Biology

1. Define Linear Programming according to linear Programming class 12 notes.

In, NCERT class 12 maths chapter 12 is a process of optimising the problems which are subjected to certain constraints. This means that it is the process of maximizing or minimizing a linear function under linear inequality constraints.

2. What are the different types of linear programming?

The different types of are:

Solving linear programming by Simplex method

Solving linear programming using R

Solving linear programming by graphical method

Solving linear programming with the use of an open solver.

3. What are the needs of linear programming according to class 12th maths chapter 12 notes?

The five basic requirements of linear programming are:

Objective function

Constraints

Linearity

Non-negativity

Finiteness

4. Name the textbook to be followed

Class 12 math chapter 9 textbook can be used as a reference to these notes.

5. From where we can download these notes?

The notes can be easily downloaded from differential equation class 12 notes pdf download

Application Date:05 September,2024 - 20 September,2024

Application Date:17 September,2024 - 30 September,2024

Application Date:17 September,2024 - 30 September,2024

Get answers from students and experts

Register for Vidyamandir Intellect Quest. Get Scholarship and Cash Rewards.

Register for Tallentex '25 - One of The Biggest Talent Encouragement Exam

As per latest 2024 syllabus. Physics formulas, equations, & laws of class 11 & 12th chapters

As per latest 2024 syllabus. Chemistry formulas, equations, & laws of class 11 & 12th chapters

Accepted by more than 11,000 universities in over 150 countries worldwide

Register now for PTE & Unlock 10% OFF : Use promo code: 'C360SPL10'. Limited Period Offer! Trusted by 3,500+ universities globally

News and Notifications

Back to top