Sei sulla pagina 1di 52

LINEAR

PROGRAMMING:
GRAPHICAL METHOD

Aguila, Mary Rose D.


Alvar, Gladies Mae L.
Cabral, Daisy Anne M.
ChE 5201
Linear programming is a widely
used mathematical modeling technique to
determine the optimum allocation of scarce
resources among competing demands.

Resources typically include raw


materials, manpower, machinery, time,
money and space.
The linear programming model
consists of linear objectives and linear
constraints, which means that the
variables in a model have a
proportionate relationship
Essentials of Linear
Programming Model
Limited resources - limited number of
labour, material equipment and finance
Objective - refers to the aim to optimize
(maximize the profits or minimize the costs)
Linearity - increase in labour input will have
a proportionate increase in output
Homogeneity - the products, workers'
efficiency, and machines are assumed to be
identical
Divisibility - it is assumed that resources
and products can be divided into fractions
Properties of Linear
Programming Model
1. Relationship among decision
variables must be linear in nature.

2. A model must have an objective


function.

3. Resource constraints are essential.

4. A model must have a non-negativity


constraint.
Formulation of Linear
Programming

It is the representation of problem


situation in a mathematical form. It
involves well defined decision
variables, with an objective function
and set of constraints.
Objective function
It represents the aim or goal of the
system (i.e., decision variables)
which has to be determined from
the problem
For example, assume that a furniture
manufacturer produces tables and chairs. If
the manufacturer wants to maximize his
profits, he has to determine the optimal
quantity of tables and chairs to be produced
Let x1 = Optimal production of tables
p1 = Profit from each table sold
x2 = Optimal production of chairs
p2 = Profit from each chair sold.
Total profit from tables = p1 x1
Total profit from chairs = p2 x2

Objective function
Maximize Z or Zmax = p1 x1 + p2 x2
Constraints

Organizations normally have scarce


resources within which the job has to
be performed in the most effective
way. Therefore, problem situations are
within confined limits in which the
optimal solution to the problem must
be found.
Considering the previous example of
furniture manufacturer, let w be the amount
of wood available to produce tables and
chairs. Each unit of table consumes w1 unit
of wood and each unit of chair consumes w2
units of wood.
For the constraint of raw material
availability, the mathematical expression is,
w1 x1 + w2 x2 w

In addition to raw material, if other


resources such as labour, machinery and
time are also considered as constraint
equations
Non-negativity
constraint
Negative values of physical
quantities are impossible, like
producing negative number of
chairs, tables, etc., so it is
necessary to include the element of
non-negativity as a constraint i.e.,
x 1 , x2 0
Maximization &
Minimization Models
Example 1: A biscuit manufacturing company
plans to produce two types of biscuits, one with a
round shape and another with a square shape. The
following resources are used in manufacturing the
biscuits,
(i) Raw material, of which daily
availability is 150 kg.
(ii) Machinery, of which daily availability
is 25 machine hours.
(iii) Labour, of which daily availability is
40 man-hours.
The resources used are shown in Table
1. If the unit profit of round and square
biscuits is Rs 3.00 and Rs 2.00
respectively, how many round and
square biscuits should be produced to
Table 1
Resourc Requirement/Unit Daily
es Availabil
ity
Round Square
Raw 100 115 1500 g
Material
Machine 10 12 720 min
Manpowe 3 2 240 min
r
Solution for Example 1:
Key Decision:
To determine the number of round and square
biscuits to be produced.

Decision Variables:
Let :
X1 be the number of round biscuits to be
produced daily,
X2 be the number of square biscuits to be
produced daily
Objective function:

It is given that the profit on each unit of


round biscuits is
Rs 3.00 and of square biscuits is Rs. 2.00.

The objective is to maximize profits,


therefore, the total profit will be given by the
equation,
Zmax = 3X1 +2X2
Constraints:

constraint for raw material:

constraint for machine hours:

constraint for the manpower:

Non-negativity Constraints:
Maximization &
Minimization Models
Example 2: Rahul Ads, an advertising company
is planning a promotional campaign for the
client's product, i.e., sunglasses. The client is
willing to spend Rs. 5 lakhs. It was decided to
limit the campaign media to a weekly
magazine, a daily newspaper and TV
advertisement. The product is targeted at
middle-aged men and women, and the following
The client is interested to spend only Rs. 1
data was collected (Table 2).
lakh on the ads in the weekly magazine which
expecting a viewership of a minimum of 21 lakh
people in the case of the television advertising.
Maximize the viewers to the advertisements.
Table 2

Campaign Cost per Expected


