Skip to content
← Applied Mathematics

Applied Mathematics · Class 12 Commerce

Ch 10Linear Programming Problem — Class 12 Applied Mathematics, concept-first.

This concept map shows how the chapter fits together. A linear programming problem is built from four ingredients — decision variables, an objective function, linear constraints and non-negativity conditions. Common types of LPP include manufacturing, diet, transportation and assignment problems.

22

Q&A

1

Concept

Not available

Exam weightage

Start learning — read this chapter →

Key concepts

Hover a concept to preview it and jump to its most relevant Q&A.

Chapter contents

The NCERT structure, section by section. Open a section to see its questions, then read the concept-first solution.

Concept Map

This concept map shows how the chapter fits together. A linear programming problem is built from four ingredients — decision variables, an objective function, linear constraints and non-negativity con…

8.0

Introduction

Linear programming is a powerful mathematical tool for making the best possible decision when resources are limited.

8.1

Linear Programming Problem

Linear programming is a mathematical technique for finding the best possible outcome — maximum profit or minimum cost — under a given set of constraints.

8.2

Mathematical Formulation of a Linear Programming Problem

Every real-world optimization problem — whether it’s a factory deciding how many units of two products to make, or a farmer choosing how much land to allocate to different crops — can be translated in…

8.3

Types of Linear Programming Problems

Linear programming problems in the real world rarely come with a neat, ready-made mathematical model. Instead, they appear in different flavours depending on what you are trying to do — maximise profi…

8.4

Solving a Linear Programming Problem

A linear programming problem is not solved by guesswork — it is solved by systematically exploring the feasible region.

8.5

Graphical Method of Solving Linear Programming Problem

The graphical method is the most intuitive way to solve a linear programming problem when you have only two decision variables.

8.5.1

Corner-Point Method

The corner-point method is the most direct way to solve a linear programming problem when the feasible region is bounded.

8.5.2

Iso-Profit/Iso-Cost Method

The iso-profit (or iso-cost) method is a graphical way to locate the optimal solution when the feasible region is already drawn.

8.7

Unit Summary

This section gathers together everything the chapter has covered on the linear programming problem (LPP) — one of the core topics of the CBSE Class 12 Applied Mathematics syllabus.

Check Your Progress