Linear Programming Problem Formulation Instructor: Miss Urooj

Linear Programing
Problem Formulation:
A linear programing model, has three basic concepts
1. Decision variables that we seek to determine.
2. Objective (goal) that we need to optimize (maximize or minimize)
3. Constrains that the solution must satisfy

Example:
A firm produces three products. These products are processed on three
different machines. The time required to manufacture one unit of each of
the three products and the daily capacity of the three machines are given
as:
Machine Time per unit (minutes) Machine capacity
(minutes per day)
Product-1 Product-2 Product-3
M1 2 3 2 440
M2 4 ---- 3 470
M3 2 5 --- 430

It is required to determine the daily number of units to be manufactured

for each product. The profit per unit for product 1, 2 and 3 is Rs. 4, 3 and
6 respectively. It is assumed that all the amounts produced are consumed
in the market. Formulate the L.P model that will maximize the daily
profit.

Solution:
Formulation of linear programming Model.

Step 1: Find the key Decision

In the given problem decision is to, decide the extent of product 1, 2 and 3.

Step 2: Assume symbols for the variable quantities notice in step 1.

Let the extent (amount) of product 1, 2 and 3 manufacture daily be

𝑥1 , 𝑥2 , 𝑥3 units respectively

Step 3: Express the feasible alternatives mathematically in terms of

variables.

The feasible alternatives are those which are physically, economically and
financially possible. In the given situation feasible alternatives are set of
Linear Programming Problem Formulation Instructor: Miss Urooj

values of 𝑥1, 𝑥2 , 𝑥3
Where
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
Since negative production has no meaning and is not feasible.

Step 4: Objective Function.

The objective is to maximize the profit

𝑍 = 4𝑥1 + 3𝑥2 + 6𝑥3
Step 4: Influencing factors or Constrains.

Constrains are on the machine capacities and can be expressed

mathematically as.

Capacity of M1
2𝑥1 + 3𝑥2 + 2𝑥3 ≤ 440
Capacity of M2
4𝑥1 + 0𝑥2 + 3𝑥3 ≤ 470
Capacity of M3
2𝑥1 + 5𝑥2 + 0𝑥3 ≤ 430
Linear Programming Problem Formulation Instructor: Miss Urooj

Practice Questions:
Question #1
An advertising company wishes to plan its advertising strategy in three
different media television, radio and magazines. The purpose of
advertising is to reach as large a number of potential customers as
possible. Following data has been obtained from market survey.

Television Radio Mag-1 Mag-2

Cost of an advertising unit Rs.30,000 Rs.20,000 Rs.15,000 Rs.10,000

No. of potential customers
200,000 600,000 150,000 100,000
reached per unit
No. of female customers
150,000 400,000 70,000 50,000
reached per unit

The company wants to spend no more than Rs.450, 000 on advertising.

Following are the further requirements that must be met:

 At least 1 million exposures take place among female customers.

 Advertising on magazines be limited to Rs.150, 000.

 At least 3 advertising units be bought on mag-1 and 2 units on mag-

2.
 The number of advertising units on television and radio each should
be between 5 and 10.

Solution:
Formulation of linear programming Model.

Step 1: Find the key Decision

In the given problem decision is, the number of advertising units to be

bought on T.V, radio, Mag-1 and Mag-2.

Step 2: Assume symbols for the variable quantities notice in step 1.

Let the number of advertising units to be bought on T.V, radio, Mag-1 and
Mag-2 be 𝑥1, 𝑥2 , 𝑥3 , 𝑥4 units respectively

Step 3: Express the feasible alternatives mathematically in terms of

variables

In the given situation feasible alternatives are set of values of 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4

Linear Programming Problem Formulation Instructor: Miss Urooj

Where
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Since negative production has no meaning and is not feasible.

Step 4: Objective Function.

The objective is to maximize the number of potential customers.

Maximize Z = 200,000𝑥1 + 600,000𝑥2 + 150,000𝑥3 + 100,000 𝑥4

Step 5: Influencing factors or Constrains.

