Scribd
Upload
18 views13 pages

2.1.LPP Formulation

Linear programming is a mathematical technique for determining the optimal allocation of limited resources to achieve a certain objective. It involves decision variables, constraints representing resource limitations, and an objective function to maximize or minimize. Real-world problems like product mix or blending problems can be formulated as linear programming models with variables, constraints, and an objective function.

Uploaded by

ishaprabhu81
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views13 pages

2.1.LPP Formulation

Linear programming is a mathematical technique for determining the optimal allocation of limited resources to achieve a certain objective. It involves decision variables, constraints representing resource limitations, and an objective function to maximize or minimize. Real-world problems like product mix or blending problems can be formulated as linear programming models with variables, constraints, and an objective function.

Uploaded by

ishaprabhu81
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

LINEAR PROGRAMMING

PROBLEMS
INTRODUCTION TO LINEAR PROGRAMMING

•Linear Programming is a problem solving approach that has been developed to help managers to
make decisions.

• Linear Programming is a mathematical technique for determining the optimum allocation of


resources and obtaining a particular objective when there are alternative uses of the resources, money,
manpower, material, machine and other facilities.
Limitations and Assumptions

• LPP treats all relationship as linear- may not hold good in many real life situations
• All parameters in LPP are assumed to be known constants
• Many pbms are complex since the number of variables and constraints are quite a
large number

• Proportionality, Additivity, Divisibility, Certainty(coefficients in obj fn and


constraints are completely known and do not change during the period of study),
finiteness(activities and constraints are finite in number), optimality(solution to
problem is to be optimum(ie maximum or minimum))
TERMINOLOGY USED IN LINEAR PROGRAMMING PROBLEM
1. Components of LP Problem:
Every LPP is composed of a. Decision Variable, b. Objective Function, c. Constraints.
2. Optimization:
Linear Programming attempts to either maximise or minimize the values of objective function.
3. Profit of Cost Coefficient:
The coefficient of the variable in the objective function express the rate at which the value of
the objective function increases or decreases by including in the solution one unit of each of the decision
variable.
4. Constraints:
The maximisation (or minimisation) is performed subject to a set of constraints.
Therefore LP can be defined as a constrained optimisation problem.
They reflect the limitations of the resources.
5. Input-Output coefficients:
The coefficient of constraint variables are called the Input-Output Coefficients.
They indicate the rate at which a given resource is unitized or depleted.
They appear on the left side of the constraints.

6. Capacities:
The capacities or availability of the various resources are given on the right hand side of the constraints.
THE NATURE OF LINEAR PROGRAMMING PROBLEM
Two of the most common are: 1. The product-mix problem
2. The blending Problem
In the product- mix problem there are two or more product also called candidates or activities competing
for limited resources.
The problem is to find out which products to include in production plan and in what quantities these should
be produced or sold in order to maximize profit, market share or sales revenue.
Blending problem involves determination of best blend of available ingredients to form a certain quantity
of a product under strict specifications.
The best blend means the least cost blend of the required inputs.
Real Situations

• A Manager may have to satisfy certain Restrictions like by


Capital, Time, Capacity etc.
• A Manager may have to meet certain Limitations like
minimum staff requirements, Blending conditions etc.

• A Manager has an Objective which has to be either


Maximised or Minimised
FORMULATION OF THE LINEAR PROGRAMMING MODEL

• Every Linear Programming Problem


has 3 features/components

1. Decision Variables
2. Objective Function
3. Constraints
Structure of Equation

Maximize or Minimize Z= c1x1 + c2x2 + ................+ cnxn subject to linear constraints


Subject to the Constraints
a11x1 + a12x2 + ................+ a1nxn ≤ or = or ≥ b1
a21x1 + a22x2 + ................+ a2nxn ≤ or = or ≥ b2
.......................................................
.......................................................
am1x1 + am2x2 + ................+ amnxn ≤ or = or ≥ bm
non-negativity constraints
x1 ≥ 0, x2 ≥ 0, .................., xn ≥ 0
THE MATHEMATICAL EXPRESSION OF THE LP MODEL
The general LP Model can be expressed in mathematical terms as shown below:
Let
aij = Input-Output Coefficient
Cj = Cost (Profit) Coefficient
bi = Capacities (Right Hand Side)
Xj = Decision Variables
Key Points

• Objective
Maximize- Profit/Revenue/Income
Minimize- Cost

≥ eg- Atleast
≤ eg – available time/ amount is given/ not more than
Illustration Pbm

A manufacturer makes two products chairs and tables. Processing of


these products are done on two machines A and B. A chair requires 2
hours on machine A and 6 hours on machine B. A table requires 5 hours
on machine A and no time on machine B. There are 16 hours of time per
day available on machine A and 20 hours on machine B. Profit gained
by the manufacture from a chair is Rs 10 and table is Rs 20 respectively.
Formulate the problem into LPP.
A manufacturer makes two products chairs and tables. Processing of these products are done on two machines A
and B. A chair requires 2 hours on machine A and 4 hours on machine B. A table requires 5 hours on machine A
and no time on machine B. There are 15 hours of time per day available on machine A and 20 hours on machine
B. Profit gained by the manufacture from a chair is Rs 10 and table is Rs 20 respectively. Formulate the problem
into LPP.
Products
Machines Chair (X1) Table (X2) Available time

Machine A 2 5 ≤ 15
Machine B 4 ----- ≤ 20
Profit 10 20

Objective Function
Maximize/ Minimize ?
Maximize Z= 10X1 + 20X2
Constraints : 2X1 + 5X2 ≤ 15
4X1 + 0X2 ≤ 20
How many unknown variables? X1,X2 ≥ 0

You might also like