Introduzione al corso RO2
|
|
- Deborah Todd
- 5 years ago
- Views:
Transcription
1 Introduzione al corso RO2 Laura Galli Dipartimento di Informatica Largo B. Pontecorvo 3, Pisa 1 Ottobre 2018 Ricerca Operativa 2 Laurea Magistrale in Ingegneria Gestionale Università di Pisa A.A. 2018/19 L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 1 / 25
2 Conoscenze richieste Corso di base di Ricerca Operativa Programmazione Lineare Algoritmo del Simplesso Dualità Programmazione Lineare su grafi Cammino minimo Flusso massimo Flusso di costo minimo L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 2 / 25
3 Obiettivo e argomenti del corso Obiettivo Lo scopo del corso è quello di fornire gli strumenti teorico-algoritmici necessari per modellare e risolvere problemi di Programmazione Intera (IP), che sorgono nella gestione di sistemi complessi, quali la produzione industriale o la gestione di servizi. Il tema principale del corso è il concetto di (ri)-formulazione. Argomenti Cenni sulla complessità computazionale Teoria e metodi di Programmazione Lineare Intera Modellazione e risoluzione di alcuni classici problemi di ottimizzazione SW per l ottimizzazione matematica L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 3 / 25
4 Il processo decisionale complessità proprietà modello (analisi poliedrale) var. continue/intere funz. lineari/non lineari 1 o più obiettivi Modello Teoria Algoritmo esatto/euristico/approx. general purpose/ad hoc Problema L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 4 / 25
5 Riferimenti Laura Galli Dipartimento di Informatica Largo B. Pontecorvo Pisa Edificio C - 2 piano - stanza 368 DN tel laura.galli@unipi.it ricevimento: TBD Orario del corso lunedì aula C21 martedì aula F4 L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 5 / 25
6 Materiale per il corso Pagina web del corso Ricerca Operativa II (LM Ingegneria Gestionale) Testi e appunti lezioni alla lavagna......materiale fornito durante il corso Appunti RO L.A. Wolsey, Integer Programming, Wiley-Interscience M. Pappalardo, M. Passacantando, Ricerca Operativa, Edizioni Plus, L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 6 / 25
7 Dettagli del corso Learning is better if you participate Math on the blackboard...take notes! Italian & English Readings... Homeworks... Plz always check out the AVVISI section of the course web page before the class! Seminars L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 7 / 25
8 Grading Esame Prova scritta sugli argomenti trattati + prova orale facoltativa (libera oppure guidata da progetto). Non è permesso l uso di appunti, libri etc. La consegna di una prova scritta annulla le prove scritte consegnate in precedenza. Limite: max 4 consegne all anno. Academic Integrity: if you cheat, you make me sad :-( and sick :-S L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 8 / 25
9 Let s start Today s outline About this class: done IP: Why would you possibly care? IP warm up: First definitions, Modeling with IP L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 9 / 25
10 Programming??? I hate Programming!!! Question What does programming mean? L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 10 / 25
11 Programming??? I hate Programming!!! Question What does programming mean? Answer Planning. L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 11 / 25
12 Programming??? I hate Programming!!! Question What does programming mean? Answer Planning. MP Mathematical Programming (optimization) is the selection of a best element (with regard to some criteria) from some set of available alternatives. L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 12 / 25
13 Mathematical Optimization MP Literally, these are mathematical models for planning. Also called optimization models. MP The essential element is the existence of an objective. MP Some classifications of mathematical programs: Linear/nonlinear Convex/nonconvex Discrete/continuous Stochastic/deterministic L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 13 / 25
14 Programming with Integers?!?! IP Integer Programming is about decision making with integers. More precisely, decision making in which some of the decisions may take only certain integer values. Question Why would you ever want to program with integers? L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 14 / 25
15 Programming with Integers?!?! Question Why would you ever want to program with integers? Answer If the variable is associated with a physical entity that is indivisible, then it must be integer. L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 15 / 25
16 Programming with Integers?!?! Question Why would you ever want to program with integers? Answer If the variable is associated with a physical entity that is indivisible, then it must be integer. Important Sometimes a continuous approximation to the discrete (integer) decision is accurate enough for practical purposes... but in many cases it is not! L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 16 / 25
17 Binary 0-1 Variables We can use 0-1 (binary) variables for a variety of purposes. Modeling yes/no decisions. Enforcing disjunctions. Enforcing logical conditions. Modeling fixed costs. Modeling piecewise linear functions. In most of these cases the continuous approximation to the discrete decision is not accurate enough for practical purposes. L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 17 / 25
18 MIP Mixed-Integer Linear Programming Problem: (MILP) max {c T x +h T y Ax +G y b, x Z n +, y Rp +} Instance: c R n, h R p, A R m n, G R m p, b R m MATH NOTATION QUIZ What the heck is R p +? What the heck is Z n +? What is the objective function? What are the decision variables? How many? What are the constraints? How many? What is the feasibile region? Can you guess what it is like? L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 18 / 25
19 Integer Programming Classes We call the problem mixed integer programming due to the presence of continuous variables In some problems x are allowed to take on values only 0 or 1 Such variables are called binary. Integer Programs involving only binary variables are called binary integer programs (BIPs). (x B n ) (Pure) Integer Programming G,h,y not present: max {c T x Ax b, x Z n +} Mixed 0 1 Programming x B n : max {c T x +h T y Ax +G y b, x B n, y R p +} Linear Programming (!) c,a,x not present: max {h T y G y b, y R p +} L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 19 / 25
20 Solutions A solution is an assignment of values to variables. A solution can hence be thought of as an n-dimensional vector. A feasible solution is an assignment of values to variables such that all the constraints are satisfied. The objective function value of a solution is obtained by evaluating the objective function at the given point. An optimal solution (assuming maximisation) is one whose objective function value is greater than or equal to that of all other feasible solutions. Note that a math program may not have a feasible solution. Question: What are the different ways in which this can happen? L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 20 / 25
21 General Comments Note that many textbooks consider maximization problems by default. Many people (myself included) often consider minimization as the default, so be ready to be confused. One further assumption we will make, and never mention again, is that the input data is rational. e.g. (c Q n ) This is an important assumption since with irrational data, certain intuitive results no longer hold. Such as what? A computer can only understand rational data anyway, so this is not an unreasonable assumption. Note that you implicitly assumed this in your linear programming course anyway! L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 21 / 25
22 How Hard is Integer Programming? Solving general integer programs can be much more difficult than solving linear programs. This is more than just an empirical statement There is a whole theory surrounding it You will learn some of the gory details There is no polynomial-time algorithm for solving general MIPs. Solving the associated linear programming relaxation results in an upper bound on the optimal solution to the MIP (assuming maximization). In general, an optimal solution to the LP relaxation does not tell us much about an optimal solution to the MIP. Why does solving the LP relaxation not necessarily yield a good solution? Rounding to a feasible integer solution may be difficult or impossible. Rounding may result in a solution far from optimal. The optimal solution to the LP relaxation can be arbitrarily far away from the optimal solution to the MIP. We can bound the difference between the optimal solution to the LP and the optimal solution to the MIP. How? L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 22 / 25
23 Integer Programming and Convexity The feasible region of an integer program is nonconvex. The nonconvexity is of a rather special form, though all forms of nonconvexity are in some sense equivalent. Although the feasible set is nonconvex, there is a convex set over which we can optimize in order to get a solution. Why? The challenge is that we do not know how to describe that set. Even if we knew the description, it would in general be way too large to write down explicitly. Integer variables can be used to express other forms of nonconvexity, as we will see later on. L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 23 / 25
24 Basic Themes Our goal will be to expose the geometrical structure of the feasible region (at least near the optimal solution). We can do this by: Outer approximation Inner approximation Division An important component of the algorithms we consider will be mechanisms for computing bounds by either: Relaxation Duality When all that fails, we will employ a basic principle: divide large, difficult problems into smaller ones: Logic (conjunction/disjuntion) Implicit enumeration Decomposition L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 24 / 25
25 Combinatorial Optimization A combinatorial optimization problem: COP = (N, F) consists of A finite ground set N A finite set F 2 N of feasible solutions Costs c j j N The cost of F F is c(f) = j F cj The combinatorial optimization problem is then max {c(f) F F} Many COPs can be written as IPs... We ll see some examples soon...stay tuned! L. Galli Corso di Ricerca Operativa 2 - Laurea Magistrale in Ingegneria Gestionale Università di Pisa 25 / 25
Computational Integer Programming Universidad de los Andes. Lecture 1. Dr. Ted Ralphs
Computational Integer Programming Universidad de los Andes Lecture 1 Dr. Ted Ralphs MIP Lecture 1 1 Quick Introduction Bio Course web site Course structure http://coral.ie.lehigh.edu/ ted/teaching/mip
More informationLogistics. Lecture notes. Maria Grazia Scutellà. Dipartimento di Informatica Università di Pisa. September 2015
Logistics Lecture notes Maria Grazia Scutellà Dipartimento di Informatica Università di Pisa September 2015 These notes are related to the course of Logistics held by the author at the University of Pisa.
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More informationInteger Linear Programming Modeling
DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem
More informationWarm Up. sense, and what a first-time reader might watch out for. Please wrap up your thoughts by 7:20pm.
Warm Up Last time, we proved the Degree n Theorem: Degree n Theorem. A nonconstant, degree n polynomial has exactly n roots. Suppose the polynomial is f (x) = a n x n + a n 1 x n 1 + + a 1 x 1 + a 0. Then
More informationReconnect 04 Introduction to Integer Programming
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, Reconnect 04 Introduction to Integer Programming Cynthia Phillips, Sandia National Laboratories Integer programming
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 24: Discrete Optimization
15.081J/6.251J Introduction to Mathematical Programming Lecture 24: Discrete Optimization 1 Outline Modeling with integer variables Slide 1 What is a good formulation? Theme: The Power of Formulations
More informationNetwork Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique
More informationDiscrete planning (an introduction)
Sistemi Intelligenti Corso di Laurea in Informatica, A.A. 2017-2018 Università degli Studi di Milano Discrete planning (an introduction) Nicola Basilico Dipartimento di Informatica Via Comelico 39/41-20135
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationLinear integer programming and its application
Linear integer programming and its application Presented by Dr. Sasthi C. Ghosh Associate Professor Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata, India Outline Introduction
More information47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 2 Date: 03/18/2010
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture Date: 03/18/010 We saw in the previous lecture that a lattice Λ can have many bases. In fact, if Λ is a lattice of a subspace L with
More informationGeneration and Representation of Piecewise Polyhedral Value Functions
Generation and Representation of Piecewise Polyhedral Value Functions Ted Ralphs 1 Joint work with Menal Güzelsoy 2 and Anahita Hassanzadeh 1 1 COR@L Lab, Department of Industrial and Systems Engineering,
More informationGUIDED NOTES 2.5 QUADRATIC EQUATIONS
GUIDED NOTES 5 QUADRATIC EQUATIONS LEARNING OBJECTIVES In this section, you will: Solve quadratic equations by factoring. Solve quadratic equations by the square root property. Solve quadratic equations
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationModelli Lineari (Generalizzati) e SVM
Modelli Lineari (Generalizzati) e SVM Corso di AA, anno 2018/19, Padova Fabio Aiolli 19/26 Novembre 2018 Fabio Aiolli Modelli Lineari (Generalizzati) e SVM 19/26 Novembre 2018 1 / 36 Outline Linear methods
More informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationIV. Violations of Linear Programming Assumptions
IV. Violations of Linear Programming Assumptions Some types of Mathematical Programming problems violate at least one condition of strict Linearity - Deterministic Nature - Additivity - Direct Proportionality
More informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationA Benders Algorithm for Two-Stage Stochastic Optimization Problems With Mixed Integer Recourse
A Benders Algorithm for Two-Stage Stochastic Optimization Problems With Mixed Integer Recourse Ted Ralphs 1 Joint work with Menal Güzelsoy 2 and Anahita Hassanzadeh 1 1 COR@L Lab, Department of Industrial
More informationNumerical Optimization. Review: Unconstrained Optimization
Numerical Optimization Finding the best feasible solution Edward P. Gatzke Department of Chemical Engineering University of South Carolina Ed Gatzke (USC CHE ) Numerical Optimization ECHE 589, Spring 2011
More informationMASTER in PHYSICS. For each curriculum there are: 1. MANDATORY COURSES 2. 5 ELECTIVE COURSES THAT MUST BE CHOSEN IN APPROPRIATE LISTS
MASTER in PHYSICS For each curriculum there are: 1. MANDATORY COURSES 2. 5 ELECTIVE COURSES THAT MUST BE CHOSEN IN APPROPRIATE LISTS 3. 2 ELECTIVE COURSES WITH NO CONSTRAINTS THE CURRICULUM AND THE ELECTIVE
More information0-1 Reformulations of the Network Loading Problem
0-1 Reformulations of the Network Loading Problem Antonio Frangioni 1 frangio@di.unipi.it Bernard Gendron 2 bernard@crt.umontreal.ca 1 Dipartimento di Informatica Università di Pisa Via Buonarroti, 2 56127
More informationLagrangean relaxation
Lagrangean relaxation Giovanni Righini Corso di Complementi di Ricerca Operativa Joseph Louis de la Grange (Torino 1736 - Paris 1813) Relaxations Given a problem P, such as: minimize z P (x) s.t. x X P
More informationLogistics. Lecture notes. Maria Grazia Scutellà. Dipartimento di Informatica Università di Pisa. September 2015
Logistics Lecture notes Maria Grazia Scutellà Dipartimento di Informatica Università di Pisa September 2015 These notes are related to the course of Logistics held by the author at the University of Pisa.
More informationMath 1314 Lesson 4 Limits
Math 1314 Lesson 4 Limits Finding a it amounts to answering the following question: What is happening to the y-value of a function as the x-value approaches a specific target number? If the y-value is
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationCurriculum Vitae di Marco Castellani
Curriculum Vitae di Marco Castellani 1 Dati personali Data di nascita: 14 giugno 1965. Luogo di nascita: Pisa (PI), Italia 1.1 Posizione attuale Professore Ordinario (Settore Scientifico Disciplinare SECS-S/06
More informationif t 1,...,t k Terms and P k is a k-ary predicate, then P k (t 1,...,t k ) Formulas (atomic formulas)
FOL Query Evaluation Giuseppe De Giacomo Università di Roma La Sapienza Corso di Seminari di Ingegneria del Software: Data and Service Integration Laurea Specialistica in Ingegneria Informatica Università
More informationLinear Discrimination Functions
Laurea Magistrale in Informatica Nicola Fanizzi Dipartimento di Informatica Università degli Studi di Bari November 4, 2009 Outline Linear models Gradient descent Perceptron Minimum square error approach
More informationMODELLO SCHEDA INSEGNAMENTO. I Francesco Fiorillo Mauro Pagnozzi
Corso di L/LM/LMCU Denominazione insegnamento: MODELLO SCHEDA INSEGNAMENTO Numero di Crediti: 6 Semestre: Docente Titolare: Dottorandi/assegnisti di ricerca che svolgono attività didattica a supporto del
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationA note on : A Superior Representation Method for Piecewise Linear Functions
A note on : A Superior Representation Method for Piecewise Linear Functions Juan Pablo Vielma Business Analytics and Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights,
More informationChapter 1: Foundations for Algebra
Chapter 1: Foundations for Algebra 1 Unit 1: Vocabulary 1) Natural Numbers 2) Whole Numbers 3) Integers 4) Rational Numbers 5) Irrational Numbers 6) Real Numbers 7) Terminating Decimal 8) Repeating Decimal
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More informationAM 121: Intro to Optimization! Models and Methods! Fall 2018!
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 15: Cutting plane methods Yiling Chen SEAS Lesson Plan Cut generation and the separation problem Cutting plane methods Chvatal-Gomory
More informationCHAPTER 3: INTEGER PROGRAMMING
CHAPTER 3: INTEGER PROGRAMMING Overview To this point, we have considered optimization problems with continuous design variables. That is, the design variables can take any value within a continuous feasible
More informationOptimization Models and Applications
Optimization Models and Applications Martin Takáč ISE 316, Fall 2014, Lecture 1 September 3, 2014 Martin Takáč ISE 316 Fall 2014 1 / 33 Outline Course Information Example of an Optimization Problem Terminology
More informationStochastic Integer Programming
IE 495 Lecture 20 Stochastic Integer Programming Prof. Jeff Linderoth April 14, 2003 April 14, 2002 Stochastic Programming Lecture 20 Slide 1 Outline Stochastic Integer Programming Integer LShaped Method
More informationValid Inequalities for Optimal Transmission Switching
Valid Inequalities for Optimal Transmission Switching Hyemin Jeon Jeff Linderoth Jim Luedtke Dept. of ISyE UW-Madison Burak Kocuk Santanu Dey Andy Sun Dept. of ISyE Georgia Tech 19th Combinatorial Optimization
More information2001 Dennis L. Bricker Dept. of Industrial Engineering The University of Iowa. Reducing dimensionality of DP page 1
2001 Dennis L. Bricker Dept. of Industrial Engineering The University of Iowa Reducing dimensionality of DP page 1 Consider a knapsack with a weight capacity of 15 and a volume capacity of 12. Item # Value
More informationto work with) can be solved by solving their LP relaxations with the Simplex method I Cutting plane algorithms, e.g., Gomory s fractional cutting
Summary so far z =max{c T x : Ax apple b, x 2 Z n +} I Modeling with IP (and MIP, and BIP) problems I Formulation for a discrete set that is a feasible region of an IP I Alternative formulations for the
More informationLarge-scale optimization and decomposition methods: outline. Column Generation and Cutting Plane methods: a unified view
Large-scale optimization and decomposition methods: outline I Solution approaches for large-scaled problems: I Delayed column generation I Cutting plane methods (delayed constraint generation) 7 I Problems
More informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University MOA 2016, Beijing, China, 27 June 2016 What Is This Talk
More informationInteger Programming Introduction. C, T int (3) 6C +7T 21 (1) Maximize : 12C +13T Subject to
Integer Programming Introduction Divisibility assumption of LP allows for fractions: Produce 7.8 units of a product, buy 12500.33 liters of oil, hire 12.123 people for full time. Clearly some activities
More informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University COLGEN 2016, Buzios, Brazil, 25 May 2016 What Is This Talk
More informationStatistics for classification
AstroInformatics Statistics for classification Una rappresentazione utile è la matrice di confusione. L elemento sulla riga i e sulla colonna j è il numero assoluto oppure la percentuale di casi della
More informationis called an integer programming (IP) problem. model is called a mixed integer programming (MIP)
INTEGER PROGRAMMING Integer Programming g In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationMultiobjective Mixed-Integer Stackelberg Games
Solving the Multiobjective Mixed-Integer SCOTT DENEGRE TED RALPHS ISE Department COR@L Lab Lehigh University tkralphs@lehigh.edu EURO XXI, Reykjavic, Iceland July 3, 2006 Outline Solving the 1 General
More informationCHAPTER 1: Functions
CHAPTER 1: Functions 1.1: Functions 1.2: Graphs of Functions 1.3: Basic Graphs and Symmetry 1.4: Transformations 1.5: Piecewise-Defined Functions; Limits and Continuity in Calculus 1.6: Combining Functions
More informationwhere X is the feasible region, i.e., the set of the feasible solutions.
3.5 Branch and Bound Consider a generic Discrete Optimization problem (P) z = max{c(x) : x X }, where X is the feasible region, i.e., the set of the feasible solutions. Branch and Bound is a general semi-enumerative
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationEE364a Review Session 5
EE364a Review Session 5 EE364a Review announcements: homeworks 1 and 2 graded homework 4 solutions (check solution to additional problem 1) scpd phone-in office hours: tuesdays 6-7pm (650-723-1156) 1 Complementary
More informationCURRICULUM VITÆ Mariapia Palombaro
Personal data CURRICULUM VITÆ Mariapia Palombaro May 2013 Name: Mariapia Palombaro Date of Birth: 12 August 1976 Place of Birth: Chieti (Ch), Italy Citizenship: Italian Civil Status: Married, one child
More informationDerivatives: definition and computation
Math 10A September 6, 2016 Announcements The breakfasts tomorrow and Thursday are full, but there are spaces at the 8AM breakfast on September 13. This is a breakfast from last semester. The gentleman
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationFactoring Polynomials. Review and extend factoring skills. LEARN ABOUT the Math. Mai claims that, for any natural number n, the function
Factoring Polynomials GOAL Review and extend factoring skills. LEARN ABOUT the Math Mai claims that, for any natural number n, the function f (n) 5 n 3 1 3n 2 1 2n 1 6 always generates values that are
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationInteger Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
More informationThe Separation Problem for Binary Decision Diagrams
The Separation Problem for Binary Decision Diagrams J. N. Hooker Joint work with André Ciré Carnegie Mellon University ISAIM 2014 Separation Problem in Optimization Given a relaxation of an optimization
More informationCORSO DI LAUREA MAGISTRALE IN FISICA COD. 0518H CLASSE LM-17 (FISICA) A.A. 2017/18
Dipartimento di Fisica SCHEMA PER LA SCELTA DEI PIANI SI STUDIO INDIVIDUALI CORSO DI LAUREA MAGISTRALE IN FISICA COD. 0518H CLASSE LM-17 (FISICA) A.A. 2017/18 Sequenza: a) Lo studente sceglie il percorso
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More informationINTRO TO MATH PROGRAMMING MA/OR 504, FALL 2015 LECTURE 11
INTRO TO MATH PROGRAMMING MA/OR 504, FALL 2015 LECTURE 11 A COMPLEXITY THEORY CRASH COURSE What is an algorithm? Precise definition requires a model of computation You might have heard some of these (won
More informationCutting Plane Separators in SCIP
Cutting Plane Separators in SCIP Kati Wolter Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies 1 / 36 General Cutting Plane Method MIP min{c T x : x X MIP }, X MIP := {x
More informationDiscrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P
Discrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Lagrangian
More informationLinear Programming. Operations Research. Anthony Papavasiliou 1 / 21
1 / 21 Linear Programming Operations Research Anthony Papavasiliou Contents 2 / 21 1 Primal Linear Program 2 Dual Linear Program Table of Contents 3 / 21 1 Primal Linear Program 2 Dual Linear Program Linear
More informationCSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017
CSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017 Linear Function f: R n R is linear if it can be written as f x = a T x for some a R n Example: f x 1, x 2 =
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More informationUna descrizione della Teoria della Complessità, e più in generale delle classi NP-complete, possono essere trovate in:
AA. 2014/2015 Bibliography Una descrizione della Teoria della Complessità, e più in generale delle classi NP-complete, possono essere trovate in: M. R. Garey and D. S. Johnson, Computers and Intractability:
More informationInteger Linear Programming
Integer Linear Programming Solution : cutting planes and Branch and Bound Hugues Talbot Laboratoire CVN April 13, 2018 IP Resolution Gomory s cutting planes Solution branch-and-bound General method Resolution
More informationPROBLEM SET 3: PROOF TECHNIQUES
PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework
More informationWelfare Maximization in Combinatorial Auctions
Welfare Maximization in Combinatorial Auctions Professor Greenwald 2018-03-14 We introduce the VCG mechanism, a direct auction for multiple goods, and argue that it is both welfare-imizing and DSIC. 1
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More information4y Springer NONLINEAR INTEGER PROGRAMMING
NONLINEAR INTEGER PROGRAMMING DUAN LI Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Shatin, N. T. Hong Kong XIAOLING SUN Department of Mathematics Shanghai
More informationCritical Reading of Optimization Methods for Logical Inference [1]
Critical Reading of Optimization Methods for Logical Inference [1] Undergraduate Research Internship Department of Management Sciences Fall 2007 Supervisor: Dr. Miguel Anjos UNIVERSITY OF WATERLOO Rajesh
More informationELENCO COMPLETO LAVORI. Dott.ssa Cristina TABLINO POSSIO Ricercatore confermato - settore Analisi Numerica (MAT08) Università di Milano Bicocca
ELENCO COMPLETO LAVORI Dott.ssa Cristina TABLINO POSSIO Ricercatore confermato - settore Analisi Numerica (MAT08) Università di Milano Bicocca Lavori su rivista A-1. L. Pellegrini, C. Tablino Possio, S.
More informationMath 1302 Notes 2. How many solutions? What type of solution in the real number system? What kind of equation is it?
Math 1302 Notes 2 We know that x 2 + 4 = 0 has How many solutions? What type of solution in the real number system? What kind of equation is it? What happens if we enlarge our current system? Remember
More informationConvex Optimization M2
Convex Optimization M2 Lecture 8 A. d Aspremont. Convex Optimization M2. 1/57 Applications A. d Aspremont. Convex Optimization M2. 2/57 Outline Geometrical problems Approximation problems Combinatorial
More informationLearning to Branch. Ellen Vitercik. Joint work with Nina Balcan, Travis Dick, and Tuomas Sandholm. Published in ICML 2018
Learning to Branch Ellen Vitercik Joint work with Nina Balcan, Travis Dick, and Tuomas Sandholm Published in ICML 2018 1 Integer Programs (IPs) a maximize subject to c x Ax b x {0,1} n 2 Facility location
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationStructure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts
Structure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University Joint work with Sercan Yıldız
More informationA BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY
APPLICATIONES MATHEMATICAE 23,2 (1995), pp. 151 167 G. SCHEITHAUER and J. TERNO (Dresden) A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY Abstract. Many numerical computations
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationA note on : A Superior Representation Method for Piecewise Linear Functions by Li, Lu, Huang and Hu
A note on : A Superior Representation Method for Piecewise Linear Functions by Li, Lu, Huang and Hu Juan Pablo Vielma, Shabbir Ahmed and George Nemhauser H. Milton Stewart School of Industrial and Systems
More informationBranch-and-Bound. Leo Liberti. LIX, École Polytechnique, France. INF , Lecture p. 1
Branch-and-Bound Leo Liberti LIX, École Polytechnique, France INF431 2011, Lecture p. 1 Reminders INF431 2011, Lecture p. 2 Problems Decision problem: a question admitting a YES/NO answer Example HAMILTONIAN
More informationChapter 1: Foundations for Algebra
Chapter 1: Foundations for Algebra 1 Unit 1: Vocabulary 1) Natural Numbers 2) Whole Numbers 3) Integers 4) Rational Numbers 5) Irrational Numbers 6) Real Numbers 7) Terminating Decimal 8) Repeating Decimal
More informationLecture 23 Branch-and-Bound Algorithm. November 3, 2009
Branch-and-Bound Algorithm November 3, 2009 Outline Lecture 23 Modeling aspect: Either-Or requirement Special ILPs: Totally unimodular matrices Branch-and-Bound Algorithm Underlying idea Terminology Formal
More informationComplex Numbers. Integers, Rationals, and Reals. The natural numbers: The integers:
Complex Numbers Integers, Rationals, and Reals The natural numbers: N {... 3, 2,, 0,, 2, 3...} The integers: Z {... 3, 2,, 0,, 2, 3...} Note that any two integers added, subtracted, or multiplied together
More information1 The linear algebra of linear programs (March 15 and 22, 2015)
1 The linear algebra of linear programs (March 15 and 22, 2015) Many optimization problems can be formulated as linear programs. The main features of a linear program are the following: Variables are real
More informationVITONOFRIO CRISMALE CONTACTS
VITONOFRIO CRISMALE CONTACTS Dipartimento di Matematica, Università degli studi di Bari Aldo Moro Via E. Orabona, 4 70125 Bari (Italy) E-mail: vitonofrio.crismale@uniba.it Phone: +390805442664 PRESENT
More informationIndicator Constraints in Mixed-Integer Programming
Indicator Constraints in Mixed-Integer Programming Andrea Lodi University of Bologna, Italy - andrea.lodi@unibo.it Amaya Nogales-Gómez, Universidad de Sevilla, Spain Pietro Belotti, FICO, UK Matteo Fischetti,
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationMVE165/MMG630, Applied Optimization Lecture 6 Integer linear programming: models and applications; complexity. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming: models and applications; complexity Ann-Brith Strömberg 2011 04 01 Modelling with integer variables (Ch. 13.1) Variables Linear programming (LP) uses continuous
More information