APPLICATIONS

PROF. U.K. BHATTACHARYA

 B&B ALGORITHM (For Computer Solution)
Assuming a maximization problem, set an initial lower bound z=-  on
the optimum objective value of ILP. Set I=0.

Step-1: (Fathoming/bounding). Select LP , the next sub problem to be

i
examined. Select LP i and attempt to fathom it using one of the three
conditions:
(a) The optimum z value of LP i cannot yield a better objective value
than the current lower bound.
(b) LP i yields a better feasible integer solution than the current lower
bound.
(c) LP i has no feasible solution.

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 2

B&B ALGORITHM
Two cases will arise
(a) If LP i is fathomed and better solution is found, update the lower
bound, if all sub problems have been fathomed, stop, the optimum
ILP is associated with the current finite lower bound. If no finite
lower bound exists the problem has no feasible solution. Else set
I=I+1, and repeat step-1.
(b) If LP i is not fathomed, go to step 2 for branching.

Step-2 (Branching) Select one of the integer variables x j , whose

*
optimum value x j in the Lpi solution is not integer. Eliminate the
region
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 3
B&B ALGORITHM

x   x  x   1
*
j j
*
j

By creating two LP subproblems that corresponds to

   
x j  x *j and x j  x *j  1
Set I=I+1 and go to step –1.

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 4

APPLICATION
• The Telfa corporation manufactures tables and chairs. A table
requires 1 hr of labor and 10 square board feet of wood, and a chair
requires 1 hour of labor and 6 square board feet of wood. Currently
5 hours of labor and 45 square board feet of wood are available.
Each table contributes $5 to profit and each chair contribute $4 to
profit. Formulate and solve the IP to maximize the Telfa’s profit.
•

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 5

Formulation:
• Maximize Z=
• Subject to,
• +
• 10 +6
•

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 6

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 7
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 8
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 9
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 10
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 11
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 12
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 13
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 14
CARGO LOADING MODEL:
Five item are to be loaded in a vessel. The weight w, and volume v,
together with the value r, for item I are tabulated subsequently.

Item i Unit Weight Unit Volume Unit Worth

W, (tons) v, (yd3) r, (1000$)

1 5 1 4
2 8 8 7
3 3 6 6
4 2 5 5
5 7 4 4

The maximum allowable cargo weight and volume are 112 tons and 109
yd3 respectively. Formulate the ILP model and find the most valuable
cargo.
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 15
SET COVERING PROBLEM:
Exercise : Five daily newspapers are published in a certain country.
Each paper covering some of the nine regions of the country
as shown in the following table.

Newspaper Region Cost of the

Covered advertisement
1 1,2,4 3
2 2,3,6 4
3 4,5,6 3
4 5,7,8 7
5 6,8,9 5

Find the minimum total cost selection of newspapers such that the
advertisement covers the whole country.
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 16
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 17
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 18
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 19
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 20
Solution:
The optimal solution is
y1  1, y2  1, y3  1, y4  1, y5  1
with Z =19

Thus the advertisement is to be given in newspapers 1,2,4 and 5 to cover

all over India with a minimum cost of 19 Units.

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 21

Implicit Enumeration
 Implicit Enumeration is a technique for solving 0-1 programming problem.
Implicit Enumeration builds from partial solutions.
The partial solution simply means the assignment of zero or one to a
subset of the decision variables.
Given a partial assignment , an analysis of the problem can lead to
elimination of certain subproblems.
 As in the Branch & Bound method, use bound to eliminate nonpromising
subproblems.
The feasible subproblem with better bound is considered as optimal
solution.
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 22
Diagram

0 1
1

2 3
0 1
Infeasible
4 5
Infeasible
0 1
6 7

(1,1,0,0,0) (1,1,1,0,0)
(1,1,0,0,1) (1,1,1,0,1)
(1,1,0,1,0) (1,1,1,1,0)
(1,1,0,1,1) (1,1,1,1,1)

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 23

 RESOURCE ALLOCATION PROBLEM:
