Republic of the Philippines

Cagayan State University

Carig Campus
COLLEGE OF ENGINEERING
CSU Vision

Transforming

lives by Educating
LINEAR PROGRAMMING
for the BEST.

CSU Mission

CSU is committed
to transform the
lives of people and
communities
In partial fulfilment for the requirements of the course
through high Quantitative Methods in Management
quality instruction
(ChE 79)
and innovative
research,
development,
production and
extension. By:
ALLAM, ANA-MARIE P.

CSU – IGA
Competence

Social Responsibility

Unifying Presence

COE – IGA
Innovative Thinking

Synthesis

Personal Responsibility

Empathy February 2020

Research Skill

Entrepreneurial Skill
Problem 1

A manufacturing produces two types of models M 1 and M2. Each model of the type M1
requires 4 hours of grinding and 2 hours of polishing; whereas each model of M 2
requires 2 hours of grinding and 5 hours of polishing. The manufacturer has 2 grinders
and 3 polishers. Each grinder works for 40 hours a week and each polisher works 60
hours a week. Profit on M1 model is $3.00 and on model M 2 is $4.00. Whatever
produced in a week is sold in the market. How should the manufacturer allocate his
production capacity to the two types of models, so that he makes maximum profit in a
week?

Solution:

Maximize: Z=3 x 1 +4 x 2

Subject to Constraints

4x 1 + 2x 2 ≤80 Grinding Constraint

2x 1 + 5x2 ≤180 Polishing Constraint

x1 , x 2 ≥0

Objective Constan
Variable Solution Constraints
Function t
M1=X1 2.5 80 80
147.5 M2=X2 35 180 180
2.5 0
35 0

Graph:
Sensitivity Analysis:

Variable Cells
Reduce Allowabl Allowabl
    Final d Objective e e
Valu Coefficie
Cell Name e Cost nt Increase Decrease
$C$
2 M1=X1 Solution 2.5 0 3 5 1.4
$C$
3 M2=X2 Solution 35 0 4 3.5 2.5

Constraints
Constrain Allowabl Allowabl
    Final Shadow t e e
Valu
Cell Name e Price R.H. Side Increase Decrease
$D$
2 M1=X1 Constraints 80 0.4375 80 280 8
$D$ M2=X2
3 Constraints 180 0.625 180 20 140
$D$
4 Constraints 2.5 0 0 2.5 1E+30
 $D$
5 Constraints 35 0 0 35 1E+30

Conclusion: For a maximum profit of $147.5, model 1 must have 2.5 units which is
approximately equal to 3 units and model 2 must have 35 units.

Problem 2

A firm is engaged in producing two products A and B. Each unit of product A requires 2
kg of raw material and 4 labor hours of processing, whereas each unit of B requires 3 kg
of raw materials and 3 labor hours for the same type. Each week, the firm has an
availability of 60 kg of raw material and 96 labor hours. One unit of product A sold yield
$40 and one unit of product B sold gives $35 a profit.

Formulate this as a Linear Programming Problem to determine as to how many units

each of the products should be produced per week so that the firm can earn maximum
profit.

Solution:

Maximize: Z=40 x 1 +35 x2

Subject to Constraints

2x 1 + 3x2 ≤60 Raw Material Constraint

4x 1 + 3x 2 ≤96 Labor Hour’s Constraint

x1 , x 2 ≥0

Objective Constan
Variable Solution Constraints
Function t
A=X1 18 60 60
1000 B=X2 8 96 96
18 0
8 0

Graph:
 Sensitivity Analysis:

Variable Cells
    Final Reduced Objective Allowable Allowable
Valu Coefficien
Cell Name e Cost t Increase Decrease
$C$8 A=X1 Solution 18 0 40 6.666666667 16.66666667
$C$9 B=X2 Solution 8 0 35 25 5

Constraints
Constrain
    Final Shadow t Allowable Allowable
Valu
Cell Name e Price R.H. Side Increase Decrease
$D$1
0 Constraints 18 0 0 18 1E+30
$D$11 Constraints 8 0 0 8 1E+30
A=X1
$D$8 Constraints 60 3.333333333 60 36 12
B=X2
$D$9 Constraints 96 8.333333333 96 24 36

Conclusion: For a maximum profit of $1,000, product A must have 18 units and product
B must have 8 units.
Problem 3

