OPTIMIZATION TECHNIQUES-21PBDCT205

UNIT-I
1. A company has three operational departments(weaving, processing and packing) with capacity to
produce three different types of clothes namely suitings, shirtings and woolens yielding a profit of Rs.2,
Rs.4 and Rs.3 per metre respectively. One metre of suiting requires 3 minutes in weaving, 2 minutes in
processing and 1 minute in packing. Similarly one metre of shirting requires 4 minutes in weaving,
1 minute in processing and 3 minutes in packing. onemetre of woolen requires 3 minutes in each
department. In a week, total run time of each department is 60, 40 and 80hours for weaving, processing
and packing respectively. Formulate the linear programming problem to find the product mix to
maximize the profit.

Solution:

Departments Profit (Rs. Per

Weaving processing Packing metre)
Suitings 3 2 1 2
Shirtings 4 1 3 4
Woolens 3 3 3 3
Availibility 60*60 40*60 80*60
(minutes)

Maximize Z = 2x 1+4x2+3x3

Subject to constraints

3x1+4x2+3x3≤3600

2x 1+x2+3x3≤2400

X 1+3x2+3x3≤4800, x1,x2,x3≥0.

2. Consider the following problem faced by a production planner in a soft drink plant. He has two
bottling machines A and B. A is designed for 8-ounce bottles and B for 16-ounce bottles. However, each
can be used on both types with some loss of efficiency. The following data is available:

Machine 8-ounce bottles 16-ounce bottles

A 100/Minute 40/Minute
B 60/Minute 75/Minute
Each machine can be run 8-hours per day, 5days per week. Profit on a 8-ounce bottle is 25 paise and on
a 16-ounce bottle is 35 paise. Weekly production of the drink cannot exceed 3,00,000 ounces and the
market can absorb 25,000 8-ounce bottles and 7,000 16-ounce bottles per week. The planner wishes
to maximize his profit subject, of course, to all the production and marketing restrictions. Formulate this
as a linear programming problem.

Solution:
 1-ounce=28.34grams

Resource/ Production Availability

Constraint 8-ounce 16-ounce
bottles bottles
Machine A 100/Minute 40/Minute 8*5*60=2400 minutes
Machine B 60/Minute 75/Minute 8*5*60=2400 minutes
Production 1 1 3,00,000 ounces/week
Marketing 1 -- 25,000 units/week
-- 1 7,000 units/week
Profit(Rs.) 0.25 0.35

An 8-ounce bottle takes 1/100 minutes on Machine A and 1/60 minutes on Machine B
An 16-ounce bottle takes 1/40 minutes on Machine A and 1/75 minutes on Machine B.
x1 x2
+ ≤2 , 400
100 40 (Machine A)
40 x 1 +100 x 2
≤2, 400
4000 (Machine A)
40 x 1 +100 x 2≤96 , 00 ,000 (÷ by 10)

4 x 1 +10 x 2 ≤9 , 60 , 000

x1 x2
+ ≤2 , 400
60 75 (Machine B)

75 x1 +60 x 2 ≤1 , 08 ,00 , 000 (÷ by 5)

15 x1 +12 x 2 ≤21 ,60 , 000

Maximize Z =0 .25 x 1 +0 . 35 x 2
S .T . C
4 x 1 +10 x 2≤9 , 60 , 000
15 x 1 +12 x 2≤21, 60 , 000
8 x1 +16 x2 ≤3 , 00 , 000
x 1≤25 , 000 and x 2 ≤7 , 000 ∧ x 1 , x2 ≥0 .

3. An electronic company is engaged in the production of two components C1 and C2 used in T.V. sets.
Each unit of C1 costs the company Rs.25 in wages and Rs.25 in material, While each unit of C2 costs the
company Rs.125 in wages and Rs.75 in material. The company sells both products on 1-period credits
terms, but the company’s labour and material expenses must be paid in cash. The selling price of C1 is
Rs.150 per unit and of C2 is Rs.350 per unit. Because of the strong monopoly of the company for these
components, it is assumed that the company can sell at the prevailing prices as many units as it
produces. The company’s production capacity is, however, limited by two considerations. First, at the
beginning of period 1, the company has an initial balance of Rs.20,000. Second, the company has
available in each period 4,000 hours of machine time and 2,800 hours of assembly time. The production
of each C1 requires 6 hours of machine time and 4 hours of assembly time, whereas the production of
each C2 requires 4 hours of machine time and 6 hours of assembly time. Formulate this problem as
anlinear programming model so as to maximize the total profit to the company.

Solution:

Resource Components Total

C1 C2 Availability
Machine time(hrs) 6 4 4,000hrs
Assembly time(hrs) 4 6 2,800hrs
Budget(Rs.) 50 200 Rs.20,000
Selling Price(Rs.) 150 350
Cost Price (25+25) (125+75)
(Wages+Material)

The objective is to maximize the total profit from the sale of two type of components. Assuming
that whatever is produced is sold in the market, the total profit is given by the relation

Z=(150-50)x1+(350-200)x2 (or) Z=100x1+150x2

Maximize Z=100x1+150x2

S.T.C

6x1+4x2≤4,000

4x1+6x2≤2,800

