Exercise - Binary Integer Programming

BINARY INTEGER PROGRAMMING EXERCISE
Group 83 Operation Research II

Internal Group 5
Jenny Marcela Moreno 20101020059

Sergio Alexander Gutirrez 20101020039
OBJECTIVE: Obtain the optimal solution to a problem of binary integer programming using the
implicit enumerative method.
KEY CONCEPTS:
Implicit enumerative Method: A method of solving integer programming problems, in which tests
that follow conceptually from using implied upper and lower bounds on variables are used to
eliminate all but a tiny fraction of the possible values, with implicit treatment of all other
possibilities.
Type of Problem: Problem Backpack

A hiker has to determine which objects should carry in your backpack, to develop a day trip. Each
object must have an associated weight and personal utility for the hiker.
Objects that can be carried in, as well as their weight and utility are those who have pointed out in
the following table:
Object
flashlight
Sleeping Sack
Kitchen Equipment
Cobija
food
Clothing
other
weight
40
50
30
10
10
40
30
utility
40
80
10
10
4
20
60
Maximum weight = 100.

Determining objects Walker should carry in your bag in order to have the maximum utility of
objects.
Solution
Procedure
1. Define the Variables
Procedure
L: Headlight
S: Sleeping Bag
E: Cooking Equipment
C: Cobija
Cm: Food
A: Clothing
T: Other
2. Build the Model
3. Defining the Problem
Maximize Utility:
Z = 40L + 80S +10E + 10C + 4Cm + 20R + 60T
subject to:
40L + 50S + 30E + 10C + 10Cm + 40R + 30T <= 100
L, S, E, C, Cm, R y T = 0 1
4. Solving
implicit The number of combinations is 2^7 = 128
enumeration.
The tables can be made complete and find the best
solution computationally.
The tables are started as follows.
0000000
0000001
0000010
0000011
0000100
..
..
1111101
1111110
1111111
5. Replace the values in the From table generated values are replaced in the function
table in the constraint describing the restriction follows:

function
40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(0) + 30(0) = 0
40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(0) + 30(1) = 30
40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(1) + 30(0) = 40
40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(1) + 30(1) = 70
..
..
40(1) + 50(1) +30(1) + 10(1) + 10(1) + 40(0) + 30(1) = 170
40(1) + 50(1) +30(1) + 10(1) + 10(1) + 40(1) + 30(0) = 180
40(1) + 50(1) +30(1) + 10(1) + 10(1) + 40(1) + 30(1) = 210
6. Select the results from step 40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(0) + 30(0) = 0
5 to comply with the 40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(0) + 30(1) = 30
constraint.
40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(1) + 30(0) = 40
40(0) + 50(0) +30(0) + 10(0) + 10(0) + 40(1) + 30(1) = 70
40(0) + 50(0) +30(0) + 10(0) + 10(1) + 40(0) + 30(0) = 10
..
..
40(0) + 50(1) +30(0) + 10(1) + 10(0) + 40(0) + 30(1) = 90
40(0) + 50(1) +30(0) + 10(0) + 10(1) + 40(1) + 30(0) = 100
40(1) + 50(0) +30(1) + 10(0) + 10(0) + 40(0) + 30(1) = 100
40(1) + 50(1) +30(0) + 10(1) + 10(0) + 40(0) + 30(0) = 100
7. Once
selected 40(0) + 80(0) +10(0) + 10(0) + 4(0) + 20(0) + 60(0) = 0
combinations that meet 40(0) + 80(0) +10(0) + 10(0) + 4(0) + 20(0) + 60(1) = 60
the constraint is necessary 40(0) + 80(0) +10(0) + 10(0) + 4(0) + 20(1) + 60(0) = 20
to replace the values of the 40(0) + 80(0) +10(0) + 10(0) + 4(0) + 20(1) + 60(1) = 80
selected table in the .
objective function.
.
40(0) + 80(1) +10(0) + 10(1) + 4(0) + 20(0) + 60(1) = 150
40(0) + 80(1) +10(0) + 10(0) + 4(1) + 20(1) + 60(0) = 104
40(1) + 80(0) +10(1) + 10(0) + 4(0) + 20(0) + 60(1) = 110
40(1) + 80(1) +10(0) + 10(1) + 4(0) + 20(0) + 60(0) = 130
8. From the results obtained 40(0) + 80(1) +10(0) + 10(1) + 4(0) + 20(0) + 60(1) = 150
in section 7, the highest 0101001
value is the optimal
solution among the set of solution : - Sleeping Bag
feasible solutions obtained
- Cobija
in point 6 is selected.
- others
Conclusion: This example can be seen in a simple basis for the development of the binary integer
programming manner, as it includes each necessary for the management of each problem PEB
step.
Infographic
http://www.investigacion-operaciones.com/Curso_inv-Oper_carpeta/Clase17.pdf
http://www.uv.es/sala/mochila.pdf

Exercise - Binary Integer Programming

Uploaded by

Exercise - Binary Integer Programming

Uploaded by

BINARY INTEGER PROGRAMMING EXERCISE

Group 83 Operation Research II

Jenny Marcela Moreno 20101020059

Type of Problem: Problem Backpack

Maximum weight = 100.

2. Build the Model

3. Defining the Problem

table in the constraint describing the restriction follows:

You might also like