DOCSLIB.ORG

Artelys Knitro 11.0

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Artelys Knitro 11.0 Artelys Knitro 11.0 SOCP, API, Preconditioner and much more! June 29, 2018 www.artelys.com COMPANY OVERVIEW Artelys We specialize in optimization, decision-support, modeling and deliver efficient solutions to complex business problems. Domains of expertise Services Energy Auditing & Consulting Transport & Logistic On demand software Defense Distribution and support of Numerical and Combinatorial numerical optimization tools Optimization Training June 29, 2018 www.artelys.com 2 NUMERICAL OPTIMIZATION TOOLS KNITRO Industry leading solver for very large, difficult nonlinear optimization problems (NLP, MINLP) FICO Xpress Optimization Suite High performance linear, quadratic and mixed integer programming solver (LP,MIP,QP) Artelys Kalis Object-oriented environment to model and solve problems with constraints programming techniques AMPL Comprehensive modeling language for Mathematical Programming June 29, 2018 www.artelys.com 3 ARTELYS KNITRO: OVERVIEW Background Created in 2001 by Ziena Optimization Spin-off of Northwestern University Now developed and supported by Artelys Key features Efficient and robust solution on large scale problems (~105 variables) Four active-set and interior-point algorithms for continuous optimization MINLP algorithms and complementarity constraints for discrete optimization Many extra features based on customer feedbacks or project requirements Parallel multi-start method for global optimization. Easy to use and well documented: Online documentation June 29, 2018 www.artelys.com 4 ARTELYS KNITRO: OVERVIEW Widely used in academia… US Top Universities: Berkeley, Columbia, Harvard, MIT, Stanford… Worldwide Top Universities: ETH Zürich, LSE, NUS (Singapore), Melbourne… … and industry Economic consulting firms Financial institutions Mechanical engineering companies Oil & Gas companies Regulator & Policy maker Software developers Used as a third-party optimization engine More than 400 institutions in over 40 countries rely on Artelys Knitro June 29, 2018 www.artelys.com 5 ARTELYS KNITRO: OVERVIEW Interfaces Programming languages Modeling languages Supported platforms Windows 32-bit, 64-bit Linux 64-bit macOS 64-bit June 29, 2018 www.artelys.com 6 ARTELYS KNITRO: OVERVIEW Interfaces Programming languages Modeling languages Julia Supported platforms Windows 32-bit, 64-bit Linux 64-bit macOS 64-bit June 29, 2018 www.artelys.com 6 PROBLEM CLASSES SOLVED BY KNITRO min 푓 푥, 푦 푥∈ℝ푛,푦∈ℤ푚 s.t. 푔푖 푥, 푦 ≥ 0 푖 ∈ 퐼 ℎ푗 푥, 푦 = 0 푗 ∈ 퐽 2 0 ≤ 푥푘 ⊥ 푥푙 ≥ 0 푘, 푙 ∈ 퐶 ⊂ 1, 푛 푙푥 ≤ 푥 ≤ 푢푥 푙푦 ≤ 푦 ≤ 푢푦 • Variables (x and y): – Continuous or discrete – Bounded or unbounded • Objective (f) and constraints (g and h): – Linear or nonlinear – Smoothness: required, but may still work without it – Convexity: better but not required, local optimization or global optimization with multistart 풙풍 • Complementarity constraints: – 0 ≤ 푥푘 ⊥ 푥푙 ≥ 0 is equivalent to: 푥푘 ≥ 0 and 푥푙 ≥ 0 and 푥푘 = 0 or 푥푙 = 0 – Applications: strategic bidding, economic models, equilibrium constraints, disjunctions 풙풌 RELEASE 11.0 Artelys Knitro 11.0 new features: New SOCP Algorithm Detect conic constraints from quadratic structures Designed for general nonlinear problems with SOC constraints New C API Easier to use Allows passing problem structure (eg linear, quadratic, conic constraints) with dedicated API and without providing Hessian Preconditioning for all classes of problems Preconditioning can now be used for problems with equality and inequality constraints New parallel linear solvers HSL MA86 (non-deterministic) and MA97 (deterministic) Speedups on large scale problem with shared memory parallelism Performance improvements Very large speedup on QCQPs (including nonlinear QCQP) Speedups on general convex problems Speedups on MINLP algorithms June 29, 2018 www.artelys.com 9 RELEASE 11.0 Artelys Knitro 11.0 new features: New SOCP Algorithm 1 Detect conic constraints from quadratic structures Designed for general nonlinear problems with SOC constraints New C API Easier to use Allows passing problem structure (eg linear, quadratic, conic constraints) with dedicated API and without providing Hessian Preconditioning for all classes of problems Preconditioning can now be used for problems with equality and inequality constraints New parallel linear solvers HSL MA86 (non-deterministic) and MA97 (deterministic) Speedups on large scale problem with shared memory parallelism Performance improvements Very large speedup on QCQPs (including nonlinear QCQP) Speedups on general convex problems Speedups on MINLP algorithms June 29, 2018 www.artelys.com 9 RELEASE 11.0 Artelys Knitro 11.0 new features: New SOCP Algorithm Detect conic constraints from quadratic structures Designed for general nonlinear problems with SOC constraints New C API 2 Easier to use Allows passing problem structure (eg linear, quadratic, conic constraints) with dedicated API and without providing Hessian Preconditioning for all classes of problems Preconditioning can now be used for problems with equality and inequality constraints New parallel linear solvers HSL MA86 (non-deterministic) and MA97 (deterministic) Speedups on large scale problem with shared memory parallelism Performance improvements Very large speedup on QCQPs (including nonlinear QCQP) Speedups on general convex problems Speedups on MINLP algorithms June 29, 2018 www.artelys.com 9 RELEASE 11.0 Artelys Knitro 11.0 new features: New SOCP Algorithm Detect conic constraints from quadratic structures Designed for general nonlinear problems with SOC constraints New C API Easier to use Allows passing problem structure (eg linear, quadratic, conic constraints) with dedicated API and without providing Hessian Preconditioning for all classes of problems 3 Preconditioning can now be used for problems with equality and inequality constraints New parallel linear solvers HSL MA86 (non-deterministic) and MA97 (deterministic) Speedups on large scale problem with shared memory parallelism Performance improvements Very large speedup on QCQPs (including nonlinear QCQP) Speedups on general convex problems Speedups on MINLP algorithms June 29, 2018 www.artelys.com 9 SOCP June 29, 2018 www.artelys.com 13 SECOND ORDER CONE CONSTRAINTS Standard Second Order Cone (SOC) of dimension k is 푡 푢 ∈ 푅푘−1, 푡 ∈ 푅1, 푢 ≤ 푡 푢 For k=1 푡 푡 ∈ 푅1, 0 ≤ 푡 For k=2 t 푡 푢 ∈ 푅1, 푡 ∈ 푅1, 푢 ≤ 푡 푢 u June 27, 2018 14 SECOND ORDER CONE PROGRAMS (SOCP) Set 푢 = 퐴푥 + 푏 and 푡 = 푐T푥 + 푑 to create general second order cone constraints of form 퐴푥 + 푏 ≤ 푐푇푥 + 푑 Second Order Cone Program (SOCP): min 푓T푥 푥 T s.t. 퐴푖푥 + 푏푖 ≤ 푐푖 푥 + 푑푖, i=1..m 퐺푇푥 + ℎ ≤ 0 Convex QP and QCQP (and more) can be converted to SOCP June 27, 2018 15 APPLICATIONS Applications Finance: portfolio optimization with loss risk constraints Facility location (e.g. antenna placement in wireless network) Robust optimization (under ellipsoid uncertainty) Robust least squares Grasping force optimization FIR filter design Truss design See Applications of Second-Order Cone Programming, Lobo,Vandenberghe, Boyd, Lebret Apr 16, 2018 16 EXAMPLES Quadratic constraint 푥푇 푄푥 + 2푞푇푥 + 푟 ≤ 0 2 푄1/2푥 + 푄−1/2푞 + 푟 − 푞푇푄−1푞 ≤ 0 ||푄1/2푥 + 푄−1/2푞|| ≤ 푞푇푄−1푞 − 푟 1/2 Rotated cone constraint 푥푇푥 ≤ 푦푧, 푦 ≥ 0, 푧 ≥ 0 4푥푇푥 + 푦2 + 푧2 ≤ 4푦푧 + 푦2 + 푧2 4푥푇푥 + (푦 − 푧)2 ≤ 푦 + 푧 2푥 ≤ 푦 + 푧 푦 − 푧 Apr 16, 2018 17 KNITRO CONIC SOLVER Knitro identifies the constraints in form 푛 2 2 σ푖=1 푎푖푥푖 ≤ 푎0푥0 , 푥0 ≥ 0 and 푛 2 σ푖=2 푎푖푥푖 ≤ 푎0푥0푥1, 푥0, 푥1 ≥ 0. as second order cone constraints, and internally puts them into the standard form It also allows to input constraints in form 퐴푥 + 푏 ≤ 푐푥 + 푑 directly via the struct ‘L2norm’ Currently, it does second order conic constraint identification on the presolved problem June 27, 2018 www.artelys.com 18 KNITRO CONIC SOLVER Knitro conic solver moves beyond SOCP (more general) min 푓T푥 푥 T s.t. 퐴푖푥 + 푏푖 ≤ 푐푖 푥 + 푑푖 퐺푇푥 + ℎ ≤ 0 min 푓(푥) 푥 T s.t. 퐴푖푥 + 푏푖 ≤ 푐푖 푥 + 푑푖 ℎ 푥 = 0 푔 푥 ≤ 0 • Handle any nonlinear problem with second order cone constraints, including non-convex • First specialized solver of this kind ! • Extension of existing Knitro Interior/Direct algorithm June 27, 2018 19 KNITRO CONIC SOLVER It generalizes the operations on the slack variables in the existing Knitro/Direct algorithm using the algebra associated with second order cones June 27, 2018 www.artelys.com 20 NLP FORM VS. CONIC FORM Can always write the cone constraint as a general NLP constraint: 2 2 2 푢 ≤ 푡 → 푢1 + 푢2+. +푢푘−1 ≤ 푡 This does not work well in general; constraint is non-differentiable as 푢 → 0 It is not uncommon that 푢 → 0 at the optimal solution Can square the constraint, but then it is non-convex and degenerate at the solution if 푢 → 0 Can try to smooth or relax/perturb these constraints to avoid these issues, e.g. 2 2 2 2 푢1 + 푢2+. +푢푘−1 + 휖 ≤ 푡 This works better sometimes but is still not robust or nearly as effective as dealing with them directly June 27, 2018 21 NLP FORM VS. CONIC FORM Consider the simple example: min 0.5푥1 + 푥2 푥 s.t. 푥1 ≤ 푥2 The optimal solution is at (0,0) NLP form without conic detection can’t get dual feasible QCQP form (non-convex): min 0.5푥1 + 푥2 푥 2 2 s.t. 푥1 ≤ 푥2 , 푥2 ≥ 0 solves in 50 iterations Conic formulation solves in 4 iterations In fact, development of the conic extension started after having troubles with such a problem Steiner_model / Steiner_model_100 on the next slide June 27, 2018 22 NLP FORM VS. CONIC FORM Compare Knitro (with and without special treatment of cone constraints) and Xpress on small SOCP models (iteration comparison) June 27, 2018 KNITRO CONIC SOLVER-MISOCP Can utilize Knitro branch-and-bound algorithm to solve mixed- integer SOCP … or more general mixed-integer models with SOC constraints min 푓(푥, 푦) 푥,푦 T s.t. 퐴푖푥 + 푏푖 ≤ 푐푖 푥 + 푑푖, i=1..k ℎ 푥, 푦 = 0 푔 푥, 푦 ≤ 0 푦 integer June 27, 2018 24 NEW KNITRO 11.0 API June 27, 2018 www.artelys.com 25 NEW KNITRO 11.0 API – KEY FEATURES Build optimization model piece-by-piece More flexible Easier problem modification More extendable (to multi-objective, statistical learning models, etc.) Identify special structures (e.g.
Load more

Recommended publications
  • Xpress Nonlinear Manual This Material Is the Confidential, Proprietary, and Unpublished Property of Fair Isaac Corporation
    R FICO Xpress Optimization Last update 01 May, 2018 version 33.01 FICO R Xpress Nonlinear Manual This material is the confidential, proprietary, and unpublished property of Fair Isaac Corporation. Receipt or possession of this material does not convey rights to divulge, reproduce, use, or allow others to use it without the specific written authorization of Fair Isaac Corporation and use must conform strictly to the license agreement. The information in this document is subject to change without notice. If you find any problems in this documentation, please report them to us in writing. Neither Fair Isaac Corporation nor its affiliates warrant that this documentation is error-free, nor are there any other warranties with respect to the documentation except as may be provided in the license agreement. ©1983–2018 Fair Isaac Corporation. All rights reserved. Permission to use this software and its documentation is governed by the software license agreement between the licensee and Fair Isaac Corporation (or its affiliate). Portions of the program may contain copyright of various authors and may be licensed under certain third-party licenses identified in the software, documentation, or both. In no event shall Fair Isaac Corporation or its affiliates be liable to any person for direct, indirect, special, incidental, or consequential damages, including lost profits, arising out of the use of this software and its documentation, even if Fair Isaac Corporation or its affiliates have been advised of the possibility of such damage. The rights and allocation of risk between the licensee and Fair Isaac Corporation (or its affiliates) are governed by the respective identified licenses in the software, documentation, or both.
    [Show full text]
  • Julia, My New Friend for Computing and Optimization? Pierre Haessig, Lilian Besson
    Julia, my new friend for computing and optimization? Pierre Haessig, Lilian Besson To cite this version: Pierre Haessig, Lilian Besson. Julia, my new friend for computing and optimization?. Master. France. 2018. cel-01830248 HAL Id: cel-01830248 https://hal.archives-ouvertes.fr/cel-01830248 Submitted on 4 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. « Julia, my new computing friend? » | 14 June 2018, IETR@Vannes | By: L. Besson & P. Haessig 1 « Julia, my New frieNd for computiNg aNd optimizatioN? » Intro to the Julia programming language, for MATLAB users Date: 14th of June 2018 Who: Lilian Besson & Pierre Haessig (SCEE & AUT team @ IETR / CentraleSupélec campus Rennes) « Julia, my new computing friend? » | 14 June 2018, IETR@Vannes | By: L. Besson & P. Haessig 2 AgeNda for today [30 miN] 1. What is Julia? [5 miN] 2. ComparisoN with MATLAB [5 miN] 3. Two examples of problems solved Julia [5 miN] 4. LoNger ex. oN optimizatioN with JuMP [13miN] 5. LiNks for more iNformatioN ? [2 miN] « Julia, my new computing friend? » | 14 June 2018, IETR@Vannes | By: L. Besson & P. Haessig 3 1. What is Julia ? Open-source and free programming language (MIT license) Developed since 2012 (creators: MIT researchers) Growing popularity worldwide, in research, data science, finance etc… Multi-platform: Windows, Mac OS X, GNU/Linux..
    [Show full text]
  • Solving Mixed Integer Linear and Nonlinear Problems Using the SCIP Optimization Suite
    Takustraße 7 Konrad-Zuse-Zentrum D-14195 Berlin-Dahlem fur¨ Informationstechnik Berlin Germany TIMO BERTHOLD GERALD GAMRATH AMBROS M. GLEIXNER STEFAN HEINZ THORSTEN KOCH YUJI SHINANO Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite Supported by the DFG Research Center MATHEON Mathematics for key technologies in Berlin. ZIB-Report 12-27 (July 2012) Herausgegeben vom Konrad-Zuse-Zentrum f¨urInformationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Telefon: 030-84185-0 Telefax: 030-84185-125 e-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite∗ Timo Berthold Gerald Gamrath Ambros M. Gleixner Stefan Heinz Thorsten Koch Yuji Shinano Zuse Institute Berlin, Takustr. 7, 14195 Berlin, Germany, fberthold,gamrath,gleixner,heinz,koch,[email protected] July 31, 2012 Abstract This paper introduces the SCIP Optimization Suite and discusses the ca- pabilities of its three components: the modeling language Zimpl, the linear programming solver SoPlex, and the constraint integer programming frame- work SCIP. We explain how these can be used in concert to model and solve challenging mixed integer linear and nonlinear optimization problems. SCIP is currently one of the fastest non-commercial MIP and MINLP solvers. We demonstrate the usage of Zimpl, SCIP, and SoPlex by selected examples, give an overview of available interfaces, and outline plans for future development. ∗A Japanese translation of this paper will be published in the Proceedings of the 24th RAMP Symposium held at Tohoku University, Miyagi, Japan, 27{28 September 2012, see http://orsj.or.
    [Show full text]
  • [20Pt]Algorithms for Constrained Optimization: [ 5Pt]
    SOL Optimization 1970s 1980s 1990s 2000s 2010s Summary 2020s Algorithms for Constrained Optimization: The Benefits of General-purpose Software Michael Saunders MS&E and ICME, Stanford University California, USA 3rd AI+IoT Business Conference Shenzhen, China, April 25, 2019 Optimization Software 3rd AI+IoT Business Conference, Shenzhen, April 25, 2019 1/39 SOL Optimization 1970s 1980s 1990s 2000s 2010s Summary 2020s SOL Systems Optimization Laboratory George Dantzig, Stanford University, 1974 Inventor of the Simplex Method Father of linear programming Large-scale optimization: Algorithms, software, applications Optimization Software 3rd AI+IoT Business Conference, Shenzhen, April 25, 2019 2/39 SOL Optimization 1970s 1980s 1990s 2000s 2010s Summary 2020s SOL history 1974 Dantzig and Cottle start SOL 1974{78 John Tomlin, LP/MIP expert 1974{2005 Alan Manne, nonlinear economic models 1975{76 MS, MINOS first version 1979{87 Philip Gill, Walter Murray, MS, Margaret Wright (Gang of 4!) 1989{ Gerd Infanger, stochastic optimization 1979{ Walter Murray, MS, many students 2002{ Yinyu Ye, optimization algorithms, especially interior methods This week! UC Berkeley opened George B. Dantzig Auditorium Optimization Software 3rd AI+IoT Business Conference, Shenzhen, April 25, 2019 3/39 SOL Optimization 1970s 1980s 1990s 2000s 2010s Summary 2020s Optimization problems Minimize an objective function subject to constraints: 0 x 1 min '(x) st ` ≤ @ Ax A ≤ u c(x) x variables 0 1 A matrix c1(x) B . C c(x) nonlinear functions @ . A c (x) `; u bounds m Optimization
    [Show full text]
  • Numericaloptimization
    Numerical Optimization Alberto Bemporad http://cse.lab.imtlucca.it/~bemporad/teaching/numopt Academic year 2020-2021 Course objectives Solve complex decision problems by using numerical optimization Application domains: • Finance, management science, economics (portfolio optimization, business analytics, investment plans, resource allocation, logistics, ...) • Engineering (engineering design, process optimization, embedded control, ...) • Artificial intelligence (machine learning, data science, autonomous driving, ...) • Myriads of other applications (transportation, smart grids, water networks, sports scheduling, health-care, oil & gas, space, ...) ©2021 A. Bemporad - Numerical Optimization 2/102 Course objectives What this course is about: • How to formulate a decision problem as a numerical optimization problem? (modeling) • Which numerical algorithm is most appropriate to solve the problem? (algorithms) • What’s the theory behind the algorithm? (theory) ©2021 A. Bemporad - Numerical Optimization 3/102 Course contents • Optimization modeling – Linear models – Convex models • Optimization theory – Optimality conditions, sensitivity analysis – Duality • Optimization algorithms – Basics of numerical linear algebra – Convex programming – Nonlinear programming ©2021 A. Bemporad - Numerical Optimization 4/102 References i ©2021 A. Bemporad - Numerical Optimization 5/102 Other references • Stephen Boyd’s “Convex Optimization” courses at Stanford: http://ee364a.stanford.edu http://ee364b.stanford.edu • Lieven Vandenberghe’s courses at UCLA: http://www.seas.ucla.edu/~vandenbe/ • For more tutorials/books see http://plato.asu.edu/sub/tutorials.html ©2021 A. Bemporad - Numerical Optimization 6/102 Optimization modeling What is optimization? • Optimization = assign values to a set of decision variables so to optimize a certain objective function • Example: Which is the best velocity to minimize fuel consumption ? fuel [ℓ/km] velocity [km/h] 0 30 60 90 120 160 ©2021 A.
    [Show full text]
  • Julia: a Modern Language for Modern ML
    Julia: A modern language for modern ML Dr. Viral Shah and Dr. Simon Byrne www.juliacomputing.com What we do: Modernize Technical Computing Today’s technical computing landscape: • Develop new learning algorithms • Run them in parallel on large datasets • Leverage accelerators like GPUs, Xeon Phis • Embed into intelligent products “Business as usual” will simply not do! General Micro-benchmarks: Julia performs almost as fast as C • 10X faster than Python • 100X faster than R & MATLAB Performance benchmark relative to C. A value of 1 means as fast as C. Lower values are better. A real application: Gillespie simulations in systems biology 745x faster than R • Gillespie simulations are used in the field of drug discovery. • Also used for simulations of epidemiological models to study disease propagation • Julia package (Gillespie.jl) is the state of the art in Gillespie simulations • https://github.com/openjournals/joss- papers/blob/master/joss.00042/10.21105.joss.00042.pdf Implementation Time per simulation (ms) R (GillespieSSA) 894.25 R (handcoded) 1087.94 Rcpp (handcoded) 1.31 Julia (Gillespie.jl) 3.99 Julia (Gillespie.jl, passing object) 1.78 Julia (handcoded) 1.2 Those who convert ideas to products fastest will win Computer Quants develop Scientists prepare algorithms The last 25 years for production (Python, R, SAS, DEPLOY (C++, C#, Java) Matlab) Quants and Computer Compress the Scientists DEPLOY innovation cycle collaborate on one platform - JULIA with Julia Julia offers competitive advantages to its users Julia is poised to become one of the Thank you for Julia. Yo u ' v e k i n d l ed leading tools deployed by developers serious excitement.
    [Show full text]
  • ILOG AMPL CPLEX System Version 9.0 User's Guide
    ILOG AMPL CPLEX System Version 9.0 User’s Guide Standard (Command-line) Version Including CPLEX Directives September 2003 Copyright © 1987-2003, by ILOG S.A. All rights reserved. ILOG, the ILOG design, CPLEX, and all other logos and product and service names of ILOG are registered trademarks or trademarks of ILOG in France, the U.S. and/or other countries. JavaTM and all Java-based marks are either trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries. Microsoft, Windows, and Windows NT are either trademarks or registered trademarks of Microsoft Corporation in the U.S. and other countries. All other brand, product and company names are trademarks or registered trademarks of their respective holders. AMPL is a registered trademark of AMPL Optimization LLC and is distributed under license by ILOG.. CPLEX is a registered trademark of ILOG.. Printed in France. CO N T E N T S Table of Contents Chapter 1 Introduction . 1 Welcome to AMPL . .1 Using this Guide. .1 Installing AMPL . .2 Requirements. .2 Unix Installation . .3 Windows Installation . .3 AMPL and Parallel CPLEX. 4 Licensing . .4 Usage Notes . .4 Installed Files . .5 Chapter 2 Using AMPL. 7 Running AMPL . .7 Using a Text Editor . .7 Running AMPL in Batch Mode . .8 Chapter 3 AMPL-Solver Interaction . 11 Choosing a Solver . .11 Specifying Solver Options . .12 Initial Variable Values and Solvers. .13 ILOG AMPL CPLEX SYSTEM 9.0 — USER’ S GUIDE v Problem and Solution Files. .13 Saving temporary files . .14 Creating Auxiliary Files . .15 Running Solvers Outside AMPL. .16 Using MPS File Format .
    [Show full text]
  • Treball (1.484Mb)
    Treball Final de Màster MÀSTER EN ENGINYERIA INFORMÀTICA Escola Politècnica Superior Universitat de Lleida Mòdul d’Optimització per a Recursos del Transport Adrià Vall-llaura Salas Tutors: Antonio Llubes, Josep Lluís Lérida Data: Juny 2017 Pròleg Aquest projecte s’ha desenvolupat per donar solució a un problema de l’ordre del dia d’una empresa de transports. Es basa en el disseny i implementació d’un model matemàtic que ha de permetre optimitzar i automatitzar el sistema de planificació de viatges de l’empresa. Per tal de poder implementar l’algoritme s’han hagut de crear diversos mòduls que extreuen les dades del sistema ERP, les tracten, les envien a un servei web (REST) i aquest retorna un emparellament òptim entre els vehicles de l’empresa i les ordres dels clients. La primera fase del projecte, la teòrica, ha estat llarga en comparació amb les altres. En aquesta fase s’ha estudiat l’estat de l’art en la matèria i s’han repassat molts dels models més importants relacionats amb el transport per comprendre’n les seves particularitats. Amb els conceptes ben estudiats, s’ha procedit a desenvolupar un nou model matemàtic adaptat a les necessitats de la lògica de negoci de l’empresa de transports objecte d’aquest treball. Posteriorment s’ha passat a la fase d’implementació dels mòduls. En aquesta fase m’he trobat amb diferents limitacions tecnològiques degudes a l’antiguitat de l’ERP i a l’ús del sistema operatiu Windows. També han sorgit diferents problemes de rendiment que m’han fet redissenyar l’extracció de dades de l’ERP, el càlcul de distàncies i el mòdul d’optimització.
    [Show full text]
  • Open Source Tools for Optimization in Python
    Open Source Tools for Optimization in Python Ted Ralphs Sage Days Workshop IMA, Minneapolis, MN, 21 August 2017 T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Outline 1 Introduction 2 COIN-OR 3 Modeling Software 4 Python-based Modeling Tools PuLP/DipPy CyLP yaposib Pyomo T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Outline 1 Introduction 2 COIN-OR 3 Modeling Software 4 Python-based Modeling Tools PuLP/DipPy CyLP yaposib Pyomo T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Caveats and Motivation Caveats I have no idea about the background of the audience. The talk may be either too basic or too advanced. Why am I here? I’m not a Sage developer or user (yet!). I’m hoping this will be a chance to get more involved in Sage development. Please ask lots of questions so as to guide me in what to dive into! T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Mathematical Optimization Mathematical optimization provides a formal language for describing and analyzing optimization problems. Elements of the model: Decision variables Constraints Objective Function Parameters and Data The general form of a mathematical optimization problem is: min or max f (x) (1) 8 9 < ≤ = s.t. gi(x) = bi (2) : ≥ ; x 2 X (3) where X ⊆ Rn might be a discrete set. T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Types of Mathematical Optimization Problems The type of a mathematical optimization problem is determined primarily by The form of the objective and the constraints.
    [Show full text]
  • Benchmarks for Current Linear and Mixed Integer Optimization Solvers
    ACTA UNIVERSITATIS AGRICULTURAE ET SILVICULTURAE MENDELIANAE BRUNENSIS Volume 63 207 Number 6, 2015 http://dx.doi.org/10.11118/actaun201563061923 BENCHMARKS FOR CURRENT LINEAR AND MIXED INTEGER OPTIMIZATION SOLVERS Josef Jablonský1 1 Department of Econometrics, Faculty of Informatics and Statistics, University of Economics, Prague, nám. W. Churchilla 4, 130 67 Praha 3, Czech Republic Abstract JABLONSKÝ JOSEF. 2015. Benchmarks for Current Linear and Mixed Integer Optimization Solvers. Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 63(6): 1923–1928. Linear programming (LP) and mixed integer linear programming (MILP) problems belong among very important class of problems that fi nd their applications in various managerial consequences. The aim of the paper is to discuss computational performance of current optimization packages for solving large scale LP and MILP optimization problems. Current market with LP and MILP solvers is quite extensive. Probably among the most powerful solvers GUROBI 6.0, IBM ILOG CPLEX 12.6.1, and XPRESS Optimizer 27.01 belong. Their attractiveness for academic research is given, except their computational performance, by their free availability for academic purposes. The solvers are tested on the set of selected problems from MIPLIB 2010 library that contains 361 test instances of diff erent hardness (easy, hard, and not solved). Keywords: benchmark, linear programming, mixed integer linear programming, optimization, solver INTRODUCTION with integer variables need not be solved even Solving linear and mixed integer linear in case of a very small size of the given problem. optimization problems (LP and MILP) that Real-world optimization problems have usually belong to one of the most o en modelling tools, many thousands of variables and/or constraints.
    [Show full text]
  • MODELING LANGUAGES in MATHEMATICAL OPTIMIZATION Applied Optimization Volume 88
    MODELING LANGUAGES IN MATHEMATICAL OPTIMIZATION Applied Optimization Volume 88 Series Editors: Panos M. Pardalos University o/Florida, U.S.A. Donald W. Hearn University o/Florida, U.S.A. MODELING LANGUAGES IN MATHEMATICAL OPTIMIZATION Edited by JOSEF KALLRATH BASF AG, GVC/S (Scientific Computing), 0-67056 Ludwigshafen, Germany Dept. of Astronomy, Univ. of Florida, Gainesville, FL 32611 Kluwer Academic Publishers Boston/DordrechtiLondon Distributors for North, Central and South America: Kluwer Academic Publishers 101 Philip Drive Assinippi Park Norwell, Massachusetts 02061 USA Telephone (781) 871-6600 Fax (781) 871-6528 E-Mail <[email protected]> Distributors for all other countries: Kluwer Academic Publishers Group Post Office Box 322 3300 AlI Dordrecht, THE NETHERLANDS Telephone 31 78 6576 000 Fax 31 786576474 E-Mail <[email protected]> .t Electronic Services <http://www.wkap.nl> Library of Congress Cataloging-in-Publication Kallrath, Josef Modeling Languages in Mathematical Optimization ISBN-13: 978-1-4613-7945-4 e-ISBN-13:978-1-4613 -0215 - 5 DOl: 10.1007/978-1-4613-0215-5 Copyright © 2004 by Kluwer Academic Publishers Softcover reprint of the hardcover 1st edition 2004 All rights reserved. No part ofthis pUblication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photo-copying, microfilming, recording, or otherwise, without the prior written permission ofthe publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Permissions for books published in the USA: P"§.;r.m.i.§J?i..QD.§.@:w.k~p" ..,.g.Qm Permissions for books published in Europe: [email protected] Printed on acid-free paper.
    [Show full text]
  • Computational Aspects of Infeasibility Analysis in Mixed Integer Programming
    Takustr. 7 Zuse Institute Berlin 14195 Berlin Germany JAKOB WITZIG TIMO BERTHOLD STEFAN HEINZ Computational Aspects of Infeasibility Analysis in Mixed Integer Programming ZIB Report 19-54 (November 2019) Zuse Institute Berlin Takustr. 7 14195 Berlin Germany Telephone: +49 30-84185-0 Telefax: +49 30-84185-125 E-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 Computational Aspects of Infeasibility Analysis in Mixed Integer Programming Jakob Witzig,1 Timo Berthold,2 and Stefan Heinz3 1Zuse Institute Berlin, Takustr. 7, 14195 Berlin, Germany [email protected] 2Fair Isaac Germany GmbH, Stubenwald-Allee 19, 64625 Bensheim, Germany [email protected] 3Gurobi GmbH, Ulmenstr. 37–39, 60325 Frankfurt am Main, Germany [email protected] November 6, 2019 Abstract The analysis of infeasible subproblems plays an important role in solv- ing mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally different concepts to gener- ate valid global constraints from infeasible subproblems. The first is to analyze the sequence of implications, obtained by domain propagation, that led to infeasibility. The result of this analysis is one or more sets of contradicting variable bounds from which so-called conflict constraints can be generated. This concept is called conflict graph analysis and has its origin in solving satisfiability problems and is similarly used in con- straint programming. The second concept is to analyze infeasible linear programming (LP) relaxations. Every ray of the dual LP provides a set of multipliers that can be used to generate a single new globally valid linear constraint.
    [Show full text]