Scribd
Upload
2 views

Exercise 05

The document outlines exercises for a Linear and Integer Programming course at Technische Universität Berlin, focusing on cone bases, the Disjoint Path Problem, and a specific linear programming problem related to Minimum Spanning Trees. It includes tasks such as defining cone bases, proving properties of cones, and demonstrating the feasibility of solutions in graph theory. The exercises are due on November 25, 2011, and are designed to deepen understanding of mathematical concepts in optimization.

Uploaded by

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

Exercise 05

The document outlines exercises for a Linear and Integer Programming course at Technische Universität Berlin, focusing on cone bases, the Disjoint Path Problem, and a specific linear programming problem related to Minimum Spanning Trees. It includes tasks such as defining cone bases, proving properties of cones, and demonstrating the feasibility of solutions in graph theory. The exercises are due on November 25, 2011, and are designed to deepen understanding of mathematical concepts in optimization.

Uploaded by

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

Technische Universität Berlin ADM II – Linear and Integer Programming

Institut für Mathematik Winter Term 2010/2011

Prof. Dr. Rolf H. Möhring Christoph Hansknecht


Dr. Sebastian Stiller

5. Exercise
Due: Friday, 25.11.2011, 10.00h sharp before the first lecture.

Exercise 15 6 points

Let C ⊆ Rn be a cone. Any set S ⊆ C is called a cone basis of C if the cone induced by the
elements of S equals C and every element is necessary for this proptery — i.e. if you remove an
element out of S it is not spanning the cone C anymore.
(a) Define two cone bases for R2 with different cardinalities.
(b) Prove or disprove: There are cones in Rn which have a basis with an infinite number of elements.

Exercise 16 6 points

Find an instance of the Disjoint Path Problem (see the lecture notes) that fulfills the distance
criterion but does not have a feasible solution.

Exercise 17 8 points

Let G = (V, E) be an undirected connected graph with edge weights T ce ≥ 0 ∀e ∈ E.


S A partition
P of G is a split-up of V into the sets P1 , P2 , . . . , P` such that i Pi = ∅ and V = i Pi . Define
E(P ) := {(u, v) ∈ E : u ∈ Pi , v ∈ Pj , i 6= j}. Denote the number of connected components of the
graph (V, E \ E(P )) by κ(P ).
Consider the following LP:

min c> x
X
s.t. xe ≥ κ(P ) − 1 ∀P partition of G
e∈E(P )

xe ≥ 0 ∀e ∈ E

(a) Show that the incidence vector of the edges of each Minimum Spanning Tree (MST) of G is a
feasible solution for the LP.
(b) Come up with the dual LP and assume the problem would be solved with the primal-dual
algorithm. How would the procedure look like? Describe it as a graph algorithm on G.
(c) Conclude that the incidence vector of the edges of each MST is an optimal solution for the LP.

You might also like