Corner Polyhedra and 2-Dimensional Cuttimg Planes George Nemhauser Symposium June 26-27 2007.

Slides:



Advertisements
Similar presentations
Thoughts About Integer Programming University of Montreal, January 26, 2007.
Advertisements

Forty Years of Corner Polyhedra. Two Types of I.P. All Variables (x,t) and data (B,N) integer. Example: Traveling Salesman Some Variables (x,t) Integer,
10.4 Complex Vector Spaces.
Geometric Interpretation of Linear Programs
State Variables.
1 Chapter 4 Curve Plotting with MATLAB MATLAB provides some very powerful features for plotting and labeling curves. These operations can be performed.
Lecture #3; Based on slides by Yinyu Ye
Irina Vaviļčenkova, Svetlana Asmuss ELEVENTH INTERNATIONAL CONFERENCE ON FUZZY SET THEORY AND APPLICATIONS Liptovský Ján, Slovak Republic, January 30 -
Bangalore conference, December, Rank 3-4 Coxeter Groups, Quaternions and Quasicrystals Mehmet Koca Department of Physics College of Science.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Elementary Linear Algebra Anton & Rorres, 9th Edition
The Structure of Polyhedra Gabriel Indik March 2006 CAS 746 – Advanced Topics in Combinatorial Optimization.
An Algorithm for Polytope Decomposition and Exact Computation of Multiple Integrals.
5.6 Maximization and Minimization with Mixed Problem Constraints
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Solve Systems of Linear Equations in Three Variables Chapter 3.4.
Table of Contents Compound Linear Inequalities: Solving Algebraically Example: Algebraically solve, - 5 < 2x + 3  8. First break the compound inequality.
The Problem with Integer Programming H.P.Williams London School of Economics.
Differential Equations
LINEAR PROGRAMMING SIMPLEX METHOD.
1 What you will learn  How to graph and identify piecewise functions  How to graph linear inequalities.
STUDY OF THE HIRSCH CONJECTURE BASED ON “A QUASI-POLYNOMIAL BOUND FOR THE DIAMETER OF GRAPHS OF POLYHEDRA” Instructor: Dr. Deza Presenter: Erik Wang Nov/2013.
Exploring Mathematical Tasks Using the Representation Star RAMP 2013.
Surprises in high dimensions Martin Lotz Galois Group, April 22, 2015.
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.1 Graphing and Functions.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
1 Lifting Procedures Houston Chapter of INFORMS 30 May 2002 Maarten Oosten.
Acute angle An angle with a measure less than 90 degrees.
Bellwork: Graph each line: 1. 3x – y = 6 2. Y = -1/2 x + 3 Y = -2
Look at page 193 in your explorations book. Ignore the letters--they are not used for this. Each figure is made up of 5 squares that may or may not be.
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.
D Nagesh Kumar, IIScOptimization Methods: M7L2 1 Integer Programming Mixed Integer Linear Programming.
Embedding Formulations, Complexity and Representability for Unions of Convex Sets Juan Pablo Vielma Massachusetts Institute of Technology CMO-BIRS Workshop:
Section 2.5 Solving Linear Inequalities
9.3 – Linear Equation and Inequalities 1. Linear Equations 2.
Chapter 1 Systems of Linear Equations Linear Algebra.
Thinking Mathematically Algebra: Equations and Inequalities 6.4 Linear Inequalities in One Variable.
polyhedron a three- dimensional figure whose surfaces are polygons faces edge vertex.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
4.5: The Dimension of a Vector Space. Theorem 9 If a vector space V has a basis, then any set in V containing more than n vectors must be linearly dependent.
Acute angle: An angle with a measure less than 90º.
Surface Area and Volume Challenge Construct two 3-Dimensional Figures given large sheets of construction paper: – One that has the largest possible Surface.
Fundamental Theorems in Mathematics
Solving Linear Systems
Linear Inequalities in One Variable
Computation of the solutions of nonlinear polynomial systems
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
IE 635 Combinatorial Optimization
PHY 745 Group Theory 11-11:50 AM MWF Olin 102 Plan for Lecture 36:
Linear Inequalities Solution to inequality in one variable – interval on number line Solution to inequality in two variables – points in the plane Graph.
Differential Evolution
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Proving that a Valid Inequality is Facet-defining
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
College Physics Chapter 1 Introduction.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
4.6: Rank.
2. Generating All Valid Inequalities
Linear Algebra Lecture 3.
Chapter 1. Formulations (BW)
I.4 Polyhedral Theory (NW)
Basics of Linear Algebra
Unit 1 Representing Real Numbers
I.4 Polyhedral Theory.
Proving that a Valid Inequality is Facet-defining
Part II General Integer Programming
Systems of three equations with three variables are often called 3-by-3 systems. In general, to find a single solution to any system of equations,
Discrete Optimization
Presentation transcript:

