Scribd
Upload
0 views7 pages

16. Linear Programming

Linear Programming is a mathematical method used to optimize a given quantity under constraints represented by linear inequalities. An optimal solution maximizes or minimizes an objective function, with assumptions including proportionality, additivity, divisibility, and certainty. The document provides examples of linear programming models for different scenarios, illustrating how to formulate and solve them graphically.

Uploaded by

enjoy.chakma
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
0 views7 pages

16. Linear Programming

Linear Programming is a mathematical method used to optimize a given quantity under constraints represented by linear inequalities. An optimal solution maximizes or minimizes an objective function, with assumptions including proportionality, additivity, divisibility, and certainty. The document provides examples of linear programming models for different scenarios, illustrating how to formulate and solve them graphically.

Uploaded by

enjoy.chakma
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/ 7

Linear Programming

Linear Programming
Linear Programming is a branch of mathematics where we wish to maximize or minimize
a given quantity subject to conditions (constrains) that can be represented by a system of
linear inequalities.

What is an Optimal Solution?


It is the Feasible Solution which Optimizes. i.e. "provides the most beneficial result for the
specified objective function".
If objective function is profit then optimal solution is the co-ordinate giving maximum
value and if objective function is cost then the optimal solution is the coordinate giving
minimum value.

Assumptions of Linear Programming Model


Proportionality - The rate of change (slope) of the objective function and constraint
equations is constant.
Additivity - Terms in the objective function and constraint equations must be
additive.
Divisibility -Decision variables can take on any fractional value and are therefore
continuous as opposed to integer in nature.
Certainty - Values of all the model parameters are assumed to be known with
certainty (non-probabilistic).

Limitation-
1. Relation among decision variables linear.
2. Answer will not be integer always.
3. Linear programming deals with single objective function. In real life, business
and other works have multiple objective.
4. Ignore the effect of time.
Example-01
A company manufactures two products X and Y, which require the following resources.
The resources are the capacities machine M1, M2, and M3. The available capacities are
50, 25 and 15 hours respectively in the planning period. Product X requires 1 hour of
machine M2 and 1 hour of machine M3. Product Y requires 2 hours of machine M1, 2
hours of machine M2 and I hour of machine M3. The profit contribution of products X and Y
are Rs.5/- and Rs.4/- respectively. Formulate the above as a linear programming model.

Solution:

let x is the number of unit of X Product and y is the number of unit of Y product.

Maximization, Z=5x+4y →Objective Function

For Machine M1; 0x+2y≤50


For Machine M2; 1x+2y≤25 and →Linear Structural Constraints
For Machine M3; 1x+1y≤15

Both x and y are ≥0 →Non-Negativity Constraints


Example-02
A tailor has the following materials available. 16 square meters of cotton. 11 square meters
of silk and 15 square meters of wool. He can make out two products from these three
materials. Namely dress and suite. A dress requires the following. 2 square meters of
cotton. 1 square meter of silk and 1 square meter of wool. A suite requires 1 square meter
of cotton. 2 square meters of silk and 3 square meters of wool. If the gross profit realized
from a dress and as suite is respective 30 and 50. Formulate the above as a linear
programming model.

Solution:

Maximization, Z=30x+50y

Condition
2x+y ≤ 16
x+2y ≤ 11
x+3y ≤ 15
x, y ≥ 0
Example-03

Solution:
Maximization, Z=4x+3y+6z
2x+3y+2z ≤ 440
4x+3z ≤ 470
2x+5y+ ≤ 430
x, y, z ≥ 0
Graphical Solution of a LP Problem:-

To solve LP problem with two (sometimes three) variables are consists of two phases:
 Findings the values of the decision variables for which all the constraints are met
(feasible region)
 Determine the optimal solution from all the points in the feasible region

Example-04
A carpenter makes tables and chairs. Each table can be sold for a profit of £30 and each
chair for a profit of £10. The carpenter can afford to spend up to 40 hours per week
working and takes 6 hours to make a table and 3 hours to make a chair. Customer
demand requires that he makes at least 3 times as many chairs as tables. Tables take up
4 times as much storage space as chairs and there is room for at most 4 tables each
week.
Formulate this problem as a linear programming problem and solve it graphically.
Solution
Variables
Let
xT = number of tables made per week
xC = number of chairs made per week
Constraints
total work time
6xT + 3xC ≤40
customer demand
xC ≥ 3xT
storage space
(xC/4) + xT ≤ 4
all variables ≥ 0
Objective
Maximization, 30xT + 10xC
The graphical representation of the problem is given below and from that we have that
the solution lies at the intersection of
(xC/4) + xT = 4 and 6xT + 3xC = 40
Solving these two equations simultaneously we get xT = 1.333, xC = 10.667 and the
corresponding profit = £146.667
*Thank You *

You might also like