Constrains can be expressed mathematically as.

The advertising budget

30,000𝑥1 + 20,000𝑥2 + 15,000𝑥3 + 10,000𝑥4 ≤ 450,000

Female customers,
150,000𝑥1 + 400,000𝑥2 + 70,000𝑥3 + 50,000𝑥4 ≥ 10,00,000

Expenses on Mags,
15,000𝑥3 + 10,000 𝑥4 ≤ 150,000

No. of units on Mag 1, Mag 2,

𝑥3 ≥ 3
𝑥4 ≥ 2
No. of units on T.V,
5 ≤ 𝑥1 ≤ 10
No. of units on Radio,
5 ≤ 𝑥2 ≤ 10
Linear Programming Problem Formulation Instructor: Miss Urooj

Question #2
A firm produces an alloy having the following specification:
I. Specific gravity ≤ 0.98
II. Chromium ≥ 8%
III. Melting point ≥ 450 𝑜𝐶
Raw material A, B and C having the properties shown in the table can be
used to make the alloy.

Properties of raw material

Property
A B C
Specific gravity 0.92 0.97 1.04
Chromium 7% 13% 16%
𝑜 𝑜
Melting point 440 𝐶 490 𝐶 480 𝑜𝐶

Costs of the various raw materials per ton are: Rs. 90 for A, Rs. 280 for B,
and Rs. 40 for C. Formulate the L.P. model to find the proportions in which
A, B, C be used to obtain an alloy of desired properties while cost of raw
material is minimum.
Solution:
Let 𝑥1 , 𝑥2 , 𝑥3 denote the percentage contents of raw material A, B, C to be
used for making the alloy.

Objective is to minimize cost

Z= 90𝑥1 + 280𝑥2 , +40𝑥3

Subject to,
Specific gravity 0.92𝑥1 + 0.97𝑥2 , +1.04𝑥3 ≤ 0.98

Chromium 7𝑥1 + 13𝑥2 , +16𝑥3 ≥ 8

Melting point 440𝑥1 + 490𝑥2 , +480𝑥3 ≥ 450

𝑥1 + 𝑥2 + 𝑥3 = 100

𝑥1 , 𝑥2 , 𝑥3 ≥ 0
Linear Programming Problem Formulation Instructor: Miss Urooj

Question #3
A person wants to decide the constituents of diet, which will fulfill his
daily requirements of proteins, fats, and carbohydrates at the minimum
cost. The choice is to be made from four different types of food. The
yields per unit of these foods are given as follows.

Cost per
Yield per unit
Food type unit
Proteins Fats Carbohydrates (Rs.)
1 3 2 6 45
2 4 2 4 40
3 8 7 7 85
4 6 5 4 65
Min.
800 200 700 -------------
Requirement

Formulate a linear programming model for the problem

Solution:
Let 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 denote the number of units of food of type 1, 2, 3 and 4
respectively
The objective is to minimize the cost.

Minimize Z = 45𝑥1 + 40 𝑥2 + 85𝑥3 + 65𝑥4

Constraints are the fulfilment of the daily requirements of the various

constituents.

For protein 3x1 + 4 x2 + 8x3 + 6x4 ≥ 800

For fats 2x1 + 2 x2 + 7x3 + 5x4 ≥ 200

For carbohydrates, 6x1 + 4 x2 + 7x3 + 4x4 ≥ 700

𝑥1, 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Linear Programming Problem Formulation Instructor: Miss Urooj

Question #4
A firm manufactures two items. It purchases castings which are then
machined, bored and polished. Casting for item A and B cost Rs. 2 and
Rs. 3 respectively and sold at Rs. 5 and Rs. 6 each respectively. Running
costs of the three machines are Rs. 20, Rs. 14 and Rs. 17.50 per hours
respectively. Capacities of the machines are

Part A Part B
Machine
25/hr 40/hr
Capacity
Boring
28/hr 35/hr
capacity
Polishing
35/hr 25/hr
capacity

Formulate the LP model to determine the product mix that maximize