media advertisemen viewers
t (Rs.)
Weekly 30,000 115,000
Magazine
Daily 45,000 205,000
Newspaper
TV 125,000 700,000
Advertisement
Solution for Example 2:
Key Decision:
To determine number of advertisements on
weekly magazine, daily newspaper and TV.
Decision Variables:
Let :
X1 the number of weekly magazine
advertisements,
X2 the number of daily newspaper
advertisements,
X the number of TV advertisements
Objective function:

The objective is to maximize the number of


viewers through all media. The total viewers
will be given by the equation,
Constraints:

the client is willing to spend Rs. 500000 on all

a minimum of 2100000 people should view


the television advertising:

client is interested to pay only Rs. 100000


in weekly magazine advertising:

Non-negativity Constraints:
Example 3:

An agricultural urea company must daily


produce 500 kg of a mixture consisting of
ingredients x1, x2 and x3. Ingredient x1 costs
Rs. 30 per kg, x2 Rs. 50 per kg and x3 Rs. 20
per kg. Due to raw material constraint, not
more than 100 kg of x1, 70 kg of x2 and 45
kg of x3 must be used. Determine how much
of each ingredient should be used if the
company wants to minimize the cost.
Solution for Example 3:
Key Decision:
To determine the amount of each ingredient to
be used

Decision Variables:
Let :
X1 be the kg of ingredient x1 to be used
X2 be the kg of ingredient x2 to be used
X3 be the kg of ingredient x3 to be used
Objective function:

The objective is to minimize the cost :


Constraints:

total production:

max. use of x1:

max. use of x2:

max. use of x3:

Non-negativity Constraints:
GRAPHICAL METHOD

Linear programming problems with two


variables can be represented and solved
graphically with ease. Though in real-life, the
two variable problems are practiced very little,
the interpretation of this method will help to
understand the simplex method
Steps in Graphical
Method
Step 1: Convert the inequality constraint as
equations and find co-ordinates of the line.
Step 2: Plot the lines on the graph. (Note: If
the constraint is type, then the solution
zone lies away from the centre. If the
constraint is type, then solution zone is
towards the centre.)
Step 3: Obtain the feasible zone.
Step 4: Find the co-ordinates of the objectives
function (profit line) and plot it on the graph
representing it with a dotted line
Steps in Graphical
Method

Step 5: Locate the solution point.


(Note: If the given problem is
maximization, zmax then locate the
solution point at the far most point of
the feasible zone from the origin and
if minimization, Zmin then locate the
solution at the shortest point of the
solution zone from the origin).
Steps in Graphical
Method

Step 6: Solution type


i. If the solution point is a single point on the
line, take the corresponding values of x1 and
x2.
ii. If the solution point lies at the intersection of
two equations, then solve for x1 and x2 using
the two equations.
iii. If the solution appears as a small line, then a
multiple solution exists.
iv. If the solution has no confined boundary, the
solution is said to be an unbound solution
Example 4:

A company manufactures two types of boxes,


corrugated and ordinary cartons. The boxes
undergo two major processes: cutting and
pinning operations. The profits per unit are
Rs. 6 and Rs. 4 respectively. Each corrugated
box requires 2 minutes for cutting and 2
minutes for pinning operation, whereas each
carton box requires 3 minutes for cutting and
1 minute for pinning. The available operating
time is 120 minutes and 60 minutes for
cutting and pinning machines. Determine the
optimum quantities of the two boxes to
Solution for Example 4:
Key Decision:
To determine the number of corrugated and
carton box to be manufactured.
Decision Variables:
Let :
X1 be the number of corrugated boxes to be
manufactured
X2 be the number of carton boxes to be
manufactured
PROFIT CUTTIN PINNING
(Rs) G (min)
(min)
Corrugated
6 2 2
boxes

Carton
4 3 1
boxes
AVAILABILI
TY 120 60
(min)
Objective function:

The objective is to maximize the profits.


Given profits on corrugated box and carton
box are Rs. 6 and Rs. 4 respectively.
Constraints:
The available machine-hours for each mac

Non-negativity Constraints:
1. Remove the inequality constraints:

2. Find the co-ordinates of the lines:

For line 2x1 + 3x2 = 120 : (0, 40) and


(60, 0)
For line 2x1 + x2 = 60 : (0,60) and
(30,0)
3. The lines are drawn on a graph with
horizontal and vertical axis representing
boxes x1 and x2 respectively.
4. Equate the objective function for any
specific profit value Z. Consider a Z-value of
60, i.e.,

Substituting x1 = 0, we get x2 = 15 and if x2


= 0, then x1 = 10.

Co-ordinates of the objective function line :


(0,15) and (10,0)
5. The objective function line does not give
the maximum profit because the furthermost
point of the feasible area lies above the
objective function line.

