Blending Models

In order to determine the most favourable integration of various components that are required to be mixed to produce a final product is the reason of preparing blending models. This model is widely used in many industrial sectors. Few areas of its blending application are:

• Teas
• Petroleum products
• Coffees
• Feed-mixes to be utilised for agricultural purpose
• Fertilisers and much more.

A reduction in the blending cost is the aim of these models. If common constraints are taken into account, it includes 3 part.

• Demanded size of blends
• Ingredients which are available in finite quantity
• Technological requirements

Workings of the model can be explained with the help of an example.

Example

Suppose, there are 3 final blends of gasoline and4 petroleum products which are required to be blended by a small refinery. There are no accurate blending formulas, and in addition to it, there few limitations that are required to be abided in the entire blending process. Few of the limitations are:

• The precise percentage of component 1 should be 35% of blend 3.
• The constituting percentage of component 2 should not exceed 40% of blend 1’s volume.
• On combining component 2 and 4, the blending percentage should be a minimum of 60% of blend 1’s volume.
• 20% of blend 2 should be the constituent of component 3.

Component 2 and 3 is scarcely available in an amount of 1600 Kilolitres and 200 Kilolitres. 6000 Kilolitres in totality is demanded to be blended by the production manager. An estimated blending amount that can be finally produced out of the total quantity is 2500 Kilolitres.After the final blends are sold at a wholesale price, the amount stands to be Rs. 12, Rs. 18, and Rs. 20 for per litre.

The cost of components utilised in the blends are Rs. 10, Rs. 12, Rs. 13 and Rs. 15 per litres. Now the volume of each component is required to be found out in litres for every final blend in the course of production. The motive of this problem is to find the answer by magnifying its total profit contribution.

Solution

Component I utilised in the find blend J be represented as X_IJ.

Profit contribution in totality = Total earnings from all 3 blends – Costing of all 4 components in totality

= Profit blend 1 + Profit blend 2 + Profit blend 3 – (cost of components I, 2, 3 and 4)

= Rs (20 + 18 + 12) – Rs (10 + 15 + 12 + 13)

 

The objective function stands at,

Z= [20 (x₁₁ +x₂₁ +x₃₁+x₄₁) + 18 (x₁₂ +x₂₂+x₃₂+x₄₂) + 12 (x₁₃+x₂₃+x₃₃ +x₄₃)] – [10 (x₁₁+ x₁₂+ x₁₃) + 15 (x₂₁+ x₂₂+ x₂₃) + 12 (x₃₁+ x₃₂+ x₃₃) + 13 (x₄₁+ x₄₂+ x₄₃)]

Or

Z = 10 x₁₁+ 8 x₁₂+ 2 x₁₃+ 5 x₂₁+ 3 x₂₂– 3x₂₃ + 8 x₃₁+ 6 x₃₂+ 0 x₃₃+ 7 x₄₁+ 5 x₄₁-x₄₃.

 

The constraints are,

1. 6000 Kilolitres should be the total production run.

x₁₁+ x₁₂+ x₁₃+ x₂₁+ x₂₂+ x₂₃+ x₃₁+ x₃₂ + x₃₃ + x₄₁+ x₄₂+ x₄₃= 6000,000 litres

2. Limitations in the recipe are:

• The constituting percentage of component 2 should not exceed 40% of blend 1’s volume.

X21≤ 0·4 (x₁₁ +x₂₁+x₃₁+x₄₁)

Or

-0.4 x₁₁ +0.6 x₂₁-0.4x₃₁-0.4 x₄₁≤ 0

• 20% of blend 2 should be the constituent of component 3.

x₃₂ ≥0.20 (x₁₂+ x₂₂+ x₃₂ + x₄₂)

or

–0.2 x₁₂– 2·0 x₂₂+ 0.8 x₃₂–0.20 x₄₂ ≥ 0

• The precise percentage of component 1 should be 35% of blend 3.

x₁₃= 0.35 (x₁₃+ x₂₃+ x₃₃ + x₄₃)

Or

0.65 x₁₃– 0.35 x₂₃– 0.35 x₃₃ – 0.35 x₄₃= 0

• On combining component 2 and 4, the blending percentage should be a minimum of 60% of blend 1’s volume.

x₂₁+ x₄₁ ≥0.6 (x₁₁+ x₂₁+ x₃₁+ x₄₁ )

Or

-0.6 x₁₁+ 0·4 x₂₁-0·6x₃₁ +0·4 x₄₁≥ 0

• Representation of scarcely limited components 2 and 3 can be showed by this equation.

x₂₁+ x₂₂+ x₂₃ ≤  1600,000

x₃₁+ x₃₂ + x₃₃ ≤1200,000

• Minimum production requirement constraint in final blend 1 can be represented as

x₁₁ +x₂₁ +x₃₁ +x₄₁ ≥ 2500,000

The complete linear programming model is,

Maximise

Z= 10 x₁₁+ 8 x₁₂+ 2 x₁₃+ 5 x₂₁+ 3 x₂₂-3x₂₃+ 8 x₃₁+ 6x₃₂ – 0 x₃₃+ 7 x₄₁+ 5 x₄₂– x₄₃

Subject to

x₁₁+ x₁₂+ x₁₃+ x₂₁+ x₂₂+ x₂₃+ x₃₁+ x₃₂+ x₃₃+ x₄₁ + x₄₂+ x₄₃= 6000,000

-0.4 x₁₁+ 0.6 .x₂₁ – 0.4 x₃₁ – 0.4 -x₄₁ ≤ 0

-0.2x₁₂– 0·20 x₂₂+0·8 x₃₂-0·20 x₄₂≥ 0

+0.65 x₁₃– 0.35x₂₃– 0.35x₃₃– 0.35x₄₃=0

-0·6 x₁₁+0·4x₂₁-0·6 x₃₁+0·4x₄₁ ≥0

x₂₁+ x₂₂+ x23 ≤1600,000

x₃₁+ x₃₂+ x₃₃ ≤1200,000

x₁₁ +x₂₁ +x₃₁+x₄₁≤ 2500,000

x₁₁, x₁₂,x₁₃,x₂₁, x₂₂, x₂₃, x₃₁, x₃₂, x₃₃, x₄₁, x₄₂, x₄₃ ≥0

 

Links of Previous Main Topic:-

• Concept of cost of capital
• Capitalization meaning
• Concepts of working capital
• Concept of capital expenditure
• Learning objectives and chapter outline
• Limitations of operations research

Links of Next Finance Topics:-

• Tipson formulating linear programming models
• Graphical solutions
• Linear programming learning objectives and outline of chapter
• Introduction learning objectives
• Duality in linear programming