The agricultural research institute suggested the farmer to spread out at least 4800 kg of
special phosphate fertilizer and not less than 7200 kg of a special nitrogen fertilizer to
raise the productivity of crops in his fields. There are two sources of obtaining these-
mixtures A and mixtures B. Both of these are available in bags weighing 100 kg each and
they cost $40 and $24 respectively. Mixture A contains phosphate and nitrogen
equivalent of 20 kg and 80 kg respectively, while mixture B contains these ingredients
equivalent of 50 kg each. Write this as an LPP and determine how many bags of each
type the farmer should buy in order to obtain the required fertilizer at minimum cost.

Solution:

Maximize: Z=40 x 1 + 24 x2

Subject to Constraints

2 0 x 1 + 50x2 ≥ 4800 Phosphate Requirement Constraint

80x 1 + 50x2 ≥7200 Nitrogen Requirement Constraint

x1 , x 2 ≥0

Objective Constan
Variable Solution Constraints
Function t
A=X1 0 7200 4800
3456 B=X2 144 7200 7200
0 0
144 0

Graph:
Sensitivity Analysis:

Variable Cells
Fina Reduc Objectiv Allowab Allowab
    l ed e le le
Valu Coefficie Increas Decreas
Cell Name e Cost nt e e
$C$1 A=X1
4 Solution 0 0 40 1E+30 1.6
$C$1 B=X2
5 Solution 144 0 24 1 24

Constraints
Fina Shado Constrai Allowab Allowab
    l w nt le le
Valu R.H. Increas Decreas
Cell Name e Price Side e e
A=X1
$D$1 Constrain
4 ts 7200 0 4800 2400 1E+30
B=X2
$D$1 Constrain
5 ts 7200 0.48 7200 1E+30 2400
$D$1 Constrain
6 ts 0 1.6 0 40 0
$D$1 Constrain 144 0 0 144 1E+30
 7 ts

Conclusion: For a minimum cost of $3,456, fertilizer A must have 0 bags fertilizer B
must have 144 bags.

Problem 4

A firm can produce 3 types of cloth A, B and C. Three kinds of wool are required Red,
Green and Blue. One unit of length of type A cloth needs 2 meters of red wool and 3
meters of blue wool. One unit of length of type B cloth needs 3 meters of red wool, 2
meters of green wool and 2 meters of blue wool. One-unit type of cloth needs 5 meters of
green wool and 4 meters of blue wool. The firm has a stock of 8 meters of re, 10 meters
of green and 15 meters of blue. It is assumed that the income obtained from 1 unit of
type A is $3, from B is $5 and from C is $4. Formulate this as an LPP.

Solution:

Maximize: Z=3 x 1 + 5x2 + 4x3

Subject to Constraints

2x 1 + 3x2 ≤ 8

2x 2 + 5x3 ≥10

3x 1 + 2x2 + 4x3 ≤ 15

x1 , x 2 , x3 ≥0

Objective
Variable Solution Constraints Constant
Function
A=X1 2.170731707 8 8
18.65853659 B=X2 1.219512195 10 10
C=X3 1.512195122 15 15
2.170731707 0
1.219512195 0
1.512195122 0

Graph:
 Sensitivity Analysis:

Variable Cells
    Final Reduced Objective Allowable Allowable
Coefficien
Cell Name Value Cost t Increase Decrease
2.17073170 0.73333333
$C$20 A=X1 Solution 7 0 3 2 3
$C$21 B=X2 Solution 1.219512195 0 5 1.1 3
$C$22 C=X3 Solution 1.512195122 0 4 7.5 2.75

Constraints
Constrain
    Final Shadow t Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$2 A=X1 10.3333333 3.33333333
0 Constraints 8 1.097560976 8 3 3
B=X2 7.41666666
$D$21 Constraints 10 0.585365854 10 7 6.25
$D$2 C=X3 0.26829268 5.93333333
2 Constraints 15 3 15 5 3
$D$2 2.17073170
3 Constraints 7 0 0 2.170731707 1E+30
$D$2
4 Constraints 1.219512195 0 0 1.219512195 1E+30
$D$25 Constraints 1.512195122 0 0 1.512195122 1E+30

Conclusion: For a maximum profit of $18.64, the firm must produce 2.17 or
approximately 3 units of type A cloth, 1.22 or approximately 2 units of type B cloth
and1.51 or approximately 2 units of type C cloth .
Problem 5

