OPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano
|
|
- Vanessa Woods
- 5 years ago
- Views:
Transcription
1 OPTIMIZATION joint course with Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi DEIB Politecnico di Milano Website: Academic year Edoardo Amaldi (PoliMI) Optimization Academic year / 15
2 Chapter 1: Introduction Optimization is one of the most active branches of applied mathematics with a very wide range of relevant applications. Course s aim: Present the main concepts and methods of discrete and nonlinear (continuous) optimization, covering also modeling aspects. Many decision-making problems cannot be appropriately formulated or approximated in terms of linear models due to intrinsic nonlinearity. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
3 Examples of non linearity 1) Production planning Determine the production levels so as to maximize the total profit while respecting the constraints on the availability of the various resources. - prices are elastic because the amount that can be sold is inversely proportional to the selling price; the unit profit of a good decreases when the amount produced increases. - costs are variable: they often depend on the amount produced, well-known phenomon of economy of scale. 2) Telecommunication network planning: the (average) delay increases as a nonlinear function with the total traffic volume. 3) Integrality constraint on a variable, for instance x Z, is nonlinear since it can be expressed as sin(πx) = 0. Note it is a very special type of nonlinearity. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
4 Examples of optimization problems and models 1) Location and transportation Case with a single type of product. Given n clients with known coordinates (a j,b j ) and demand d j, where j = 1...n, m warehouses indexed with i = 1...m. Suppose we know for each warehouse i the capacity p i and the area A i R 2 in which it can be located. Assumption: m i=1 p i n j=1 d j Decide where to locate the warehouses and how to distribute the product in order to minimize the transportation costs (proportional to the distance and the amount transported) while respecting the warehouse capacities and the client demands. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
5 Decision variables: (x i,y i ) coordinates of the i-th warehouse, 1 i m w ij amount of product transported from warehouse i to client j, 1 i m and 1 j n distance between warehouse i and client j, 1 i m and 1 j n t ij Optimization model: min s.t. m n i=1 j=1 w ijt ij n j=1 w ij p i m i=1 w ij d j t ij = (x i a j ) 2 +(y i b j ) 2 i,j (1) i j (x i,y i ) A i R 2 i w ij 0 t ij 0 i,j i,j N.B.: the variables t ij are not necessary, we can exploit equations (1) to substitute t ij in the objective function. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
6 2) Image reconstruction (Computer Tomography) Part of the body V R 3 subdivided into n small cells V j called voxels. Assumption: matter density is constant within each voxel (e.g., pixels). Problem: Given the measurements provided by m beams, reconstruct a 3-D image of V, that is, determine the density x j for each V j. i-the beam intersects a subset of voxels indexed by J i {1,...,n}. For every j J i, let a ij denote the path of the i-th beam within voxel V j. i-th beam attenuation depends on the total amount of matter on the way: j J i a ij x j. Let b i be the measurement of the i-th beam at the exit point. Given m beams with prescribed directions, we obtain the linear system: a ij x j = b i i = 1,...,m j J i x j 0 j = 1,...,n usually infeasible due to measurement errors, non uniformity of the V j s,... Edoardo Amaldi (PoliMI) Optimization Academic year / 15
7 Possibile formulation min m i=1 (b i j J i a ij x j ) 2 s.t. x j 0 j = 1,...,n. Since the number of voxels is usually larger than the number of beams (m < n), to avoid alternative optimal solutions we may minimize: m f(x) = (b i n a ij x j ) 2 +δ x j with δ > 0 j J i i=1 j=1 Various possible choices for the objective function f(x), which may involve nonlinear terms accounting for the properties of matter/image stochastic model of attenuation and an appropriate maximum likelihood estimator. Also the number of beams and their directions could be optimized. Current development: 4-D optimization considering time in order to account for respiratory motion. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
8 3) Combinatorial auctions With internet explosion the popularity of auctions has been growing. Participants (bidders) can place bids on combinations of discrete items, rather than individual items or continuous quantities. Examples: rare stamps or coins, airport time slots, wireless bandwidth, delivery routes, railroad segments,... Given a set of bidders N, a discrete set M of m distinct items being auctioned, for every subset of items S M, let b j (S) be the bid that bidder j N is willing to pay for subset S. Natural assumption: if S T = then b j (S)+b j (T) b j (S T) The bidder is willing to pay more for S T than for sets S and T individually (e.g., complete collection of rare stamps). Edoardo Amaldi (PoliMI) Optimization Academic year / 15
9 Key problem: Determine the winner of each item so as to maximize the total revenue. Let b(s) = max j N b j (S). For each subset S M, consider the binary decision variable x S with x S = 1 if the highest bid on subset S is accepted, and x S = 0 otherwise. Then the key problem can be formulated as: max s.t. S M b(s)x S S M : i S x S 1 i M x S {0,1} S M, involving 2 M variables, growing exponentially with the number of items. Note that, when x S = 1, the subset of items S is given to a bidder willing to pay the largest amount for it. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
10 General optimization problem min f(x) s.t. g i (x) 0 1 i m x S R n - the algebraic and set constraints define the feasible region X = S {x R n : g i (x) 0,1 i m}, - the objective function f(x) must be defined at least on X, namely f : X R, - the constraint functions g i (x) must be defined at least on S, namely g i : S R for i = 1,...,m. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
11 We just need to consider minimization problems since max{f(x) : x X} = min{ f(x) : x X}. Without loss of generality, we can also assume that all algebraic constraints are inequality constraints since g(x) = 0 { g(x) 0 g(x) 0. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
12 Solving a minimization problem to optimality amounts to finding a feasible solution that is globally optimal. Definition i) A feasible solution x X is a global optimum if f(x ) f(x) x X. ii) A feasible solution x X is a local optimum if ǫ > 0 such that f(x) f(x) x X N ǫ (x) where N ǫ (x) = {x X: x x ǫ}. For difficult problems, we have to settle for finding a good local optimum within a reasonable computing time. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
13 Main classes of optimization problems Terminology: programming optimization f g i S problem type linear linear S = R n Linear Programming (LP) linear linear S Z n Integer L. P. (ILP) linear linear S Z n 1 R n 2 with n = n 1 +n 2 Mixed Integer L. P. (MILP) at least one nonlinear S R n Nonlinear Programming (NLP) at least one nonlinear S Z n 1 R n 2 with n = n 1 +n 2 Mixed Integer NLP (MINLP) Some important special cases: Quadratic programming: f(x) = x T Qx +c T x with linear constraints Convex programming: f, the g i functions and S are, respectively, convex functions and convex set. Edoardo Amaldi (PoliMI) Optimization Academic year / 15
14 Some fields of application computational biology (determine the 3-D structure of proteins,...) health care planning and management (treatment planning, workforce scheduling, operating theater scheduling,...) optimal control (determine the trajectory of a robot arm, airplane, shuttle) logistics (location of plants and services, transportation, routing) and supply chain design and management data mining/machine learning: classification, clustering, approximation,... economics (risk management, portfolio optimization, combinatorial auctions, equilibria of games,...) production planning and inventory management (manufacturing, chemical processes, energy generation,...) network planning and management (wired and wireless telecommunications, electric networks,...) Edoardo Amaldi (PoliMI) Optimization Academic year / 15
15 Some fields of application management of environmental and territorial resources (water, forest,...) design of experiments (for chemical and pharmaceutical companies) signal and image processing (2-D and 3-D reconstruction) statistics (e.g., nonlinear regression, estimation of distribution parameters) agriculture and agri-food industry dimensioning and optimization of structures (bridge, aircraft profile,...)... Edoardo Amaldi (PoliMI) Optimization Academic year / 15
Chapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationChapter 4: Unconstrained nonlinear optimization
Chapter 4: Unconstrained nonlinear optimization Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-15-16.shtml Academic year 2015-16 Edoardo
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making (discrete optimization) problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock,
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock, crew scheduling, vehicle
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 information3.3 Easy ILP problems and totally unimodular matrices
3.3 Easy ILP problems and totally unimodular matrices Consider a generic ILP problem expressed in standard form where A Z m n with n m, and b Z m. min{c t x : Ax = b, x Z n +} (1) P(b) = {x R n : Ax =
More information5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1
5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Definition: An Integer Linear Programming problem is an optimization problem of the form (ILP) min
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 information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP Different spaces and objective functions but in general same optimal
More informationHandout 1: Introduction to Dynamic Programming. 1 Dynamic Programming: Introduction and Examples
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 1: Introduction to Dynamic Programming Instructor: Shiqian Ma January 6, 2014 Suggested Reading: Sections 1.1 1.5 of Chapter
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form Graphical representation
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More information4.7 Sensitivity analysis in Linear Programming
4.7 Sensitivity analysis in Linear Programming Evaluate the sensitivity of an optimal solution with respect to variations in the data (model parameters). Example: Production planning max n j n a j p j
More informationSECTION 5.1: Polynomials
1 SECTION 5.1: Polynomials Functions Definitions: Function, Independent Variable, Dependent Variable, Domain, and Range A function is a rule that assigns to each input value x exactly output value y =
More informationAgenda today. Introduction to prescriptive modeling. Linear optimization models through three examples: Beyond linear optimization
Agenda today Introduction to prescriptive modeling Linear optimization models through three examples: 1 Production and inventory optimization 2 Distribution system design 3 Stochastic optimization Beyond
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 informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
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 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 informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationIOE510/MATH561/OMS518: Linear Programming I
IOE510/MATH561/OMS518: Linear Programming I Lectures: Mondays and Wednesdays, 9:00-10:30 AM, IOE 1680 Instructor: Prof. Marina A. Epelman GSI: Katharina Ley Office hours: See CTools for most current info
More information5.5 Quadratic programming
5.5 Quadratic programming Minimize a quadratic function subject to linear constraints: 1 min x t Qx + c t x 2 s.t. a t i x b i i I (P a t i x = b i i E x R n, where Q is an n n matrix, I and E are the
More informationLecture Note 1: Introduction to optimization. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 1: Introduction to optimization Xiaoqun Zhang Shanghai Jiao Tong University Last updated: September 23, 2017 1.1 Introduction 1. Optimization is an important tool in daily life, business and
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
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 informationMethods and Models for Combinatorial Optimization
Methods and Models for Combinatorial Optimization Modeling by Linear Programming Luigi De Giovanni, Marco Di Summa Dipartimento di Matematica, Università di Padova De Giovanni, Di Summa MeMoCO 1 / 35 Mathematical
More informationPractice Questions for Math 131 Exam # 1
Practice Questions for Math 131 Exam # 1 1) A company produces a product for which the variable cost per unit is $3.50 and fixed cost 1) is $20,000 per year. Next year, the company wants the total cost
More informationMath 273a: Optimization
Math 273a: Optimization Instructor: Wotao Yin Department of Mathematics, UCLA Fall 2015 online discussions on piazza.com What is mathematical optimization? Optimization models the goal of solving a problem
More information2 Functions and Their
CHAPTER Functions and Their Applications Chapter Outline Introduction The Concept of a Function Types of Functions Roots (Zeros) of a Function Some Useful Functions in Business and Economics Equilibrium
More informationModern Logistics & Supply Chain Management
Modern Logistics & Supply Chain Management As gold which he cannot spend will make no man rich, so knowledge which he cannot apply will make no man wise. Samuel Johnson: The Idler No. 84 Production Mix
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More informationOperations Research: Introduction. Concept of a Model
Origin and Development Features Operations Research: Introduction Term or coined in 1940 by Meclosky & Trefthan in U.K. came into existence during World War II for military projects for solving strategic
More informationNonlinear Optimization: The art of modeling
Nonlinear Optimization: The art of modeling INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2003-2006 Jean-Philippe Vert, (Jean-Philippe.Vert@mines.org)
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 informationOptimization of a Nonlinear Workload Balancing Problem
Optimization of a Nonlinear Workload Balancing Problem Stefan Emet Department of Mathematics and Statistics University of Turku Finland Outline of the talk Introduction Some notes on Mathematical Programming
More informationFeasibility Pump for Mixed Integer Nonlinear Programs 1
Feasibility Pump for Mixed Integer Nonlinear Programs 1 Presenter: 1 by Pierre Bonami, Gerard Cornuejols, Andrea Lodi and Francois Margot Mixed Integer Linear or Nonlinear Programs (MILP/MINLP) Optimize
More informationIE598 Big Data Optimization Introduction
IE598 Big Data Optimization Introduction Instructor: Niao He Jan 17, 2018 1 A little about me Assistant Professor, ISE & CSL UIUC, 2016 Ph.D. in Operations Research, M.S. in Computational Sci. & Eng. Georgia
More informationOptimization. Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization. General form:
Optimization Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization General form: Min or Max f(x) (1) Subject to g(x) ~ b (2) lo < x < up (3) Some important
More informationBilinear Programming: Applications in the Supply Chain Management
Bilinear Programming: Applications in the Supply Chain Management Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida
More informationOptimeringslära för F (SF1811) / Optimization (SF1841)
Optimeringslära för F (SF1811) / Optimization (SF1841) 1. Information about the course 2. Examples of optimization problems 3. Introduction to linear programming Introduction - Per Enqvist 1 Linear programming
More informationCHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming CHAPTER 11 253 CHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming TRUE/FALSE 11.1 If conditions require that all
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
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 informationCHAPTER-3 MULTI-OBJECTIVE SUPPLY CHAIN NETWORK PROBLEM
CHAPTER-3 MULTI-OBJECTIVE SUPPLY CHAIN NETWORK PROBLEM 3.1 Introduction A supply chain consists of parties involved, directly or indirectly, in fulfilling customer s request. The supply chain includes
More informationScheduling and Optimization Course (MPRI)
MPRI Scheduling and optimization: lecture p. /6 Scheduling and Optimization Course (MPRI) Leo Liberti LIX, École Polytechnique, France MPRI Scheduling and optimization: lecture p. /6 Teachers Christoph
More informationChapter 2 Introduction to Optimization and Linear Programming
Ch. 2 Introduction to Optimization and Linear Programming TB-9 Chapter 2 Introduction to Optimization and Linear Programming Multiple Choice 1. What most motivates a business to be concerned with efficient
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationUniversity of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours.
University of Warwick, Department of Economics Spring 2012 EC941: Game Theory Prof. Francesco Squintani Final Exam Answer TWO questions. All questions carry equal weight. Time allowed 2 hours. 1. Consider
More informationMethods and Models for Combinatorial Optimization. We have seen... Luigi De Giovanni, Marco Di Summa. Introduction
Methods and Models for Combinatorial Optimization Introduction Luigi De Giovanni, Marco Di Summa Dipartimento di Matematica, Università di Padova De Giovanni, Di Summa MeMoCO 1 / 36 We have seen... Course
More informationLinear programming: introduction and examples
Linear programming: introduction and examples G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Linear
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 information10-1: Composite and Inverse Functions
Math 95 10-1: Composite and Inverse Functions Functions are a key component in the applications of algebra. When working with functions, we can perform many useful operations such as addition and multiplication
More informationDRAFT Formulation and Analysis of Linear Programs
DRAFT Formulation and Analysis of Linear Programs Benjamin Van Roy and Kahn Mason c Benjamin Van Roy and Kahn Mason September 26, 2005 1 2 Contents 1 Introduction 7 1.1 Linear Algebra..........................
More informationStudy Unit 3 : Linear algebra
1 Study Unit 3 : Linear algebra Chapter 3 : Sections 3.1, 3.2.1, 3.2.5, 3.3 Study guide C.2, C.3 and C.4 Chapter 9 : Section 9.1 1. Two equations in two unknowns Algebraically Method 1: Elimination Step
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationSystem Planning Lecture 7, F7: Optimization
System Planning 04 Lecture 7, F7: Optimization System Planning 04 Lecture 7, F7: Optimization Course goals Appendi A Content: Generally about optimization Formulate optimization problems Linear Programming
More informationThe Sample Complexity of Revenue Maximization in the Hierarchy of Deterministic Combinatorial Auctions
The Sample Complexity of Revenue Maximization in the Hierarchy of Deterministic Combinatorial Auctions Ellen Vitercik Joint work with Nina Balcan and Tuomas Sandholm Theory Lunch 27 April 2016 Combinatorial
More informationDecision Models Lecture 5 1. Lecture 5. Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class
Decision Models Lecture 5 1 Lecture 5 Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class Foreign Exchange (FX) Markets Decision Models Lecture 5
More informationLINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION
Name: LINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION In general, a mathematical model is either deterministic or probabilistic. For example, the models and algorithms shown in the Graph-Optimization
More informationDoug Clark The Learning Center 100 Student Success Center learningcenter.missouri.edu Overview
Math 1400 Final Exam Review Saturday, December 9 in Ellis Auditorium 1:00 PM 3:00 PM, Saturday, December 9 Part 1: Derivatives and Applications of Derivatives 3:30 PM 5:30 PM, Saturday, December 9 Part
More informationOptimization Exercise Set n.5 :
Optimization Exercise Set n.5 : Prepared by S. Coniglio translated by O. Jabali 2016/2017 1 5.1 Airport location In air transportation, usually there is not a direct connection between every pair of airports.
More informationIntroduction to linear programming using LEGO.
Introduction to linear programming using LEGO. 1 The manufacturing problem. A manufacturer produces two pieces of furniture, tables and chairs. The production of the furniture requires the use of two different
More informationCombinatorial Auction-Based Allocation of Virtual Machine Instances in Clouds
Combinatorial Auction-Based Allocation of Virtual Machine Instances in Clouds Sharrukh Zaman and Daniel Grosu Department of Computer Science Wayne State University Detroit, Michigan 48202, USA sharrukh@wayne.edu,
More informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
More informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
More informationTropical Geometry in Economics
Tropical Geometry in Economics Josephine Yu School of Mathematics, Georgia Tech joint work with: Ngoc Mai Tran UT Austin and Hausdorff Center for Mathematics in Bonn ARC 10 Georgia Tech October 24, 2016
More informationLecture 6: Communication Complexity of Auctions
Algorithmic Game Theory October 13, 2008 Lecture 6: Communication Complexity of Auctions Lecturer: Sébastien Lahaie Scribe: Rajat Dixit, Sébastien Lahaie In this lecture we examine the amount of communication
More informationWhat is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.
Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A
More informationQuadratic function and equations Quadratic function/equations, supply, demand, market equilibrium
Exercises 8 Quadratic function and equations Quadratic function/equations, supply, demand, market equilibrium Objectives - know and understand the relation between a quadratic function and a quadratic
More information3.8 Strong valid inequalities
3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.
More informationRedistribution Mechanisms for Assignment of Heterogeneous Objects
Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept
More informationDeterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions
Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions 11. Consider the following linear program. Maximize z = 6x 1 + 3x 2 subject to x 1 + 2x 2 2x 1 + x 2 20 x 1 x 2 x
More informationA Review of Auction Theory: Sequential Auctions and Vickrey Auctions
A Review of Auction Theory: and Vickrey Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 . Vickrey s. Vickrey. Example Two goods, one per bidder Suppose
More informationStructured Problems and Algorithms
Integer and quadratic optimization problems Dept. of Engg. and Comp. Sci., Univ. of Cal., Davis Aug. 13, 2010 Table of contents Outline 1 2 3 Benefits of Structured Problems Optimization problems may become
More informationSocial Science/Commerce Calculus I: Assignment #10 - Solutions Page 1/15
Social Science/Commerce Calculus I: Assignment #10 - Solutions Page 1/15 1. Consider the function f (x) = x - 8x + 3, on the interval 0 x 8. The global (absolute) maximum of f (x) (on the given interval)
More informationA Contract for Demand Response based on Probability of Call
A Contract for Demand Response based on Probability of Call Jose Vuelvas, Fredy Ruiz and Giambattista Gruosso Pontificia Universidad Javeriana - Politecnico di Milano 2018 1 2 Outline Introduction Problem
More informationGestion de la production. Book: Linear Programming, Vasek Chvatal, McGill University, W.H. Freeman and Company, New York, USA
Gestion de la production Book: Linear Programming, Vasek Chvatal, McGill University, W.H. Freeman and Company, New York, USA 1 Contents 1 Integer Linear Programming 3 1.1 Definitions and notations......................................
More informationChapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek
Chapter 3 Introduction to Linear Programming PART 1 Assoc. Prof. Dr. Arslan M. Örnek http://homes.ieu.edu.tr/~aornek/ise203%20optimization%20i.htm 1 3.1 What Is a Linear Programming Problem? Linear Programming
More informationIntroduction to Operations Research. Linear Programming
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationLecture 1. Stochastic Optimization: Introduction. January 8, 2018
Lecture 1 Stochastic Optimization: Introduction January 8, 2018 Optimization Concerned with mininmization/maximization of mathematical functions Often subject to constraints Euler (1707-1783): Nothing
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
More informationLecture 10: Mechanisms, Complexity, and Approximation
CS94 P9: Topics Algorithmic Game Theory November 8, 011 Lecture 10: Mechanisms, Complexity, and Approximation Lecturer: Christos Papadimitriou Scribe: Faraz Tavakoli It is possible to characterize a Mechanism
More information32. Use a graphing utility to find the equation of the line of best fit. Write the equation of the line rounded to two decimal places, if necessary.
Pre-Calculus A Final Review Part 2 Calculator Name 31. The price p and the quantity x sold of a certain product obey the demand equation: p = x + 80 where r = xp. What is the revenue to the nearest dollar
More informationFinal Exam Review Packet
1 Exam 1 Material Sections A.1, A.2 and A.6 were review material. There will not be specific questions focused on this material but you should know how to: Simplify functions with exponents. Factor quadratics
More informationFinal Exam Review Packet
1 Exam 1 Material Sections A.1, A.2 and A.6 were review material. There will not be specific questions focused on this material but you should know how to: Simplify functions with exponents. Factor quadratics
More informationOperations Research Lecture 6: Integer Programming
Operations Research Lecture 6: Integer Programming Notes taken by Kaiquan Xu@Business School, Nanjing University May 12th 2016 1 Integer programming (IP) formulations The integer programming (IP) is the
More informationIntroduction to Operations Research
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More information5-7 Solving Quadratic Inequalities. Holt Algebra 2
Example 1: Graphing Quadratic Inequalities in Two Variables Graph f(x) x 2 7x + 10. Step 1 Graph the parabola f(x) = x 2 7x + 10 with a solid curve. x f(x) 0 10 1 3 2 0 3-2 3.5-2.25 4-2 5 0 6 4 7 10 Example
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 Second Group of Students (with first letter of surnames I Z) Problem Set Rules: Due: February 12, 2013 1. Each student should
More informationModelling linear and linear integer optimization problems An introduction
Modelling linear and linear integer optimization problems An introduction Karen Aardal October 5, 2015 In optimization, developing and analyzing models are key activities. Designing a model is a skill
More informationMixed-Integer Nonlinear Programming
Mixed-Integer Nonlinear Programming Claudia D Ambrosio CNRS researcher LIX, École Polytechnique, France pictures taken from slides by Leo Liberti MPRO PMA 2016-2017 Motivating Applications Nonlinear Knapsack
More informationThe Remainder and Factor Theorems
Page 1 of 7 6.5 The Remainder and Factor Theorems What you should learn GOAL 1 Divide polynomials and relate the result to the remainder theorem and the factor theorem. GOAL 2 Use polynomial division in
More informationIntroduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationA) (-1, -1, -2) B) No solution C) Infinite solutions D) (1, 1, 2) A) (6, 5, -3) B) No solution C) Infinite solutions D) (1, -3, -7)
Algebra st Semester Final Exam Review Multiple Choice. Write an equation that models the data displayed in the Interest-Free Loan graph that is provided. y = x + 80 y = -0x + 800 C) y = 0x 00 y = 0x +
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 informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More information