Corner Polyhedra and 2-Dimensional Cuttimg Planes George Nemhauser Symposium June

Integer Programming - Notation

L.P., I.P and Corner Polyhedron

Equations

L.P., I.P and Corner Polyhedron

Comparing Integer Programs and Corner Polyhedron General Integer Programs – Complex, no obvious structure Corner Polyhedra – Highly structured

Cutting Planes for Corner Polyhedra are Cutting Planes for General I.P.

Valid, Minimal, Facet

Cutting Planes

General Cutting Planes

Two Types of I.P. All Variables (x,t) and data (B,N) integer. Example: Traveling Salesman Some Variables (x,t) Integer, some continuous, data continuous. Example: Scheduling,Economies of scale.

First Type Data and Variables Integer

Mod(1) B -1 N has exactly Det(B) distinct Columns v i

Structure Theorem

Typical Structured Faces

Shooting Theorem

Concentration of Hits Ellis Johnson and Lisa Evans

Second Type: Data non-integer, some Variables Continuous

Cutting Planes Must Be Created

Cutting Planes Direct Construction Example: Gomory Mixed Integer Cut Variables t i Integer Variables t +, t - Non-Integer

Integer Cuts lead to Cuts for the Continuous Variables

Two Integer Variables Examples: Both are Facets

Integer Variables Example 2

Gomory-Johnson Theorem

Integer versus Continuous Integer Theory More Developed But more developed cutting planes weaker than the Gomory Mixed Integer Cut for continuous variables

Comparing

New Direction Reverse the present Direction Create continuous facets Turn them into facets for the integer problem

Start With Continuous x

Create Integer Cut: Shifting and Minimizing

The Continuous Problem and A Theorem

Direction Move on to More Dimensions

Helper Theorem Theorem If is a facet of the continous problem, then (kv)=k (v). This will enable us to create 2-dimensional facets for the continuous problem.

Creating 2D facets

The triopoly figure

This corresponds to

The periodic figure

The 2D Periodic figure- a facet

One Periodic Unit

Creating Another Facet

The Periodic Figure - Another Facet

More

These are all Facets For the continuous problem (all the facets) For the Integer Problem For the General problem Two Dimensional analog of Gomory Mixed Integer Cut

x i Integer t i Continuous

Basis B

Corner Polyhedron Equations

T-Space Gomory Mixed Integer Cuts

T- Space – some 2D Cuts Added

Summary Corner Polyhedra are very structured The structure can be exploited to create the 2D facets analogous to the Gomory Mixed Integer Cut There is much more to learn about Corner Polyhedra and it is learnable

Challenges Generalize cuts from 2D to n dimensions Work with families of cutting planes (like stock cutting) Introduce data fuzziness to exploit large facets and ignore small ones Clarify issues about functions that are not piecewise linear.

END

Backup Slides

One Periodic Unit

Why π(x) Produces the Inequality It is subadditive π(x) + π(y) π(x+y) on the unit interval (Mod 1) It has π(x) =1 at the goal point x=f 0

Origin of Continuous Variables Procedure

Shifting

References Some Polyhedra Related to Combinatorial Problems, Journal of Linear Algebra and Its Applications, Vol. 2, No. 4, October 1969, pp Some Continuous Functions Related to Corner Polyhedra, Part I with Ellis L. Johnson, Mathematical Programming, Vol. 3, No. 1, North-Holland, August, 1972, pp Some Continuous Functions Related to Corner Polyhedra, Part II with Ellis L. Johnson, Mathematical Programming, Vol. 3, No. 3, North-Holland, December 1972, pp T-space and Cutting Planes Paper, with Ellis L. Johnson, Mathematical Programming, Ser. B 96: Springer-Verlag, pp (2003).