Scribd
Upload
2 views

Linear Programming

Linear Programming Problems (LPP) involve optimizing a linear function subject to constraints, aiding decision-making in resource allocation. The model consists of decision variables, an objective function, and constraints, with methods like graphical and simplex for solving. LPP is widely applicable across various industries for maximizing profits or minimizing costs.

Uploaded by

Pritam Chavan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Linear Programming

Linear Programming Problems (LPP) involve optimizing a linear function subject to constraints, aiding decision-making in resource allocation. The model consists of decision variables, an objective function, and constraints, with methods like graphical and simplex for solving. LPP is widely applicable across various industries for maximizing profits or minimizing costs.

Uploaded by

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

Linear Programming

Problems
 Linear Programming Problems in maths is a system
process of finding a maximum or minimum value
of any variable in a function, it is also known by
the name of optimization problem.
 LPP is helpful in developing and solving a decision
making problem by mathematical techniques.
 The problem is generally given in a linear function
which needs to be optimized subject to a set of
different constraints.
 Major usage of LPP is in advising the management
to to make the most efficient & effective use of the
scarce resources.
Different Parts of the LP Model
• 1. Decision Variable: Variables which are changeable & going to impact
the decision function. Like the profit function is effected by both sales
and price, now which one of these two is changeable, will be our
decision variable. ​

• 2. Objective Function: Linear function of the objective, either to


Maximize or minimize, like Maximize Profit, sales, production etc. and
Minimize Cost, Loss, energy, consumption, wastage etc.
​
• 3. Constraints: Any kind of limitation or scarcity explained through a
function like Limitations of raw materials, time, funds, equipment's etc.
Non-Negative Constraints will also be there which will remain non-
negative all the time​
 What is Linear Programming Formula?
 The general formula for a linear programming problem is given as
follows:
 Objective Function: Z = ax + by
 Constraints: cx + dy ≤ e,
fx + gy ≤ h.
The inequalities can also be "≥"
Non-negative restrictions: x ≥ 0, y ≥ 0
 The objective function is the linear function that needs to be

maximized or minimized and is subject to certain constraints.

 It is of the form Z = ax + by.


Formulation of an LP Problem

1. Recognize the decision variables and assign symbols to them like X, Y, Z & so
on). Now these are the quantities we wish to find out. ​

2. Express all the constraints in terms of inequalities in relation the decision


variable. ​

3. Formulate the objective function in terms of the decision variables. ​

4. Add the non-negativity condition/constraints​


 A furniture company produces inexpensive tables and chairs. The
production process for each is similar in that both require a certain
number of hours of carpentry work and a certain number of labour
hours in the painting department. Each table takes 4 hours of
carpentry and 2 hours in the painting department. Each chair requires
3 hours of carpentry and 1 hour in the painting department. During
the current production period, 240 hours of carpentry time are
available and 100 hours in painting is available. Each table sold
yields a profit of E7; each chair produced is sold for a E5 profit. Find
the best combination of tables and chairs to manufacture in order to
reach the maximum profit.​
• The decision variables can be defined as X = number of tables to be produced & Y =
number of chairs to be produced. ​

• Now linear programming (LP) problem can be formulated in terms of X and Y and Profit
(P). ​

• maximize P = 7X + 5Y (Objective function) subject to 4X + 3Y ≤ 240 (hours of carpentry


constraint) 2X + Y ≤ 100 (hours of painting constraint) X ≥ 0, Y ≥ 0 (Non-negativity
constraint). ​

• Therefore the mathematical formulation of the LPP is: ​

• Maximize: P = 7X + 5Y Subject to: 4X + 3Y ≤ 240 2X + Y ≤ 100 X ≥ 0 , Y ≥ 0 To find the


optimal solution to this LP using the graphical method we first identify the region of
feasible solutions and the corner points of the of the feasible region. The graph for this
example is plotted in the next slide​
• The graphical method is one of the easiest way to solve a small LP
problem. However this is useful only when the decision variables
are not more than two. ​

• It is not possible to plot the solution on a two-dimensional graph


when there are more than two variables and we must turn to more
complex methods.​

• Another limitation of graphical method is that, an incorrect or


inconsistent graph will produce inaccurate answers, so one need to
be very careful while drawing and plotting the graph. ​

• A very useful method of solving linear programming problems of


any size is the so called Simplex method. ​

• We will discuss simplex method once you are done with the practice
on graphical method.​
 How to Formulate a Linear Programming Model?

 The steps to formulate a linear programming model are given as follows:

 Identify the decision variables.

 Formulate the objective function.

 Identify the constraints.

 Solve the obtained model using the simplex or the graphical method.
 How to Find Feasible Region in Linear Programming?
 To find the feasible region in a linear programming problem the steps
are as follows:
 Draw the straight lines of the linear inequalities of the constraints.
 Use the "≤" and "≥" signs to denote the feasible region of each
constraint.
 The region common to all constraints will be the feasible region for
the linear programming problem.
 What are Linear Programming Uses?

 Linear programming is widely used in many industries such as


delivery services, transportation industries, manufacturing
companies, and financial institutions.
 The linear program is solved through linear optimization method, and
it is used to determine the best outcome in a given scenario.
 As the minimum value of Z is 127, thus, B (3, 28) gives the optimal
solution.

Answer: The minimum value of Z is 127 and the optimal solution is


(3, 28)
 A farmer has 200 acres of land. He produces three
products X, Y & Z. Average yield per acre for X, Y
& Z is 4000, 6000 and 2000 kg. Selling price of X,
Y & Z is Rs. 2, 1.5 & 4 per kg respectively. Each
product needs fertilizers. Cost of fertilizer is Rs. 1
per kg. Per acre need for fertilizer for X, Y & Z is
200, 200 & 100 kg respectively. Labour
requirements for X, Y & Z is 10, 12 & 10 man
hours per acre. Cost of labour is Rs. 40 per man
hour. Maximum availability of labour is 20, 000
man hours. Formulate as LPP to maximise profit.
 Solution: Decision variables: The production/yield of three
products X, Y & Z is given as per acre.
 Hence,
 x1 = No. of acres allocated to X
 x2 = No. of acres allocated to Y
 x3 = No. of acres allocated to Z
 Objective Function:
 Profit = Revenue - Cost Profit = Revenue - (Fertilizer Cost
+ Labour Cost)
Product X Y Z

Revenue 2(4000) X1 1.5(6000)X 4(2000)X3


2

(-) Less

Fertiliser Cost 1 (200) X1 1 (200)X2 1 (100) X3

Labour Cost 40(10) X1 40(12) X2 40(10)X3

Profit 7400 X1 8320X2 7500X3

You might also like