the profit.

Solution:
Let 𝑥1 , 𝑥2 represents the number of units of A, B to be manufactured per
hour
The object is to maximize the profit.

Profit of one unit of part of A and B is,

Part (A) Part (B)

Machining cost 20 20
= 0.80 = 0.50
25 40
Boring cost 14 14
= 0.50 = 0.40
28 35
Polishing Cost 17.50 17.50
= 0.50 = 0.70
35 25
Purchases of casting 2 3
Total Cost 3.80 4.60
Selling Price 5 6
Profit 5-3.80=1.20 1.40
Linear Programming Problem Formulation Instructor: Miss Urooj

Maximize Z= 1.2𝑥1 + 1.4𝑥2

Subject to,
1 1
Machining capacity 𝑥1 + 𝑥 ≤1
25 40 2

1 1
Boring capacity 𝑥1 + 𝑥 ≤1
28 35 2

1 1
Polishing Capacity 𝑥1 + 𝑥 ≤1
35 25 2

𝑥1 , 𝑥2 ≥ 0
Linear Programming Problem Formulation Instructor: Miss Urooj

Question #5
The Delhi florist company is planning to make up floral arrangements for
the upcoming festival. The company has available the following supply of
the flowers at the costs shown:

Type Number Available Cost per flower

(Rs.)
Red Roses 800 0.20
Gardenias 456 0.25
Carnations 4,000 0.15
White Roses 920 0.20
Yellow Roses 422 0.22

The flowers can be used in any of the four popular arrangements

whose make up and selling prices are as follows.

Arrangements Requirements Selling price

4 Red Roses
Economy 2 Gardenias Rs. 6
8 Carnations
8 White Roses
5 Gardenias
Maytime Rs. 8
10 Carnations
4 yellow Roses
9 Red Roses
10 Carnations
Spring color Rs. 10
9 White Roses
6 yellow Roses
12 Red Roses
Deluxe-Rose 12 White Roses Rs. 12
12 yellow Roses

Formulate the linear programming problem which allow the florist

company to determine how many units of each arrangement should
be make up in order to maximize profits assuming all arrangements
can be sold.
Linear Programming Problem Formulation Instructor: Miss Urooj

Solution:
Let 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 be the number of units of each arrangement that
should be made up to maximize the profit.

Profit by selling one unit of Economy arrangements

=Rs. [6 - (4*0.20+2*0.25+8*0.15)]= Rs. 3.50

Profit by selling one unit of Maytime arrangements

=Rs. [8 - (8*0.20+5*0.25+10*0.15+4*0.22)]= Rs. 2.77

Profit by selling one unit of spring color arrangements

=Rs. [10 - (9*0.20+10*0.15+9*0.20+6*0.22)]= Rs. 3.58

Profit by selling one unit of Deluxe-Rose arrangements

=Rs. [12 - (12*0.20+12*0.20+12*0.22)]= Rs. 4.56

The objective is to maximize the profit

Z = 3.50𝑥1 + 2.77𝑥2 + 3.58𝑥3 + 4.56 𝑥4

Subject to,
Availability of Red Rose, 4𝑥1 + 9𝑥3 + 12 𝑥4 ≤ 800

Availability of Gardenias, 2𝑥1 + 5𝑥2 ≤ 456

Availability of Carnations, 8𝑥1 + 10𝑥2 + 10 𝑥3 ≤ 4000

Availability of White Rose, 8𝑥2 + 9𝑥3 + 12 𝑥4 ≤ 920

Availability of yellow Rose, 4𝑥2 + 6𝑥3 + 12 𝑥4 ≤ 422

𝑥1, 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Linear Programming Problem Formulation Instructor: Miss Urooj

Question #6
A farmer has a 100 acre farm. He can sell all the tomatoes, lettuces or
radishes he can raise. The price he can obtain is Re.1 per kg of tomatoes,
Re. 0.75 a head for lettuce and Re. 2 per kg for radishes. The average yield
per acre is 2,000 kg of tomatoes, 3,000 heads of lettuce and 1,000 kg of
radishes. Fertilizer is available at 0.50 per kg. And the amount required
per acre is 100 kg. Each for 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 Re. 20 per man-day. Formulate the LP
model for this problem in order to maximize the profitability of the
farmer.