A retired person wants to invest up to an amount of $30,000 in fixed income securities.

His broker recommends investing in two Bonds: Bond A yielding 7% and Bond B
yielding 10%. After some consideration, he decides to invest at most of $12,000 in Bond
B and at least $6,000 in Bond A. He also wants the amount invested in Bond A to be at
least equal to the amount invested in Bond B. Formulate this as an LPP.

Solution:

Maximize: Z=0.07 x 1 + 0.1x 2

Subject to Constraints

x1 + x 2 ≤ 30,000

x1 ≥6 ,000

x2 ≤12,000

x1 , x 2 ≥0

Objective Constan
Variable Solution Constraints
Function t
A=X1 18000 30000 30000
2460 B=X2 12000 18000 6000
12000 12000
18000 0
12000 0

Graph:
Sensitivity Analysis:

Variable Cells
Fina Reduce Allowab Allowabl
    l d Objective le e
Valu Coefficie Decreas
Cell Name e Cost nt Increase e
$C$2 A=X1 1800
8 Solution 0 0 0.07 0.03 0.07
$C$2 B=X2 1200
9 Solution 0 0 0.1 1E+30 0.03

Constraints
Fina Shado Constrai Allowab Allowabl
    l w nt le e
Valu Decreas
Cell Name e Price R.H. Side Increase e
A=X1
$D$2 Constraint 3000
8 s 0 0.07 30000 1E+30 12000
B=X2
$D$2 Constraint 1800
9 s 0 0 6000 12000 1E+30
$D$3 Constraint 1200
0 s 0 0.03 12000 12000 12000
$D$3 Constraint 1800
1 s 0 0 0 18000 1E+30
 $D$3 Constraint 1200
2 s 0 0 0 12000 1E+30

Conclusion: For a maximum profit of $2,460, the retired person must invest $18,000 on
Bond A and $12,000 on Bond B.

Problem 6

A person requires 10, 12, and 12 units chemicals A,B and C respectively for his garden. A
liquid product contains 5, 2 and 1 units of A, B and C respectively per jar. A dry product
contains 1,2 and 4 units of A, B and C per carton.

If the liquid product sells for $3 per jar and the dry product sells for $2 per carton, how
many of each should be purchased, in order to minimize the cost and meet the
requirements?

Solution:

Maximize: Z=3 x 1 + 2x 2

Subject to Constraints

5 x 1 + x2 ≥10

2x 1 + 2x2 ≥12

x1 +4x2 ≥12

x1 , x 2 ≥0

Objective Constan
Variable Solution Constraints
Function t
Liquid=X1 12 60 10
36 Dry=X2 0 48 12
12 12
12 0
0 0

Graph:
Sensitivity Analysis:

Variable Cells
Fina Reduce Allowabl Allowabl
    l d Objective e e
Valu Coefficie
Cell Name e Cost nt Increase Decrease
$C$3 Liquid=X1
5 Solution 3 0 3 1E+30 2.5
$C$3 Dry=X2
6 Solution 2.25 0 2 10 2

Constraints
Fina Shado Constrai Allowabl Allowabl
    l w nt e e
Valu
Cell Name e Price R.H. Side Increase Decrease
$D$3 Liquid=X1
5 Constraints 17.25 0 10 7.25 1E+30
$D$3 Dry=X2 6.10526315
6 Constraints 12 0.625 12 36 8
$D$3
7 Constraints 12 0.5 12 1E+30 9
$D$3 Constraints 3 0 0 3 1E+30
 8
$D$3
9 Constraints 2.25 0 0 2.25 1E+30

Conclusion: To minimize cost and to meet requirement, the person must purchased 12
liquid products.

Problem 7

A scrap metal dealer has received a bulk order from a customer for a supply of at least
2000 kg of scrap metal. The consumer has specified that at least 1000 kg of the order
must be high quality copper that can be melted easily and can be used to produce tubes.
Further, the customer has specified that the order should not contain more than 200 kg
of scrap which are unfit for commercial purposed. The scrap metal dealer purchased the
scrap from two different sources in an unlimited quantity with the following percentages
(by weight) of high quality of copper and unfit scrap.

Source A Source B
Copper 40% 75%
Unfit Scrap 7.5% 10%

