Scribd
Upload
75 views

TSDR

The document provides a series of exercises related to discrete and continuous optimization problems. It includes questions about combinatorial optimization problems, matching and covering problems on graphs, integer programming formulations, network flow problems, and heuristics for problems like the traveling salesman problem and facility location.

Uploaded by

Anonymous N3LpAX
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PS, PDF, TXT or read online on Scribd
75 views

TSDR

The document provides a series of exercises related to discrete and continuous optimization problems. It includes questions about combinatorial optimization problems, matching and covering problems on graphs, integer programming formulations, network flow problems, and heuristics for problems like the traveling salesman problem and facility location.

Uploaded by

Anonymous N3LpAX
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PS, PDF, TXT or read online on Scribd
You are on page 1/ 2

Dis

rete and Continuous Optimzation (Part 2)


Monday, January 15, 2003, 9 { 12 AM
1.

Start every exer ise on a new pie e of paper.

2.

From your work is should be lear how your results are obtained.

3.

Probably time is too short for all of the exer ises; make as mu h of them as possible in the given time.

1. Consider the following ombinatorial optimization problem:




max T x : x 2 X  Zn :

(a) When do we say that the polyhedron P = fx 2 Rn : Ax  bg is a formulation for X ?


(b) Suppose that two formulations P1 and P2 for X are given. When do we say that formulation
P1 is better than P2 ?
( ) When do we say that a formulation P for X is ideal?
2. Let G = (V ; E ) be an undire ted graph, with node set V and edge set E .
(a) When is M  E alled a mat hing in G?
(b) When is R  V alled a overing by nodes in G?
( ) What do we mean if we say that the problem of nding a maximum ardinality mat hing and
the problem of nding a minimum ardinality overing by nodes form a weakly dual pair of
problems?
(d) What do we mean if we say that the two problems mentioned in ( ) form a strongly dual pair
of problems?
(e) Prove that the two problems mentioned in ( ) form a weakly dual pair.
(f) Do you know a lass of graphs for whi h the two problems mentioned in ( ) form a strongly
dual pair?
3. Let G = (V ; E ) be an undire ted graph, with node set V and edge set E .
(a) Give an IP formulation for the problem of nding a maximum ardinality mat hing in G.
(b) Give an IP formulation for the problem of nding a minimum overing by nodes problem in
G.
4. (a) Des ribe in words the Un api ated Fa ility Lo ation (UFL) problem and give a mathemati al
formulation of this problem.
(b) Des ribe in words the Un api ated Lot-Sizing (ULS) problem and give a mathemati al formulation of this problem.
5. Prove that y2 + y3 + 2y4  6 is a valid inequality for


4
X =
y 2 Z+ : 4y1 + 5y2 + 9y3 + 12y4  34 :
6. Consider the stable set problem. An odd hole is a y le with an odd number of nodes with no edges
between nonadja ent nodes of the y le. Show that if H is the node set of an odd hole, then

j2H

j

j j

is a valid inequality.
7. Given is the network below. The numbers indi ate apa ities of the ar s.
1

2
4

(a) Find a maximum s

12

ow in this network.

3
2

(b) Find a minimum

ut in this network.

8. Find a maximal mat hing in the depi ted graph and demonstrate that your answer is orre t.
1

1'

2'

3'

4'

5'

6'

9. Find a maximum weight mat hing in the bipartite graph below.


3

1'

8
2

4
2'

12
3

6
4

3'

8
11
3

4'

2
6
1

5'

10. Consider the enumeration tree for a minimization problem, as shown below.
(a) Give tightest possible lower and upper bounds on the optimal value z .
(b) Whi h nodes an be pruned and whi h must be explored further?

1
0

32

25
1

27

26

3
28

31

30

27

35

31

infeasible

11. Apply one of the heuristi s you know to the instan e of STSP with the following distan e matrix
0 - 28 57 72 81 85 80 1
B 28 - 28 45 54 57 63 C
B 57 28 - 20 3 28 57 C
B 72 45 20 - 10 20 72 C :
C
B
B 81 54 3 10 - 22 81 C
A

85 57 28 20 22 - 63
80 63 57 72 81 63 12. Apply greedy and lo al neighborhood heuristi s to an instan e of the problem of most pro tably
allo ating lients to at most K depots with m = 7 lients, n = 6 potential depots, K = 3, and the
following ost matrix:
0
1
2 3 7 3
6 1
B 3 1 1 8 10 4 C
B
C
B 6 2 3 1 2 7 C
B
C
C
( ij ) = B
B 8 1 4 6 2 3 C:
B 4 4 3 3 4 3 C
B
C
 2 8 3 6 3 2 A
6 5 3 2
7 4

You might also like