approximation of non-linear functions in mixed integer programming

24
Approximation of Non-linear Functions in Mixed Integer Programming Alexander Martin TU Darmstadt Workshop on Integer Programming and Continuous Optimization Chemnitz, November 7-9, 2004 oint work with Markus Möller and Susanne Moritz

Upload: alair

Post on 14-Jan-2016

51 views

Category:

Documents


0 download

DESCRIPTION

Approximation of Non-linear Functions in Mixed Integer Programming. TU Darmstadt. Alexander Martin. Workshop on Integer Programming and Continuous Optimization Chemnitz, November 7-9, 2004. Joint work with Markus Möller and Susanne Moritz. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Approximation of Non-linear Functions in Mixed Integer Programming

Approximation of Non-linear Functions in Mixed Integer Programming

Alexander MartinTU Darmstadt

Workshop on Integer Programming and Continuous Optimization

Chemnitz, November 7-9, 2004

Joint work with Markus Möller and Susanne Moritz

Page 2: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

2

1. Non-linear Functions in MIPs- design of sheet metal

- gas optimization

- traffic flows

2. Modelling Non-linear Functions- with binary variables

- with SOS constraints

3. Polyhedral Analysis

4. Computational Results

Outline

Page 3: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

3

1. Non-linear Functions in MIPs- design of sheet metal

- gas optimization

- traffic flows

2. Modelling Non-linear Functions- with binary variables

- with SOS constraints

3. Polyhedral Analysis

4. Computational Results

Outline

Page 4: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

4

Design of Transport Channels

q0

EI wmax

w(x)

l

z

x

2y z dA

40

maxy

q ll 5w w

2 384 E

4 340

y

q l x x xw(x) 2

24 E l l l

S

z

y x

dA

z

0

gq 2,60

mm

q0

EI wmax

w(x)

l

z

x

2y z dA

40

maxy

q ll 5w w

2 384 E

4 340

y

q l x x xw(x) 2

24 E l l l

S

z

y x

dA

zS

z

y x

dA

z

0

gq 2,60

mm

- Bounds on theperimeters

- Bounds on thearea(s)

- Bounds on thecentre of gravity

Goal

Subject To

Maximize stiffness

Variables - topology- material

Page 5: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

5

- contracts- physical constraints

Goal

Subject To

Minimize fuel gas consumption

Optimization of Gas Networks

Page 6: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

6

Gas Network in Detail

Page 7: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

7

Gas Networks: Nature of the Problem

• Non-linear- fuel gas consumption of compressors- pipe hydraulics- blending, contracts

• Discrete- valves- status of compressors- contracts

Page 8: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

8

Pressure Loss in Gas Networks

stationarycase

horizontalpipes

pout

pin

q

Page 9: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

9

1. Non-linear Functions in MIPs- design of sheet metal

- gas optimization

- traffic flows

2. Modelling Non-linear Functions- with binary variables

- with SOS constraints

3. Polyhedral Analysis

4. Computational Results

Outline

Page 10: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

10

Approximation of Pressure Loss: Binary Approach

pin

pout

q

Page 11: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

11

Approximation of Pressure Loss: SOS Approach

pout

pin

q

Page 12: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

12

Branching on SOS Constraints

31i

1 i 1 i

Page 13: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

13

1. Non-linear Functions in MIPs- design of sheet metal

- gas optimization

- traffic flows

2. Modelling Non-linear Functions- with binary variables

- with SOS constraints

3. Polyhedral Analysis

4. Computational Results

Outline

Page 14: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

14

The SOS Constraints: General Definition

Page 15: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

15

The SOS Constraints: Special Cases

• SOS Type 2 constraints

• SOS Type 3 constraints

Page 16: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

16

The Binary Polytope

Page 17: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

17

The Binary Polytope: Inequalities

21i

21iy

Page 18: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

18

The SOS Polytope

Pipe 1 Pipe 2

Page 19: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

19

|Y| Vertices FacetsMax. Coeff.

8 12 16 18 25

16 18 49 47 42

24 24 73 90 670

32 32 142 10492 50640

The SOS Polytope: Increasing Complexity

Page 20: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

20

The SOS Polytope: Properties

Theorem. There exist only polynomially many

vertices

• The vertices can be determined algorithmically• This yields a polynomial separation algorithm by solving for given and

Page 21: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

21

The SOS Polytope: Generalizations

• Pipe to pipe with respect to pressure and flow• Several pipes to several pipes• Pipes to compressors (SOS constraints of Type 4)• General Mixed Integer Programs:

Consider Ax=b and a set I of SOS constraints of Type for such that each variable is contained in exactly one SOS constraint. If the rank of A (incl. I) and are fixed then

has only polynomial many vertices.

Page 22: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

22

Binary versus SOS Approach

• Binary- more (binary) variables- more constraints- complex facets- LP solutions with fractional y variables and correct variables

• SOS+ no binary variables+ triangle condition can be incorporated within branch & bound+ underlying polyhedra are tractable

Page 23: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

23

1. Non-linear Functions in MIPs- design of sheet metal

- gas optimization

- traffic flows

2. Modelling Non-linear Functions- with binary variables

- with SOS constraints

3. Polyhedral Analysis

4. Computational Results

Outline

Page 24: Approximation of Non-linear Functions in Mixed Integer Programming

A. Martin

24

Computational Results

Nr of Pipes Nr of

CompressorsTotal length

of pipesTime

( = 0.05)

Time

( = 0.01)

11 3 920 1.2 sec 2.0 sec

20 3 1200 1.2 sec 9.9 sec

31 15 2200 11.5 sec 104.4 sec