The cost of metal purchased from source A and source B are $12.50 and $14.50 per kg
respectively. Determine the optimum quantities of metal to be purchased from the two
sources by the metal scrap dealer so as to minimize the total cost.

Solution:

Maximize: Z=12.5 x 1 + 14.5x2

Subject to Constraints

x1 + x 2 ≥ 2,000

0.4x 1 + 0.75x 2 ≥1,000

0.075x 1 +0.1x 2 ≤2,000

x1 , x 2 ≥0

Constan
Objective Variable Solution Constraints
t
Function
A=X1 1500 2000 2000
26000 B=X2 500 1000 1000
162.5 200
 1500 0
500 0

Graph:

Sensitivity Analysis:

Variable Cells
Reduce Allowabl Allowabl
    Final d Objective e e
Valu Coefficien
Cell Name e Cost t Increase Decrease
$C$4 A=X1
2 Solution 1500 0 12.5 2 12.5
$C$4 B=X2
3 Solution 500 0 14.5 1E+30 2

Constraints
Constrain Allowabl Allowabl
    Final Shadow t e e
Valu
Cell Name e Price R.H. Side Increase Decrease
$D$4 A=X1
2 Constraints 2000 12.5 2000 500 1500
$D$4 B=X2
3 Constraints 1000 1 1000 3000 1000
 $D$4
4 Constraints 162.5 0 200 1E+30 37.5
$D$4
5 Constraints 1500 0 0 1500 1E+30
$D$4
6 Constraints 500 0 0 500 1E+30

Conclusion: Optimum quantities of metal to be purchased must be 1500 units for source
A metal scrap dealer and 500 units for source B metal scrap dealer to minimize the total
cost.

Problem 8

A farmer has a 100-acre farm. He can sell all tomatoes, lettuce or radishes and can raise
the price to obtain $1.00 per kg of tomatoes, $0.75 a head for lettuce and $2.00 per kg
for radishes. The average yield per acre is 2000 kg of tomatoes, 3000 heads of lettuce
and 1000 kg of radishes. Fertilizers are available at $0.50 per kg and the amount
required per acre is 100 kg for each tomatoes and lettuce and 50 kg for radishes. Labor
required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and
radishes and 6 man-days for lettuce. A total of 400 man-days of labor are available at
$20.00 per man-day. Formulate this problem as LP model to maximize the farmers
profit.

Solution:

Maximize: Z=1850 x 1 + 2080x2 +1875x 3

Subject to Constraints

x1 + x 2 + x 3 ≤ 100

5 x 1 + 6 x2 +5 x3 ≤ 400

x1 , x 2 , x3 ≥0

Objective Constan
Variable Solution Constraints
Function t
Tomatoes=X
0 80 100
1
150000 Lettuce=X2 0 400 400
Radishes=X3 80 0 0
0 0
80 0
 Graph:

Sensitivity Analysis:

Variable Cells
Reduce Allowabl
    Final d Objective Allowable e
Valu Coefficien
Cell Name e Cost t Increase Decrease
$C$4
9 Tomatoes=X1 Solution 0 0 1850 25 1E+30
$C$5
0 Lettuce=X2 Solution 0 0 2080 170 1E+30
$C$51 Radishes=X3 Solution 80 0 1875 1E+30 25

Constraints
Constrain Allowabl
    Final Shadow t Allowable e
Valu
Cell Name e Price R.H. Side Increase Decrease
$D$4
9 Tomatoes=X1 Constraints 80 0 100 1E+30 20
$D$5
0 Lettuce=X2 Constraints 400 375 400 100 400
$D$5
1 Radishes=X3 Constraints 0 -25 0 80 0
$D$5
2 Constraints 0 -170 0 66.66666667 0
$D$5
3 Constraints 80 0 0 80 1E+30

Conclusion: For a maximum profit of $150,000, the farmer must plant radishes to an 80
acre.

Problem 9

An electronics company produces three types of parts for automatic washing machines.
It purchases casting of the parts from a local foundry and then finishes the part on
drilling, shaping and polishing machines. The selling prices of parts A, B and C
respectively are $8, $10 and $14. All parts made can be sold. Castings for parts A, B and
C respectively cost $5, $6 and $10.

