Problem Statement

A firm produces two products, A and B. Each unit of A requires 2 kg of raw material and 4 labor hours
whereas each unit of product B requires 3 kg of raw material and 3 hours of labor. Every week, the firm
60 kg of raw material and 96 labor hours. One unit of product A and B give profit of Rs. 40 and Rs. 35
Formulate this problem as a linear programming problem to determine as to how many units of each o
be produced per week so that the firm can earn the maximum profit.
Solution
Formulation

Solver Formulation

Objective Function
Z = 40x1 + 35x2
Maximize Profit

x1 =

18

x2 =

Constraints
Raw Material Constraint

Objective Function =
2x1 + 3x2 60

Labor Hours Constraint

4x1 + 3x2 96

Raw Material Usage =

Non-negativity Constraint

x1, x2 0

Labor Hour Usage =

al and 4 labor hours for processing,

Every week, the firm has an availability of
of Rs. 40 and Rs. 35 respectively.
many units of each of the products should

1000
Usage =

60
96

Problem Statement

The agricultural research institute suggested a farmer to spread out at least 4800 kg of a special phos
7200 kg of a special nitrogen fertilizer to raise productivity of crops in his fields. There are two sources
and B. Both of these are available in bags weighing 100 kg each and they cost Rs. 40 and Rs. 24 respe
phosphate and nitrogen equivalent of 20 kg and 80 kg respectively, while mixture B contains these in
each.
Write this as a linear programming problem to determine how many bags of each type the farmer sho
required fertilizer at minimum cost.
Solution
Formulation

Solver Formulation

Objective Function
Minimize Profit

Z = 40x1 + 24x2
phosphate usage =
nourogen usage=

Constraints
Phosphate Requirement

20x1 + 50x2 4800

Nitrogen Requirement

80x1 + 50x2 7200

Non-negativity Constraint

x1, x2 0

kg of a special phosphate fertilizer and not less than

here are two sources for obtaining these mixtures A
40 and Rs. 24 respectively. Mixture A contains
B contains these ingredients equivalent of 50 kg

type the farmer should buy in order to obtain the

x1=
x2=

0
144

z=

3456
7200
7200

Costs
Supply

Demand

40

60

5
20

7
30

6
40

8
50

40

Allocations
Supply

Demand

20

20

1.78E-015 1.43E-007

40

10

50

60

1.43E-007
20

10
30

30
40

0
50

40

Solution
Objective Function
Minimize Cost =

860

Costs
Supply

Demand

35

55

60

7
50

9
85

3
35

20

Supply

Demand

35

35

27

28

55

13

22

25

60

10
50

0
85

10
35

20

Objective Function
Minmize Cost=

815

Costs

Solution
Supply

Demand

50

40

4
20

4
95

2
35

50

Allocations
Supply

Demand

15

35

50

20

20

40

0
20

50.000001
85

0
35

50
140

Objective Function
Minimize Cost =

bjective Function

nimize Cost =

515

Costs
Supply

Demand

50

40

4
20

4
75

2
35

60

Supply

Demand

15

35

50

20

20

0
20

60
75

0
35

60

Minimize Cost=

395

Profits

Demand

12

18

25

Supply
60

10

18

30

14

11

20

40

20

30

60

20

Allocations
Supply

Demand

10

30

20

60

30

30

10
20

0
30

30
60

0
20

40
130

Solution
Objective Function
Maximize Profit =

1930

Profits

Demand

20

14

16

Supply
500

15

400

200

300

600

Profits
Supply

Demand

54

78

42

75

85

36

56

74

89

42

41

41

85
21

78
23

62
43

48
16

71
32

58

Problem Statement

The owner of a ready-made garments store sells two types of premium shirts, known as Zee-shirts and
a profit of Rs 200 and Rs 300 per shirt on Zee and Star shirts, respectively. He has two tailors, A and B
stitch the shirts. Tailor A can devote a total of 17 hours per day, while tailor 8 can give at the most 15
of shirts are stitched by both the tailors. The time needed for stitching a Zee shirt is 2 hours by tailor A
B. Similarly, a Star shirt requires 4 hours by tailor A and 3 hours by tailor B. How many shirts of each t
in order to maximise daily profit? Formulate it as an integer programming problem.
Solution

wn as Zee-shirts and Star-shirts. He makes

two tailors, A and B. at his disposal to
give at the most 15 hours a day. Both type
s 2 hours by tailor A and 3 hours by tailor
any shirts of each type should be stitched
.

Problem Statement

Four items are considered for loading on an aeroplane, which has the capacity to load upto 15 tonnes.
values of the items are indicated below. Which items, and what quantities should be loaded on the pla
the value of the cargo transported?
Item:
Weight (tonnes):
Per unit Value:

A
3
20

B
5
25

C
6
32

D
4
22

Solution
Solver Formulation
x1

x2
0

Weight=
Value=

15
79

x3
1

x4
1

oad upto 15 tonnes. The weights and

e loaded on the plane so as to maximise

Problem Statement

A company is considering five investments. The net present value (NPV) and the initial cash outflow re
them is given below. The company has a total of Rs 48,000 to invest. Further, it is required that _x000
should not make more than 3 investments._x000D_
The company should invest in Investment II if i
investment III._x000D_
If the company invests in investment IV, then it should not invest in investm
V._x000D_Formulate this as an integer programming problem, taking the objective function as maximi
Investment
I
II
III
IV
Solution

Net Present Value (NPV)

20,000
28,000
18,500
27,500

Cash Outflow
12,000
14,000
7,000
13,000

e initial cash outflow required for each of

is required that _x000D_
The company
vest in Investment II if it invests in
ld not invest in investment
ive function as maximisation of NPV.