Mathematical Optimization in Stata: LP and MILP

Slides:



Advertisements
Similar presentations
IEOR 4004 Midterm Review (part I)
Advertisements

Introduction to Optimization Anjela Govan North Carolina State University SAMSI NDHS Undergraduate workshop 2006.
LPs and MIPs background and solution approaches Dr. Greg Bernstein Grotto Networking
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Convex Optimization Chapter 1 Introduction. What, Why and How  What is convex optimization  Why study convex optimization  How to study convex optimization.
SE- 521: Nonlinear Programming and Applications S. O. Duffuaa.
Exact or stable image\signal reconstruction from incomplete information Project guide: Dr. Pradeep Sen UNM (Abq) Submitted by: Nitesh Agarwal IIT Roorkee.
Nonlinear Programming
Introduction to Linear and Integer Programming
Visual Recognition Tutorial
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
Models Physical: Scale, Analog Symbolic: Drawings Computer Programs Mathematical: Analytical (Deduction) Experimental (Induction)
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Unconstrained Optimization Problem
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
LP formulation of Economic Dispatch
Operations Research Models
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
1 Chapter 8 Nonlinear Programming with Constraints.
Computational Geometry Piyush Kumar (Lecture 5: Linear Programming) Welcome to CIS5930.
ENCI 303 Lecture PS-19 Optimization 2
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Chapter 7 Handling Constraints
1 University of Palestine Operations Research ITGD4207 WIAM_H-Whba Dr. Sana’a Wafa Al-Sayegh 2 nd Semester
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Mathematical Models & Optimization?
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 11-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Institute of Biophysics and Biomedical Engineering - Bulgarian Academy of Sciences OLYMPIA ROEVA 105 Acad. George Bonchev Str Sofia, Bulgaria
A comparison between PROC NLP and PROC OPTMODEL Optimization Algorithm Chin Hwa Tan December 3, 2008.
ZEIT4700 – S1, 2015 Mathematical Modeling and Optimization School of Engineering and Information Technology.
1.2 Guidelines for strong formulations  Running time for LP usually depends on m and n ( number of iterations O(m), O(log n)). Not critically depend on.
Linear Programming and Applications
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
Nonlinear Programming In this handout Gradient Search for Multivariable Unconstrained Optimization KKT Conditions for Optimality of Constrained Optimization.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
Linear Programming Chapter 1 Introduction.
Ch. Eick: Num. Optimization with GAs Numerical Optimization General Framework: objective function f(x 1,...,x n ) to be minimized or maximized constraints:
Regularized Least-Squares and Convex Optimization.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
Lecture 20 Review of ISM 206 Optimization Theory and Applications.
Optimal Control.
CPS Brief introduction to linear and mixed integer programming
Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams
University of Colorado Boulder APPM 4380 October 10th, 2016
deterministic operations research
Nonlinear Programming Prepared by Lee Revere and John Large
Non-linear Minimization
Solver & Optimization Problems
Classification Analytical methods classical methods
Object Matching Using a Locally Affine Invariant and Linear Programming Techniques - H. Li, X. Huang, L. He Ilchae Jung.
MBA 651 Quantitative Methods for Decision Making
Chapter 1. Introduction Mathematical Programming (Optimization) Problem: min/max
Chapter 6. Large Scale Optimization
Sensitivity Analysis and
A Mathematical Programming Language
Chapter 1. Formulations (BW)
Brief introduction to linear and mixed integer programming
Chapter 1. Formulations.
1.2 Guidelines for strong formulations
Chapter 6. Large Scale Optimization
1.2 Guidelines for strong formulations
Presentation transcript:

Mathematical Optimization in Stata: LP and MILP July 18-19, 2013 2013 New Orleans Stata Conference ☆ Choonjoo Lee Korea National Defense University bloom.rampike@gmail.com

I II III Motivation Taxonomy of Mathematical Optimization CONTENTS I Motivation II Taxonomy of Mathematical Optimization III User-written LP and MILP in Stata

I. Motivation  Why use Stata? ❍ Fast, accurate, and easy to use ❍ Broad suite of statistical features ❍ Complete data-management facilities ❍ Publication-quality graphics ❍ Responsive and extensible ❍ Matrix programming—Mata ❍ Cross-platform compatible ❍ Complete documentation and other publications ❍ Technical support and learning resources ❍ Widely used ❍ Affordable √ Rooms for user to play http://www.stata.com/why-use-stata/