The shop possesses only one of each type of machine. Costs per hour to run each of the
three machines are $20 for drilling, $30 for shaping and $30 for polishing. The
capacities (parts per hour) for each part on each machine are shown in the following
table.

Capacities Per Hour

Machine
Part A Part B Part C

Drilling 25 40 25

Shaping 25 20 20

Polishing 40 30 40

The management of the shop wants to know how many parts of each type it should
produce per hour in order to maximize profit for an hour’s run. Formulate this problem
as an LP model so as to maximize total profit to the company.

Solution:

Maximize: Z=0.25 x 1 + 1x2 +0.95x 3

Subject to Constraints

x1 /25 + x 2 /40+ x 3 /24≤ 1

x1 /25 + x 2 /20+ x 3 /20≤ 1

x1 /40 + x 2 /30+ x 3 /40≤ 1

x1 , x 2 , x3 ≥0

Objective Constan
Variable Solution Constraints
Function t
A=X1 0 0.5 1
20 B=X2 20 1 1
C=X3 0 0.666666667 1
0 0
20 0
0 0

Graph:
 Sensitivity Analysis:

Variable Cells
Reduce Allowabl
    Final d Objective e Allowable
Coefficien
Cell Name Value Cost t Increase Decrease
$C$56 A=X1 Solution 0 0 0.25 0.55 1E+30
$C$57 B=X2 Solution 20 0 1 1E+30 0.05
$C$5
8 C=X3 Solution 0 0 0.95 0.05 1E+30

Constraints
Constrain Allowabl
    Final Shadow t e Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$5
6 A=X1 Constraints 0.5 0 1 1E+30 0.5
$D$5 B=X2
7 Constraints 1 20 1 0.5 1
$D$5 C=X3
8 Constraints 0.666666667 0 1 1E+30 0.333333333
$D$5
9 Constraints 0 -0.55 0 25 0
$D$6
0 Constraints 20 0 0 20 1E+30
$D$61 Constraints 0 -0.05 0 20 0

Conclusion: For a maximum profit of $20 per hour, the electronics company must
produce 20 units of parts B and none for parts A and C.
Problem 10

A city hospital has the following minimal daily requirements for nurses.

Minimum number of
Period Clock time (24 hours day)
nurses required

1 6 a.m. – 10 a.m. 2

2 10 a.m. – 2 p.m. 7

3 2 p.m. – 6 p.m. 15

4 6 p.m. – 10 p.m. 8

5 10 p.m. – 2 a.m. 20

6 2 a.m. – 6 a.m. 6
Nurses report at the hospital at the beginning of each period and work for 8 consecutive
hours. The hospital wants to determine the minimal number of nurses to be employed
so that there will be a sufficient number of nurses available for each period.

Formulate this as a linear programming problem by setting up appropriate constraints

and objective function.

Solution:

Maximize: Z=0.25 x 1 + 1x2 +0.95x 3

Subject to Constraints

x1 /25 + x 2 /40+ x 3 /24≤ 1

x1 /25 + x 2 /20+ x 3 /20≤ 1

x1 /40 + x 2 /30+ x 3 /40≤ 1

x1 , x 2 , x3 ≥0

Objective Variabl Solutio Constrain Consta

Function es n ts nt
37 Period 1 1 8.5 7
Period
  2 7.5 15 15
Period
  3 7.5 17.5 8
Period
  4 10 20 20
Period
  5 10 11 6
Period
  6 1 2 2
Graph:

Sensitive Analysis:

Variable Cells
Reduce Allowabl Allowabl
    Final d Objective e e
Valu Coefficie Decreas
Cell Name e Cost nt Increase e
$C$13:$C$18
 Constraints
Constrain Allowabl Allowabl
    Final Shadow t e e
Valu Decreas
Cell Name e Price R.H. Side Increase e
$D$1 Period 1
3 Constraint 7 0 7 2 5
$D$1 Period 2
4 Constraint 15 1 15 1E+30 2
$D$1 Period 3
5 Constraint 10 0 8 2 1E+30
$D$1 Period 4
6 Constraint 20 1 20 1E+30 14
$D$1 Period 5
7 Constraint 20 0 6 14 1E+30
$D$1 Period 6
8 Constraint 2 1 2 5 2

Conclusion: 1, 8, 8, 10, 10 and 1 nurse/s must be attending the period 1, 2, 3, 4, 5, 6, 7

and 8, respectively.