AMPL Integer Linear Programming And Sensitivity Analysis for LP. ORLAB Operations Research Laboratory. Borzou Rostami. Politecnico di Milano, Italy
|
|
- Sarah Thompson
- 6 years ago
- Views:
Transcription
1 AMPL Integer Linear Programming And Sensitivity Analysis for LP ORLAB Operations Research Laboratory Borzou Rostami Politecnico di Milano, Italy December 6, 2012
2 Integer Programming: Many linear programming problems require certain variables to have whole number, or integer, values. Such a requirement arises naturally when the variables represent entities like packages or people that cannot be fractionally divided - at least, not in a meaningful way for the situation being modeled. Integer variables also play a role in formulating equation systems that model logical conditions. Integer variables Consider the diet problem in session 2. ampl: model diet.mod; data diet.dat; ampl: solve; CPLEX : optimal solution; objective dual simplex iterations (0 in phase I) ampl: print{j in J} (j,x[j]); Bread 4 Milk 3 Eggs 1 Meat Cake 0 We want the foods to be purchased in integral amounts.
3 By adding the keyword integer to the qualifying phrases of a var declaration, you restrict the declared variables to integer values. (var x{j in J} integer >= 0, <= q[j];) We can then try to re-solve: ampl: model diet.mod; data diet.dat; solve; CPLEX : optimal integer solution; objective MIP simplex iterations 0 branch-and-bound nodes ampl: print {j in J} (j,x[j]); Bread 2 Milk 3 Eggs 1 Meat 2 Cake 0 Comparing this solution to the previous one, we see a few features typical of integer programming.
4 The minimum cost has increased from 3.37 to 3.62; because integrality is an additional constraint on the values of the variables, it can only make the objective less favorable. The amounts of the different foods in the diet have also changed. Meat that had fractional amounts in the original optimum, have increased from to 2. Bread has dropped from the upper limit of 4 to 2. Note: Clearly, you cannot always deduce the integer optimum by rounding the noninteger optimum to the closest integer values.
5 Binary Variables: Set covering Problem: In the set covering problem, we are given a universe U, such that U = n, and the sets,..., U. Set Cover: A set cover is a collection S of some of the sets from,..., whose union is the entire universe U. Formally, S is a set cover if. If be the cost associated to set e would like to select a set cover S with the minimum cost.
6 Example: Suppose U= {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} and = {1, 2, 3, 8, 9, 10}, = {1, 2, 3, 4, 5}, = {4, 5, 7}, = {5, 6, 7}, and = {6, 7, 8, 9, 10}. Find a set cover with a minimum cost.
7 { { Formulation: S.t. { }
8 AMPL model file (Setcovering.mod)
9 AMPL data file (Setcovering.dat)
10 Fixed Cost problem: Gandy Cloth Company is capable of manufacturing three types of clothing: Shirts, shorts, and pants. The manufacture of each type of clothing requires that Gandy have the appropriate type of machinery available. This machinery can be rented at the following rates: shirt machinery, $200/week; shorts machinery, $150/week; pants machinery, $100/week. Each type of clothing requires the amount of cloth and labor given in the table below. The sales price and variable cost are also given in the table. Labor Hours Cloth (sq. m) Sales Price Variable Cost Shirts 3 4 $12 $6 Shorts 2 3 $8 $4 Pants 6 4 $15 $8 Available: 150 hours 160 sq. m Given an integer linear programming formulation for the problem
11 Formulation: : The quantity of clothing of type j { { }
12
13 AMPL data file (Fixedcost.dat)
14 Assignment Problem: A company has 4 machines available for assignment to 4 tasks. Any machine can be assigned to any task, and each task requires processing by one machine. The time required to set up each machine for the processing of each task is given in the table below. TIME (Hours) Task1 Task2 Task3 Task4 Machine Machine Machine Machine The company wants to minimize the total setup time needed for the processing of all four tasks.
15 { Formulation: S.t. { }
16 AMPL model file (assignment.mod)
17 AMPL data file (assignment.dat)
18 MINOS 5.5: ignoring integrality of 16 variables MINOS 5.5: optimal solution found. 8 iterations, objective 11 ampl: option solver cplex; ampl: solve; CPLEX : optimal integer solution; objective 11 5 MIP simplex iterations 0 branch-and-bound nodes ampl: option omit_zero_rows 1; ampl: display x; x := Machine1 Task2 1 Machine2 Task4 1 Machine3 Task3 1 Machine4 Task1 1 ;
19 Uncapacitated Facility Location (UFL) Given a set of potential depots and a set of clients (or customers), suppose there is a fixed cost associated with the use of depot j, and a transportation cost if all of client i s order is delivered from depot j. The problem is to decide which depots to open, and which depots serves each client so as to minimize the sum of fixed and transportation cost.
20 AMPL commands for Sensitivity Analysis option presolve 0; option solver cplex; option cplex_options sensitivity presolve=0 ; 1- display <var name>.rc; Displays the reduced cost of the variable named <var name>. 2- display <var name>.down ; Displays, respectively, the lower and upper endpoints of display <var name>.up; the range of the objective-function coefficient of the variable named <var name> for which the current basis remains optimal.
21 3- display <var name>.current; Displays the current value of the objective-function coefficient of the variable named <var name>. 4- display <constr name>; Displays the shadow price of the constraint <constr name>. 5- display <constr name>.down; Displays, respectively, the lower and upper endpoints of display <constr name>.up; the range of the right-hand-side of the constraint named <constr name> for which the current basis remains feasible, and hence optimal. 6- display <constr name>.current; Displays the current value of the right-hand-side of the constraint named <constr name>.
22 7- display <constr name>.slack; Displays the slack in the constraint named <constr name>. 8- let <name>:=<value>; Assigns the variable or parameter named <name> the <value>. Useful for making small changes to the LP For larger changes, use "reset data; data <new data-file>;" Remember that the theory of sensitivity analysis is developed only for linear programs. If integer variables are present, it can only be carried out for the corresponding continuous relaxation. In such case, add the command option relax integrality 1 ;
23 Some useful AMPL commands expand; Displays the current LP model with the instantiated data. Useful for debugging and in sensitivity analysis to know which LP AMPL is really solving. Can also type "expand <name>;", where <name> is the name of a constraint or objective function to display only the given constraint or objective function instantiated with data. show; Displays the names of the sets, parameters, variables, constraints, and objective function of current LP model. Can also type "show <name>;" where <name> is the name of a set, parameter, variable, constraint or objective function.
24 reset; AMPL always works with a current LP model, and "reset;" resets the current AMPL LP to the empty LP. Useful if you want to solve multiple LPs in the same session. reset data; Resets only the data of the current LP model retaining the model.
25 Downloading AMPL Student Edition Software My Address Lab session web site
AMPL Integer Linear Programming. ORLAB Operations Research Laboratory. Borzou Rostami. Politecnico di Milano, Italy.
AMPL Integer Linear Programming ORLAB Operations Research Laboratory Borzou Rostami Politecnico di Milano, Italy January 18, 2012 Integer Programming: Many linear programming problems require certain variables
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationInteger Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Integer Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Integer Programming 1 / 42
More informationAMPL Network Optimization
AMPL Network Optimization ORLAB Operations Research Laboratory Borzou Rostami Politecnico di Milano, Italy December 14, 2011 Network Optimization Shortest path models Consider the problem of finding the
More informationThe Ascendance of the Dual Simplex Method: A Geometric View
The Ascendance of the Dual Simplex Method: A Geometric View Robert Fourer 4er@ampl.com AMPL Optimization Inc. www.ampl.com +1 773-336-AMPL U.S.-Mexico Workshop on Optimization and Its Applications Huatulco
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 10: Optimisation (1) A/Prof Chun Tung Chou CSE, UNSW COMP9334, Chun Tung Chou, 2016 Three Weeks of Optimisation The lectures for these
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing
More informationSection Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018
Section Notes 4 Duality, Sensitivity, and the Dual Simplex Algorithm Applied Math / Engineering Sciences 121 Week of October 8, 2018 Goals for the week understand the relationship between primal and dual
More informationFoundations of Operations Research Introduction to AMPL and Modellisation
Foundations of Operations Research Introduction to AMPL and Modellisation Pierre Hosteins hosteins@di.unito.it Politecnico di Milano October 17th 2013 Use of scripts in AMPL Problems of Linear Programming:
More informationV. Solving Integer Linear Programs
Optimization Methods Draft of August 26, 2005 V. Solving Integer Linear Programs Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston, Illinois 60208-3119,
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationContents. Introduction
Contents Introduction xv Chapter 1. Production Models: Maximizing Profits 1 1.1 A two-variable linear program 2 1.2 The two-variable linear program in AMPL 5 1.3 A linear programming model 6 1.4 The linear
More informationNotes on AMPL for and (Adapted from notes by Sommer Gentry)
Notes on AMPL for 16.410 and 16.413 (Adapted from notes by Sommer Gentry) User Guides for MS-Dos and UNIX: http://www.ampl.com/refs/index.html#os_links About AMPL/CPLEX AMPL stands for A Mathematical Programming
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationRyerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003
Ryerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003 MTH 503 - Operations Research I Duration: 3 Hours. Aids allowed: Two sheets of notes
More informationSolving Linear and Integer Programs
Solving Linear and Integer Programs Robert E. Bixby Gurobi Optimization, Inc. and Rice University Overview Linear Programming: Example and introduction to basic LP, including duality Primal and dual simplex
More informationOutline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk Outline History The Simplex algorithm (re-visited) Column Generation as an extension of the Simplex algorithm A simple example! DTU-Management
More informationColumn Generation: Cutting Stock
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline History The Simplex algorithm (re-visited) Column Generation as an extension
More informationBCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.
Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method
More informationThe MIP-Solving-Framework SCIP
The MIP-Solving-Framework SCIP Timo Berthold Zuse Institut Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 23.05.2007 What Is A MIP? Definition MIP The optimization problem
More informationTIM 206 Lecture Notes Integer Programming
TIM 206 Lecture Notes Integer Programming Instructor: Kevin Ross Scribe: Fengji Xu October 25, 2011 1 Defining Integer Programming Problems We will deal with linear constraints. The abbreviation MIP stands
More informationMath 464 (Spring 2007) Introduction to AMPL
Math464 - Feb 13, 2007 1 Math 464 (Spring 2007) Introduction to AMPL Details of how to download and start up the student version of AMPL are given in http://www.ampl.com. Download and install AMPL in your
More informationAlgorithms for Decision Support. Integer linear programming models
Algorithms for Decision Support Integer linear programming models 1 People with reduced mobility (PRM) require assistance when travelling through the airport http://www.schiphol.nl/travellers/atschiphol/informationforpassengerswithreducedmobility.htm
More informationProgramming in OOP/C++
Introduction Lecture 3-2 Programming in OOP/C++ Arrays Part (2) By Assistant Professor Dr. Ali Kattan 1 Arrays Examples Solutions for previous assignments Write a program to enter and store your name and
More informationIntroduction to AMPL (Math 464, Spring 2018)
Math464 - AMPL Handout 1 Introduction to AMPL (Math 464, Spring 2018) Details of how to download and start up the demo version of AMPL are given in http://www.ampl.com. Download and install AMPL in your
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 7 Discrete optimization models and applications; complexity
MVE165/MMG631 Linear and integer optimization with applications Lecture 7 Discrete optimization models and applications; complexity Ann-Brith Strömberg 2019 04 09 Lecture 7 Linear and integer optimization
More informationAdvanced Operations Research Techniques IE316. Lecture 10. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Lecture 10 Dr. Ted Ralphs IE316 Lecture 10 1 Reading for This Lecture AMPL Book: Chapter 1 AMPL: A Mathematical Programming Language IE316 Lecture 10 2 Software
More informationInteger Programming Chapter 9
1 Integer Programming Chapter 9 University of Chicago Booth School of Business Kipp Martin October 30, 2017 2 Outline Branch and Bound Theory Branch and Bound Linear Programming Node Selection Strategies
More informationModelling of LP-problems (2WO09)
Modelling of LP-problems (2WO09) assignor: Judith Keijsper room: HG 9.31 email: J.C.M.Keijsper@tue.nl course info : http://www.win.tue.nl/ jkeijspe Technische Universiteit Eindhoven meeting 1 J.Keijsper
More informationHomework 2: Multi-unit combinatorial auctions (due Nov. 7 before class)
CPS 590.1 - Linear and integer programming Homework 2: Multi-unit combinatorial auctions (due Nov. 7 before class) Please read the rules for assignments on the course web page. Contact Vince (conitzer@cs.duke.edu)
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationOPTIMIZAÇÃO E DECISÃO 09/10
OPTIMIZAÇÃO E DECISÃO 09/10 PL #7 Integer Programming Alexandra Moutinho (from Hillier & Lieberman Introduction to Operations Research, 8 th edition) Problem 1 Pawtucket University is planning to buy new
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationMath Models of OR: The Simplex Algorithm: Practical Considerations
Math Models of OR: The Simplex Algorithm: Practical Considerations John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Simplex Algorithm: Practical Considerations
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 35 Quadratic Programming In this lecture, we continue our discussion on
More informationLinear Programming. L.W. Dasanayake Department of Economics University of Kelaniya
Linear Programming L.W. Dasanayake Department of Economics University of Kelaniya Linear programming (LP) LP is one of Management Science techniques that can be used to solve resource allocation problem
More informationIntroduction. Chapter 15. Optimization Modeling: Applications. Integer Programming. Manufacturing Example. Three Types of ILP Models
Chapter 5 Optimization Modeling: Applications Integer Programming Introduction When one or more variables in an LP problem must assume an integer value we have an Integer Linear Programming (ILP) problem.
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationBuilding Optimization-Enabled Applications Using AMPL API
Building Optimization-Enabled Applications Using AMPL API Robert Fourer 4er@ampl.com AMPL Optimization Inc. www.ampl.com +1 773-336-AMPL INFORMS Annual Meeting Nashville 13-16 November 2016 Session TA19
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 5.05 Introduction to Optimization (Spring 005) Problem Set 8, Due April 4, 005 You will need 4.5 points out of 5 to receive a grade of.5.. Integer Programming and
More informationCloud Branching MIP workshop, Ohio State University, 23/Jul/2014
Cloud Branching MIP workshop, Ohio State University, 23/Jul/2014 Timo Berthold Xpress Optimization Team Gerald Gamrath Zuse Institute Berlin Domenico Salvagnin Universita degli Studi di Padova This presentation
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationInteger Programming Explained Through Gomory s Cutting Plane Algorithm and Column Generation
Integer Programming Explained Through Gomory s Cutting Plane Algorithm and Column Generation Banhirup Sengupta, Dipankar Mondal, Prajjal Kumar De, Souvik Ash Proposal Description : ILP [integer linear
More informationMath Introduction to Operations Research
Math 300 Introduction to Operations Research Examination (50 points total) Solutions. (6 pt total) Consider the following linear programming problem: Maximize subject to and x, x, x 3 0. 3x + x + 5x 3
More informationGurobi Guidelines for Numerical Issues February 2017
Gurobi Guidelines for Numerical Issues February 2017 Background Models with numerical issues can lead to undesirable results: slow performance, wrong answers or inconsistent behavior. When solving a model
More informationPrepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.
Prepared By Handaru Jati, Ph.D Universitas Negeri Yogyakarta handaru@uny.ac.id Chapter 8 Using The Excel Solver To Solve Mathematical Programs Chapter Overview 8.1 Introduction 8.2 Formulating Mathematical
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationIntroduction to Mosel and Xpress
ORLAB - Operations Research Laboratory Politecnico di Milano, Italy April 15, 2011 From Modeling to Strategies Model Algorithms Solution(s) Problem Modeling Interpretation Strategy From Modeling to Strategies
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer
More informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationDesign and Analysis of Algorithms (V)
Design and Analysis of Algorithms (V) An Introduction to Linear Programming Guoqiang Li School of Software, Shanghai Jiao Tong University Homework Assignment 2 is announced! (deadline Apr. 10) Linear Programming
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More information9.4 SOME CHARACTERISTICS OF INTEGER PROGRAMS A SAMPLE PROBLEM
9.4 SOME CHARACTERISTICS OF INTEGER PROGRAMS A SAMPLE PROBLEM Whereas the simplex method is effective for solving linear programs, there is no single technique for solving integer programs. Instead, a
More informationBenders in a nutshell Matteo Fischetti, University of Padova
Benders in a nutshell Matteo Fischetti, University of Padova ODS 2017, Sorrento, September 2017 1 Benders decomposition The original Benders decomposition from the 1960s uses two distinct ingredients for
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More informationWorking Under Feasible Region Contraction Algorithm (FRCA) Solver Environment
Working Under Feasible Region Contraction Algorithm (FRCA) Solver Environment E. O. Effanga Department of Mathematics/Statistics and Comp. Science, University of Calabar P.M.B. 1115, Calabar, Cross River
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationColumnwise Formulations
16 Columnwise Formulations Because the fundamental idea of an optimization problem is to minimize or maximize a function of the decision variables, subject to constraints on them, AMPL is oriented toward
More informationChapter 7. Linear Programming Models: Graphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian
More information5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY
5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves
More information2 is not feasible if rounded. x =0,x 2
Integer Programming Definitions Pure Integer Programming all variables should be integers Mied integer Programming Some variables should be integers Binary integer programming The integer variables are
More informationSUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING
Bulletin of Mathematics Vol. 06, No. 0 (20), pp.. SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING Eddy Roflin, Sisca Octarina, Putra B. J Bangun,
More informationLesson 08 Linear Programming
Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationA hard integer program made easy by lexicography
Noname manuscript No. (will be inserted by the editor) A hard integer program made easy by lexicography Egon Balas Matteo Fischetti Arrigo Zanette February 16, 2011 Abstract A small but notoriously hard
More informationMath 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.
Math Lecture The greedy algorithm provides the initial transportation matrix. matrix P P Demand W ª «2 ª2 «W ª «W ª «ª «ª «Supply The circled x ij s are the initial basic variables. Erase all other values
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationEcon 172A - Slides from Lecture 2
Econ 205 Sobel Econ 172A - Slides from Lecture 2 Joel Sobel September 28, 2010 Announcements 1. Sections this evening (Peterson 110, 8-9 or 9-10). 2. Podcasts available when I remember to use microphone.
More informationAgenda. Understanding advanced modeling techniques takes some time and experience No exercises today Ask questions!
Modeling 2 Agenda Understanding advanced modeling techniques takes some time and experience No exercises today Ask questions! Part 1: Overview of selected modeling techniques Background Range constraints
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationThis matrix is not TU since the submatrix shown below has determinant of
EMIS 8373: Integer Programming [Homework 5 Solutions] 1 Problem 1 Problem 1 on page 50 of the Wolsey text book. (a) A 1 = 1 0 1 0 1 0 1 1 1 0 0 0 0 1 1 1 1 0 0 0 This matrix is not TU since the submatrix
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More informationBenders Decomposition
Benders Decomposition Using projections to solve problems thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline Introduction Using projections Benders decomposition Simple plant location
More informationDepartment of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):
Linköping University Optimization TAOP3(0) Department of Mathematics Examination Oleg Burdakov of 30 October 03 Assignment Consider the following linear programming problem (LP): max z = x + x s.t. x x
More informationSUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING
ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0156, 11 pages ISSN 2307-7743 http://scienceasia.asia SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING
More informationPrimal Heuristics in SCIP
Primal Heuristics in SCIP Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 10/11/2007 Outline 1 Introduction Basics Integration Into SCIP 2 Available
More informationResource Allocation (p. 254)
Linear Optimization 4.2 120 Resource Allocation (p. 254) Determine the linear program corresponding to the following problem. A farmer has set aside 18 acres of land to be used entirely for plots of grapes,
More informationIntegrating Optimization Modeling with General-Purpose Programming for Efficient and Reliable Application Deployment
Integrating Optimization Modeling with General-Purpose Programming for Efficient and Reliable Application Deployment Robert Fourer, Filipe Brandão AMPL Optimization {4er,fdabrandao}@ampl.com Christian
More information4 Integer Linear Programming (ILP)
TDA6/DIT37 DISCRETE OPTIMIZATION 17 PERIOD 3 WEEK III 4 Integer Linear Programg (ILP) 14 An integer linear program, ILP for short, has the same form as a linear program (LP). The only difference is that
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationLinear Programming. them such that they
Linear Programming l Another "Sledgehammer" in our toolkit l Many problems fit into the Linear Programming approach l These are optimization tasks where both the constraints and the objective are linear
More informationInteger Programming! Using linear programming to solve discrete problems
Integer Programming! Using linear programming to solve discrete problems Solving Discrete Problems Linear programming solves continuous problem! problems over the reai numbers.! For the remainder of the
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationThe AMPL approach. # used in distributing starting periods
Introduction We describe two approaches to a network scheduling problem, one using the student version of AMPL (Fourer, Gay and Kernighan 1993) which in turn can call one of a variety of l.p. solvers.
More informationa) Alternative Optima, b) Infeasible(or non existing) solution, c) unbounded solution.
Unit 1 Lesson 5. : Special cases of LPP Learning Outcomes Special cases of linear programming problems Alternative Optima Infeasible Solution Unboundedness In the previous lecture we have discussed some
More information4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1
4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1 Definition: A Linear Programming (LP) problem is an optimization problem: where min f () s.t. X n the
More informationLinear & Integer Programming: A Decade of Computation
Linear & Integer Programming: A Decade of Computation Robert E. Bixby, Mary Fenelon, Zongao Gu, Irv Lustig, Ed Rothberg, Roland Wunderling 1 Outline Progress in computing machines Linear programming (LP)
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationMathematical programming formulations using AMPL
Mathematical programming formulations using AMPL Darin England September 4, 2011 Introduction This article is a supplement to the course IE 5112, Introduction to Operations Research, in the Industrial
More informationFinancial Optimization ISE 347/447. Lecture 13. Dr. Ted Ralphs
Financial Optimization ISE 347/447 Lecture 13 Dr. Ted Ralphs ISE 347/447 Lecture 13 1 Reading for This Lecture C&T Chapter 11 ISE 347/447 Lecture 13 2 Integer Linear Optimization An integer linear optimization
More informationApproximation Algorithms: The Primal-Dual Method. My T. Thai
Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the
More informationApproximation Algorithms
Approximation Algorithms Group Members: 1. Geng Xue (A0095628R) 2. Cai Jingli (A0095623B) 3. Xing Zhe (A0095644W) 4. Zhu Xiaolu (A0109657W) 5. Wang Zixiao (A0095670X) 6. Jiao Qing (A0095637R) 7. Zhang
More informationEcon 172A - Slides from Lecture 9
1 Econ 172A - Slides from Lecture 9 Joel Sobel October 25, 2012 2 Announcements Important: Midterm seating assignments. Posted. Corrected Answers to Quiz 1 posted. Midterm on November 1, 2012. Problems
More information