Scribd
Upload
31 views21 pages

Decision Math - LP Example

A factory produces two drinks and needs to plan daily production within ingredient constraints. The drinks require syrup, vitamins, and flavoring. The problem is formulated as a linear program to maximize profit. The constraints for each ingredient are written as inequalities and the objective is to maximize total income from drink sales. The optimal solution is found at the vertex where 400 liters of energy drink and 600 liters of refresher drink are produced for a maximum profit of £800.

Uploaded by

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

Decision Math - LP Example

A factory produces two drinks and needs to plan daily production within ingredient constraints. The drinks require syrup, vitamins, and flavoring. The problem is formulated as a linear program to maximize profit. The constraints for each ingredient are written as inequalities and the objective is to maximize total income from drink sales. The optimal solution is found at the vertex where 400 liters of energy drink and 600 liters of refresher drink are produced for a maximum profit of £800.

Uploaded by

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

Linear Programming : Introductory Example

THE PROBLEM

A factory produces two types of drink, an energy


drink and a refresher drink. The days output is
to be planned. Each drink requires syrup, vitamin
supplement and concentrated flavouring, as shown
in the table.
The last row in the table shows how much of each
ingredient is available for the days production.
How can the factory manager decide how much
of each drink to make?

THE PROBLEM

Syrup

Vitamin
supplement

Concentrated
flavouring

5 litres of
energy drink

1.25 litres

2 units

30 cc

5 litres of
refresher
drink

1.25 litres

1 unit

20 cc

Availabilities

250 litres

300 units

4.8 litres

Energy drink sells at 1 per litre


Refresher drink sells at 80 p per litre

FORMULATION

Syrup constraint:
Let x represent number of litres of energy drink
Let y represent number of litres of refresher drink
0.25x + 0.25y 250
x + y 1000

FORMULATION

Vitamin supplement constraint:


Let x represent number of litres of energy drink
Let y represent number of litres of refresher drink
0.4x + 0.2y 300
2x + y 1500

FORMULATION

Concentrated flavouring constraint:


Let x represent number of litres of energy drink
Let y represent number of litres of refresher drink
6x + 4y 4800
3x + 2y 2400

FORMULATION

Objective function:
Let x represent number of litres of energy drink
Energy drink sells for 1 per litre
Let y represent number of litres of refresher drink
Refresher drink sells for 80 pence per litre
Maximise

x + 0.8y

SOLUTION

Empty grid to
accommodate
the 3
inequalities

SOLUTION

1st constraint
Draw boundary
line:

x + y = 1000

x
0

y
1000

1000

SOLUTION

1st constraint
Shade out
unwanted
region:

x + y 1000

SOLUTION

Empty grid to
accommodate
the 3
inequalities

SOLUTION

2nd constraint
Draw boundary
line:
2x + y = 1500

1500

750

SOLUTION

2nd constraint
Shade out
unwanted
region:
2x + y 1500

SOLUTION

Empty grid to
accommodate
the 3
inequalities

SOLUTION

3rd constraint
Draw boundary
line:
3x + 2y = 2400

1200

800

SOLUTION

3rd constraint
Shade out
unwanted region:
3x + 2y 2400

SOLUTION

All three
constraints:
First:

x + y 1000

SOLUTION

All three
constraints:
First:

x + y 1000
Second:
2x + y 1500

SOLUTION

All three
constraints:
First:

x + y 1000
Second:
2x + y 1500
Third:
3x + 2y 2400

SOLUTION

All three
constraints:
First:

x + y 1000
Second:
2x + y 1500
Third:
3x + 2y 2400
Adding:

x 0 and y 0

SOLUTION

Feasible region
is the unshaded
area and
satisfies:

x + y 1000
2x + y 1500
3x + 2y 2400

x 0 and y 0

SOLUTION

Evaluate the
objective function
x + 0.8y
at vertices of the
feasible region:

A
B

O: 0 + 0 = 0
A: 0 + 0.8x1000
= 800

C
D
O

B: 400 + 0.8x600
= 880
C: 600 + 0.8x300
= 840

Maximum income = 800 at (400, 600)

D: 750 + 0 = 750

You might also like