Move the line (parallel to objective function


line) away from the origin to locate the
furthermost point.

The point P, is the furthermost point, since no


area is seen further.
6. Take the corresponding values of x1 and x2
from point P, which is 15 and 30 respectively,
and are the optimum feasible values of x1
and x2.
Therefore, we conclude that to maximize
profit, 15 numbers of corrugated boxes and
30 numbers of carton boxes should be
produced to get a maximum profit.

Substituting:
x1 = 15 and x2= 30 in objective function, we
get

Maximum profit : Rs. 210.00


SOLUTION FOR EXAMPLE 4
(summary)
Objective function:

Constraints:

For line 2x1 + 3x2 = 120 : (0, 40) and


(60, 0)
For line 2x1 + x2 = 60 : (0,60) and
(30,0)
NOTE for constraints:
type : solution zone lies away from the
centre
type : solution zone is towards the centre
Points where Test for optimality
feasible region lie using the points
(0,40) 6(0) + 4(40) = 160
(30,0) 6(30) + 4(0) = 180
(15,30) 6(15) + 4(30) = 210

We conclude that 15 corrugated boxes


and 30 carton boxes will give the
maximum profit of Rs. 210.
Example 5:

A small generator burns two types of fuel ,


low sulfur and high sulfur to produce
electricity. For one hour, each gallon of low
sulfur emits 3 units of SO2 generates 4 kW
electricity and costs Php 160. Each gallon of
high sulfur emits 5 units of SO2 generates 4
kW and costs Php 150. The Environmental
Protection Agency insists that the maximum
amount of SO2 that can be emitted per hour
is 15 units. Suppose that at least 16 kW ust
be generated per hour, how many gallons of
high sulfur and low sulfur must be utilized per
Solution for Example 5:
Key Decision:
To determine how many gallons of high sulfur
and low sulfur must be utilized per hour
Decision Variables:
Let :
X be the number of gallons of low sulfur
Y be the number of gallons of high sulfur
UNITS NO. OF COST
OF SO2 KILOWAT
TS

Low
3X 4X 160X
Sulfur

High
5Y 4Y 150Y
Sulfur

CONSTRAI
NTS
15 16
SOLUTION FOR
EXAMPLE 5
Objective function:

Zmin = 160x +
150y
Constraints: Non-negativity
3x + 5y 15 Constraints:
x, y 0
4x + 4y 16

For line 3x + 5y = 15 : (0,3) and (5,0)


For line 4x + 4y = 16 : (0,4) and (4,0)
NOTE for constraints:
type : solution zone lies away from the
centre
type : solution zone is towards the centre
Points where Test for optimality
feasible region lie using the points
(4,0) 160(4) + 150(0) =
640
(5,0) 160(5) + 150(0) =
800
(2.5,1.5) 160(2.5) + 150(1.5)
We conclude that 2.5 gallons
= 625of low
sulfur and 1.5 gallons of high sulfur
will give the minimum cost of Php
625.
Exercise No.1

1. Hazels garment, Inc. produces two styles of


jeans, style A and B. Raw materials available
for these two styles of jeans are 90m and
manufacturing time is 78 hours weekly. Style
A requires 2m and 2 hours to finish while Style
B needs 3m and 2 hours. The market has
surveyed and the marketing manager feels
that no more than 45 units minimum of Style
A can be sold weekly. If the contribution to
profit of each of Style A and B are Php60 and
Php50 respectively, how many units (A and B)
Exercise No.2
2. A housewife was advised by a doctor
that her husband should eat a minimum
amount of of fat. The housewife should
eat lean meat. The cost of the beef
Php100 per kilo and has 90% lean and
10% fat. The cost of the pork is Php75
per kilo and has 70% lean meat and 30%
fat. The husbands monthly requirement
is at least 6 kilos lean meat and the
housewifes requirement is at least 2
kilos fat. How much beef and pork should
Exercise No.3

3. A calculator company produces a scientific


calculator and a graphing calculator. Long-term
projections indicate an expected demand of at
least100scientific and80graphing calculators
each day. Because of limitations on production
capacity, no more than200 scientific
and170graphing calculators can be made
daily. To satisfy a shipping contract, a total of at
least200calculators much be shipped each
day. If each scientific calculator sold results in
a$2loss, but each graphing calculator
Exercise No.4

4. The National Dog Food Corp. wants to


mix 5000lb of special dog food. There
are two principal ingredients in the
mixture, both sources of protein, x1 and
x2. The first source of protein which is x1
is Php30/lb and the second, x2, costs
Php60/lb. Chemical constraints dictate
that the mixture contains not more than
4000lb of x1 and must contain at least
2000lb of x2. How many pounds of each

Potrebbero piacerti anche