Solution:
Let 𝑥1 , 𝑥2 , 𝑥3 represents the amount of tomatoes, lettuces or radishes in
kilograms.

Profit by selling tomatoes

=Rs. [1*2000 - (0.50*100 + 5*20)]= Rs. 1850

Profit by selling lettuces

=Rs. [0.75*3000 - (0.50*100 + 6*20)]= Rs. 2080

Profit by selling radishes

=Rs. [2*1000 - (0.50*50 + 5*20)]= Rs. 1875

The objective is to maximize the profit

Z = 1850𝑥1 + 2080𝑥2 + 1875𝑥3

Subject to,
Availability of land,
𝑥1 + 𝑥2 + 𝑥3 ≤ 1000

Availability of Labor,
5𝑥1 + 6𝑥2 + 5𝑥3 ≤ 400

𝑥1, 𝑥2 , 𝑥3 ≥ 0
Linear Programming Problem Formulation Instructor: Miss Urooj

Question #7
A plant manufactures washing machines and dryers. The major
manufacturing departments are the stamping department, motor and
transmission department, and assembly department. The first two
departments produce parts for both the products while the assembly
lines are different for the two products. The monthly department
capacities are:
Availability
Data
Department Capacity
Stamping 1,000 washers or
1,000 dryers
Motor and 1,600 washers or
Transmission 7,000
dryers
Washer assembly 9,000 washers
Dryer assembly 5,000 dryers

Profits per piece of washers and dryers are Re. 2,700 and Re. 3,000
respectively. Formulate the LP model.

Solution:
Let 𝑥1 , 𝑥2 ,be the number of washing machines and dryers that should be
manufacture each month to maximize the profit.

The objective is to maximize the total profit each month.

Z = 270𝑥1 + 300𝑥2

Constrains are on the monthly capacities of the various department.

For stamping department
𝑥1 𝑥2
+ ≤1
1000 1000

For the motor and transmission department

𝑥1 𝑥2
+ ≤1
1600 7000

For Washer assembly department

𝑥1 ≤ 9000

For Dryer assembly department

𝑥2 ≤ 5000

𝑥1 , 𝑥2 ≥ 0
Linear Programming Problem Formulation Instructor: Miss Urooj

Question # 8
A dairy feed company may purchase and mix one or more of the three
types of grains containing different amounts of nutritional elements.
The data is given in the table below. The production manager specifies
that any feed mix for his livestock must meet at least minimal
nutritional requirements and seeks the least costly among all such
mixes.

One Unit
Weight of
Grain- Minimal
Item Grain-I Grain-II
III Req.
A 2 3 7 1,250
Nutritional B 1 1 0 250
Ingredients C 5 3 0 900
D 6 25 1 232.5
Cost/unit weight
41 35 96
(Re.)

Analyze the situation to recognize the key decision, objective, alternative

and restrictions. Formulate the linear programming model for the
problem.

Solution:
Let 𝑥1 , 𝑥2 , 𝑥3 represents the amount of Grain-I, Grain-II and Grain-III to
be used feed mix for his livestock, that fulfil the nutritional requirements
at minimal cost.

The objective is to minimize the cost

Z = 41𝑥1 + 35𝑥2 + 96𝑥3

Subject to,
Nutritional Ingredient A, 2𝑥1 + 3𝑥2 + 7 𝑥3 ≥ 1250

Nutritional Ingredient B, 𝑥1 + 𝑥2 + 0 𝑥3 ≥ 250

Nutritional Ingredient C, 5𝑥1 + 3𝑥2 + 0 𝑥3 ≥ 900

Nutritional Ingredient D, 6𝑥1 + 25𝑥2 + 1𝑥3 ≥ 232.5

𝑥1 , 𝑥2 , 𝑥3 ≥ 0