Capital Budgeting Problem

The ICE Cold Refrigerator Company is considering investing in several

projects that have varying capital requirements over the next four years.
Faced with limited capital each year, management would like to select the
most profitable projects for capital expenditure. The estimated net
present value for each projects, the capital requirements, and the
available capital over the four-year period are given below.

Project net present value, capital requirements and available capital.

Project

Plant Warehouse New New

Expansion Expansion Machinery Product
Research
Estimated $90,000 $40,000 $10,000 $37,000 Capital
Net present available
Value

Year1 Capital: $15,000 $10,000 $10,000 $15,000 $40,000

Year2 Capital: $20,000 $15,000 $10,000 $50,000
Year3 Capital: $20,000 $20,000 $10,000 $40,000
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 24
Year4 Capital: $15,000 $5,000 $4,000 $10,000 $35,000
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 25
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 26
SET COVERING PROBLEM
Washington Country includes six towns that need emergency ambulance
service. Because of the proximity of some of the towns, a single station
may serve more than one community. The stipulation is that the station
must be within 15 minutes of driving time from the towns it serves. The
table below gives the driving times in minutes among the six towns.

1 2 3 4 5 6
1 0 23 14 18 10 32
2 23 0 24 13 22 11
3 14 24 0 60 19 20
4 18 13 60 0 55 17
5 10 22 19 55 0 12
6 32 11 20 17 12 0

Formulate an ILP whose solution will produce the smallest number of

stations and their locations.
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 27
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 28
10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 29
Solution:
• Conclusion : The ambulance locations will be located in
town 1 and town 2. This two locations will ensure that there
will be atleast one ambulance center with in 15 minutes of
driving time from each towns.

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 30

Traveling Salesman Problem

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 31

APPLICATION
• Jobco is planning to produce at least 2000 widget on three machines. The
minimum number on any machine is 500 widgets. The following table gives the
pertinent data of the situation. Formulate the problem as an ILP.
• ______________________________________________________________
• Machine Setup cost Production cost/unit Capacity (units)
• ______________________________________________________________
• 1 300 2 600
• 2 100 10 800
• 3 200 5 1200
• _______________________________________________________________

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 32

Computer Solution (Contd..)

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 33

Distribution System Design Analysis of Martin
-Beck
• The Martin-Beck Company operates a plant in St. Louis with
an annual Capacity of 30,000 units. Product is shipped to
regional distribution centers located in Boston, Atlanta and
Houston. Because of an anticipated increase in demand,
martin Beck plans to increase capacity by constructing a
new plant in one or more of the following cities : Detroit,
Toledo, Denver, and / or Kansas city. The estimated fixed
cost and the annual capacity for the four proposed plants
are as follows.

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 34

Proposed Plant Annual Fixed cost Annual Capacity
Detroit $ 1,75,000 10,000
Toledo $ 300,000 20,000
Denver $ 3,75,000 30,000
Kansas City $ 5,00,000 40,000
The company’s long range planning group has developed forecast of the anticipated annual demand at the
distribution centers as follows.
Distribution Center Annual Demand
Boston 30,000
Atlanta 20,000
Houston 20,000

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 35

 The shipping cost per unit from each plant to each distribution center is
shown in the table below
Shipping cost per unit for the Martin Beck Distribution System
Distribution Centers
Plant site Boston Atlanta Houston
Detroit 5 2 3
Toledo 4 3 4
Denver 9 7 5
Kansas City 10 4 2
St. Louis 8 4 3

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 36

Questions:

 Design a network representation of the potential Martin – Beck

distribution system.
 Formulate an appropriate model to represent costs and an
objective for the Martin Beck company.
 Which of the given five plants be chosen as the supply center so as
to satisfy the required demand.

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 37

Final Solution

10/23/2024 Developed by Prof. U.K. Bhattacharya, IIM Indore. 38