हिंदी

Basic Concepts of Linear Programming

Advertisements

Topics

Estimated time: 4 minutes
CBSE: Class 12
Maharashtra State Board: Class 12

Defintion: Linear Programming Problem (L.P.P.)

Linear Programming Problem (LPP) is a problem in which a linear objective function is to be maximised or minimised subject to a set of linear constraints and non-negative conditions on the variables.

CBSE: Class 12

Definition: Optimisation Problem

An optimisation problem is a problem in which the value of one quantity has to be made as large as possible or as small as possible under given restrictions. If the quantity and restrictions are linear, the problem becomes a Linear Programming Problem (LPP).

CBSE: Class 12

Standard Structure of an LPP

A Linear Programming Problem usually contains the following parts:

  • Let the unknown quantities be represented by variables such as x and y.

  • Form a linear objective function such as Z = ax + by.

  • Write all restrictions as linear inequalities or equations.

  • Add non-negativity restrictions: x ≥ 0, y ≥ 0.

  • Solve graphically when only two variables are involved.

CBSE: Class 12

Real Life Examples

Example 1: Furniture Dealer

A furniture dealer deals in two items: tables and chairs. He has Rs 50,000 to invest and space for at most 60 pieces. A table costs Rs 2500 and gives a profit of Rs 250, while a chair costs Rs 500 and gives a profit of Rs 75. The problem is to decide how many tables and chairs he should buy so that total profit is maximum.

Video Tutorials

We have provided more than 1 series of video tutorials for some topics to help you get a better understanding of the topic.

Series 1


Series 2


Shaalaa.com | Linear Programming part 1 (Introduction)

Shaalaa.com


Next video


Shaalaa.com


Linear Programming part 1 (Introduction) [00:08:45]
S
Series: series 1
0%


Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×