50x1+200x2≤20,000 and x1,x2≥0

4. The manager of an oil refinery must decide on the optimum mix of two possible blending processes of
which the input and output production runs are as follows:

Input Output
Process
Crude A Crude B Gasoline X Gasoline Y
1 6 4 6 9
2 5 6 5 5

The Maximum amounts available of crudes A and B are 250 units and 200 units respectively. Market
demand shows that at least 150 units of gasoline X and 130 units of gasoline Y must be produced. The
profits per production run from process 1 and process 2 are Rs.4 and Rs.5 respectively. Formulate the
problem for maximizing the profit.

Solution

Maximize Z=4X+5Y

Subject to constraints

6X+5Y≤250, 4X+6Y≤200
 6X+5Y≥150, 9X+5Y≥130 , X,Y≥0.

5. A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of
bicarbonate and 1 grain of codeine. Size B contains 1 grain of aspirin, 8 grains of bicarbonate and 6
grains of codeine. It is found by users that it requires at least 12 grainsof aspirin, 74 grains of
bicarbonate and 24 grains of codeine for providing immediate effect. It is required to determine the
least number of pills a patient should take to get immediate relief. Formulate the problem as a standard
LPP.

Solution:

Minimize Z=x1+x2

S.T.C

2x1+x2≥12

5x1+8x2≥74

x1+6x2≥24 and x1,x2≥0.

6. A complete unit of a certain product consists of 4 units of component A and 3 units of component B.
The two componentsare manufactured from two different raw materials of which 100 units and 200
units, respectively, are available. Three departments are engaged in the production process with each
department using a different method for manufacturing the components per production run and the
recoulting units of each component are given below:

Department Input per run (units) Output per run(units)

Raw material- I Raw material- II Component A Component B
1 7 5 6 4
2 4 8 5 8
3 2 7 7 3
Formulate this problem as a linear programming model so as to determine the number of
production runs for each department which will maximize the total number of complete units of the
final product.

Solution:

Minimum of
{
Total number of units A Pr oduced Total number of B Pr oduced
4
,
3 }
Minimum of
{
6 X 1 +5 X 2 +7 X 3 4 X 1 +8 X 2 +3 X 3
4
,
3 }
Case(i)

If y is the number of component units of final product, we have

{ 6 X 1 +5 X 2 +7 X 3
4
≥Y , and
4 X 1 + 8 X 2 +3 X 3
3
≥Y }
Case(ii)

Constraints on raw material are:

7X1+4X2+2X3≤100 (Raw Material-I)

5X1+8X2+7X3≤200 (Raw Material-II)

The objective function Maximize Z= Minimum of 4 {

6 X 1 +5 X 2 +7 X 3 4 X 1 +8 X 2 +3 X 3
,
3 }
S.T.C

6X1+5X2+7X3-4Y≥0 and 4X1+8X2+3X3-3Y≥0

7X1+4X2+2X3≤100 (Raw Material-I)

5X1+8X2+7X3≤200 (Raw Material-II) and X 1,X2,X3≥0.

7. An electronics company produces three types of parts for automatic washing machine. It purchases
casting of the parts from a local foundry and then finishes the part of drilling, shaping and polishing
machines.
The selling prices of part A,B and C respectively are Rs.8, Rs.10 and Rs.14. All parts made can be sold.
Castings for parts A,B and C respectively cost Rs.5, Rs.6 and Rs.10.
The shop possesses only one of each type of machine. Costs per hour to run each of the three machines
are Rs.20 for drilling, Rs.30 for shaping and Rs.30 for polishing. The capacities for each part on each
machine are shown in the following table:

Capacity 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 Linear programming model
so as to maximize total profit to the company.

Solution:

Type A part consumes 1/25th of the available hour, a type B part consumes 1/40 th, and type C part
consumes 1/25th of an hour. The drilling-machine constraint is

x1 x2 x3
+ + ≤1
25 40 25 i.e., 0.04x1+0.025x2+0.04x3≤1

Similarly, the other two constraints are:

 x1 x2 x3
+ + ≤1
25 20 20 i.e., 0.04x1+0.05x2+0.05x3≤1 (Shaping-Machine)

x1 x2 x3
+ + ≤1
40 30 40 i.e., 0.025x1+0.033x2+0.025x3≤1

Profit per type A part=(8-5)-(20/25+30/25+30/40)=3-2.75=0.25

Profit per type B part=(10-6)-(20/40+30/20+30/30)=4-3=1

Profit per type C part=(14-10)-(20/25+30/20+30/40)=4-3.05=0.95

The objective function is Maximize Z=0.25x 1+x2+0.95x3

S.T.C

0.04x1+0.025x2+0.04x3≤1, 0.04x1+0.05x2+0.05x3≤1, 0.025x1+0.033x2+0.025x3≤1 and x1,x2,x3≥0.

Solution:

Maximize Z=(20% of 1,00,000)x 1+(15% of 60,000)x2+(8% of 40,000)x3

Maximize Z=20,000x1+9,000x2+3,200x3

S.T.C

8,000x1+6,000x2+5,000x3≤1,00,000

x1≤15, x2≥8, x3≥8 and x1,x2,x3≥0