※Stata program is used in more than 200 countries.(Stata Corp.,2013) I. Motivation  Why not play with Mathematical Optimization in Stata? Legend 200+ 1+ DEA downloads(application of mathematical optimization. ※Stata program is used in more than 200 countries.(Stata Corp.,2013) (July 1, 2013)

https://sourceforge.net/projects/deas/ I. Motivation  Why not play with Mathematical Optimization in Stata? https://sourceforge.net/projects/deas/

I. Motivation  Why not play with Mathematical Optimization in Stata? ❍ #1 file downloads among Stata Conference files ❍ DEA file ranked at #442 among Authors of works excluding software by File Downloads 2013-06 http://logec.repec.org/scripts/seritemstat.pf?h=repec:boc:dcon09

Max 40x1+50x2+80x3+170x4 s.t. x1+8x2+2x3+x4 ≤ 50 9x1+x2+5x3+3x4 ≤ 70 II. Taxonomy of Mathematical Optimization  Mathematical Formulations of Optimization problems ❍ Find the best solutions to mathematically defined problems subject to certain constraints. ❍ Typical form of mathematical optimization Max(Min) Objective function Subject to Constraints. - For example: Max 40x1+50x2+80x3+170x4 s.t. x1+8x2+2x3+x4 ≤ 50 9x1+x2+5x3+3x4 ≤ 70 7x1+7x2+4x3+x4 ≤ 117

II. Taxonomy of Mathematical Optimization  Variants of Mathematical Optimization Nodes Branches Objective Function (Non)Linear, Convex(Concave), Single(Multiple), Quadratic,… Constraints (Un)Constrained Convexity Convex(Concave) Linearity (Non)linear Discontinuity Integer, Stochastic, Network Uncertainty Stochastic, Simulation, Robust Parametric (Non)Parametric Boundedness (Un)Bounded Optimality Global(Local), Minimization(Maximization)

II. Taxonomy of Mathematical Optimization  Variants of Mathematical Optimization Model ❍ Convex(objective fcn: convex, constraint: convex)→ Linear Programming ❍ Integer (some or all variables: integer values) → Integer programming ❍ Quadratic(Objective fcn: quadratic) → Quadratic programming ❍ Nonlinear(Objective fcn or constraints: nonlinear) → Nonlinear programming ❍ Stochastic(some constraints: random variable) → Stochastic programming …

Source: Park, S(2001), Wikipedia II. Taxonomy of Mathematical Optimization  Solution Techniques for Mathematical Optimization ❍ Optimization algorithms(fixed steps): Simplex algorithm, variants of Simplex, … ❍ Iterative methods(converged solution): Newton’s method, Interior point methods, Finite difference, Numerical analysis, Gradient descent, Ellipsoid method, … ❍ Heuristics(approximated solution): Nelder-Mead simplicial heuristic, Genetic algorithm, Differential Search algorithm, Dynamic relaxation, … Source: Park, S(2001), Wikipedia

II. Taxonomy of Mathematical Optimization  Mathematical Optimization Codes in Stata ❍ optimize( ) : Mata’s function; finds coefficients (b1, b2,…, bm) that maximize or minimize f (p1, p2,…,pm), where pi = Xi bi. ❍ moptimize( ) : Mata’s and Stata’s premier optimization routine; the routine used by most of the official optimization-based estimators implemented in Stata. ❍ ml( ) : Stata’s command; provides most of the capabilities of Mata’s moptimize(), and ml is easier to use; ml uses moptimize() to perform the optimization. Source: Stata, [M-5] p.617 ☞ Stata focused on Quadratic, Stochastic programming; Iterative(numerical), Stochastic, Parametric methods

Max 40x1+50x2+80x3+170x4 s.t. x1+8x2+2x3+x4 ≤ 50 9x1+x2+5x3+3x4 ≤ 70 III. User-written LP and MILP in Stata  The User Written Command “lp” ❍ Optimization Problem Max 40x1+50x2+80x3+170x4 s.t. x1+8x2+2x3+x4 ≤ 50 9x1+x2+5x3+3x4 ≤ 70 7x1+7x2+4x3+x4 ≤ 117 ❍ Data Input in Stata x1 x2 x3 x4 rel rhs 40 50 80 170 = 1 8 2 <= 9 5 3 70 7 4 117

III. User-written LP and MILP in Stata  The User Written Command “lp” ❍ Program Syntax lp varlists [if] [in] [using/] [, rel(varname) rhs(varname) min max intvars(varlist) tol1(real) tol2(real) saving(filename)] rel(varname) specifies the variable with the relationship symbols. The default option is rel. rhs(varname) specifies the variable with constants in the right hand side of equation. The default option is rhs. min and max are case sensitive. min(max) is to minimize(maximize) the objective function. intvars(varlist) specifies variables with integer value. tol1(real) sets the tolerance of pivoting value. The default value is 1e-14. tol2(real) sets the tolerance of matrix inverse. The default value is 2.22e-12.

III. User-written LP and MILP in Stata  The User Written Command “lp” for LP problem ❍ Result: lp with maximization option. . lp x1 x2 x3 x4,max

III. User-written LP and MILP in Stata  The User Written Command “lp” for MILP problem ❍ Result: lp with intvars(x4) option. . lp x1 x2 x3 x4,max intvars(x4)

III. User-written LP and MILP in Stata  Remarks ❍ The code is not complete yet and waits for your upgrade. And there are plenty of rooms to play and work for users. ❍ lp code using optimization algorithm is available at https://sourceforge.net/projects/deas/

References Lee, C.(2012). “Allocative Efficiency Analysis using DEA in Stata”,San12 Stata Conference. Lee, C.(2011). “Malmquist Productivity Analysis using DEA Frontier in Stata”, Chicago11 Stata Conference. Ji, Y., & Lee, C. (2010). “Data Envelopment Analysis”, The Stata Journal, 10(no.2), pp.267-280. Lee, C. (2010). “An Efficient Data Envelopment Analysis with a large Data Set in Stata”, BOS10 Stata Conference. Lee, C., & Ji, Y. (2009). “Data Envelopment Analysis in Stata”, DC09 Stata Conference.

Thank You !