DOCSLIB.ORG

User's Guide for Tomlab 4.0.6

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
User's Guide for Tomlab 4.0.6 User’s Guide for Tomlab 4.0.61 Kenneth Holmstr¨om and Anders G¨oran Tomlab Optimization G¨addgatan 9 SE-723 49 V¨aster˚as, Sweden August 1, 2003 1More information available at the TOMLAB home page: http://tomlab.biz and at the Applied Optimization and Modeling TOM home page http://www.ima.mdh.se/tom. E-mail: [email protected]. 1 Contents 1 Introduction to TOMLAB 7 1.1 WhatisTOMLAB? ..................................... ....... 7 1.2 The Organization of This Guide . ........ 8 1.3 Further Reading . ...... 9 2 The Design of TOMLAB 10 2.1 Structure Input and Output . 10 2.2 Introduction to Solver and Problem Types . .......... 10 2.3 The Process of Solving Optimization Problems with TOMLAB . .......... 11 2.4 Low Level Routines and Gateway Routines . ....... 14 3 Optimization Problem Types and Solver Routines in TOMLAB 16 3.1 Optimization Problem Types Defined in TOMLAB . ...... 16 3.2 Solver Routines in TOMLAB . ....... 20 3.2.1 Solvers Available in all Tomlab Versions . ............. 20 3.2.2 Solvers Available in the TOMLAB /SOL Toolbox . ........ 22 3.2.3 Solvers Available in the TOMLAB/CGO Toolbox . .......... 22 3.2.4 Solvers Available in the TOMLAB /PENSDP Toolbox . .......... 23 3.2.5 Solvers Available in the TOMLAB /PENBMI Toolbox . ........... 23 3.2.6 Solvers Available in the TOMLAB /MINLP v1.0 Toolbox . ............ 23 3.2.7 Finding Available Solvers . ........ 24 4 Defining User Problems in the TOMLAB Quick or Init File format 26 4.1 TOMLAB Quick (TQ) Format for User Problems . ......... 26 4.2 TOMLAB Init File (IF) Format for User Problems . ............ 27 4.3 Create an Init File going from TQ to IF format . .............. 29 4.4 Adding an Init File to the GUI Data Base . .......... 30 5 Solving Linear, Quadratic and Integer Programming Problems 32 5.1 Linear Programming Problems . .......... 32 5.1.1 A Quick Linear Programming Solution . ........ 33 5.1.2 Several Linear Programs . ....... 34 5.1.3 LargeSetsofLinearPrograms . ......... 34 5.1.4 More on Solving Linear Programs . ......... 36 5.2 Quadratic Programming Problems . .......... 40 5.2.1 A Quick Quadratic Programming solution . ......... 40 5.2.2 Several Quadratic Programs . ....... 41 5.2.3 Large Sets of Quadratic Programs . ......... 42 5.2.4 Another Direct Approach to a QP Solution . ..... 44 5.2.5 More on Solving Quadratic Programs . ......... 44 5.3 Mixed-Integer Programming Problems . .......... 45 5.3.1 Large Sets of Mixed-Integer Programs . ......... 48 2 5.3.2 More on Solving Mixed-Integer Programs . ......... 48 6 Solving Unconstrained and Constrained Optimization Problems 50 6.1 Defining the Problem in Matlab m-files . ...... 50 6.1.1 Communication between user routines . ..... 53 6.2 Solving Unconstrained Optimization using the TQ format . .......... 54 6.3 Direct Call to an Optimization Routine . ........... 55 6.4 Solving Constrained Optimization using the TQ format . ........... 56 6.5 Efficient use of the TOM solvers . ....... 58 7 Solving Global Optimization Problems 59 7.1 Solving Box-Bounded Global Optimization with TQ format . ........... 59 7.2 Defining Global Mixed-Integer Nonlinear Problems with TQ format . ......... 60 8 Least Squares and Parameter Estimation Problems 62 8.1 Solving Linear Least Squares Problems using the TQ Format . ......... 62 8.2 Solving Linear Least Squares Problems using the SOL Solver LSSOL . 63 8.3 Solving Nonlinear Least Squares Problems using the TQ Format . ......... 64 8.4 Fitting Sums of Exponentials to Empirical Data . ............. 67 8.5 Solving Large Scale LS problems with Tlsqr ............................... 68 9 Efficient Use of the SOL Solvers in TOMLAB 71 9.1 Setting Parameters for the SOL Solvers . ........ 71 9.2 Derivatives for the SOL Solvers . .......... 72 9.3 SOL Solver Output on Files . ..... 73 9.4 Warm Starts for the SOL Solvers . ......... 74 9.5 Memory Issues for the SOL Solvers . ........ 75 10 Special Notes and Features 76 10.1 Approximation of Derivatives . .............. 76 10.2 Speed and Solution of Optimization Subproblems . ....... 79 10.3 User Supplied Problem Parameters . ........ 80 10.4 UserGivenStationaryPoint. ............. 81 10.5 Print Levels and Printing Utilities . ............... 82 10.6 Partially Separable Functions . ........... 83 10.7 Usage of routines from Optimization Toolbox 1.x . ............... 84 10.8 UsingMatlab5.0or5.1 ............................. ............. 84 10.9 UtilityTestRoutines................................ ............ 84 11 The tomGUI Graphical User Interface (GUI) 85 11.1 The Input Modes . ...... 88 11.2 General Parameter Mode . ........ 88 11.3 Solver Parameter Mode . ......... 90 11.4 PlotParameterMode ................................. .......... 91 3 12 The Menu Program tomMenu 93 13 The TOMLAB Routines - Detailed Descriptions 96 13.1TheTOMSolvers ...................................... ....... 96 13.1.1 clsSolve ............................................... 96 13.1.2 conSolve ............................................... 98 13.1.3 cutPlane ............................................... 101 13.1.4 DualSolve .............................................. 103 13.1.5 ego .................................................. 105 13.1.6 expSolve ............................................... 108 13.1.7 glbSolve ............................................... 110 13.1.8 glbFast ............................................... 112 13.1.9 glcSolve ............................................... 114 13.1.10 glcFast ................................................ 116 13.1.11 glcCluster .............................................. 119 13.1.12 infSolve ............................................... 121 13.1.13 lpSolve ............................................... 123 13.1.14 L1Solve ............................................... 125 13.1.15 mipSolve .............................................. 127 13.1.16 nlpSolve ............................................... 130 13.1.17 qpSolve ............................................... 132 13.1.18 rbfSolve ............................................... 134 13.1.19 slsSolve ............................................... 137 13.1.20 sTrustr ............................................... 139 13.1.21 itrr .................................................. 141 13.1.22 ucSolve ............................................... 142 13.1.23 pensdpTL .............................................. 144 13.1.24 penfeas sdp ............................................. 148 13.1.25 penbmiTL .............................................. 149 13.1.26 penfeas bmi ............................................. 154 13.1.27 pdcoTL ............................................... 156 13.1.28 pdscoTL ............................................... 159 13.2 Utility Functions in TOMLAB . .......... 162 13.2.1 tomRun ............................................... 162 13.2.2 cpTransf ............................................... 164 13.2.3 LineSearch ............................................. 165 13.2.4 intpol2 ................................................ 166 13.2.5 intpol3 ................................................ 166 13.2.6 preSolve ............................................... 167 13.2.7 PrintResult ............................................. 168 13.2.8 runtest ................................................ 169 13.2.9 SolverList .............................................. 170 4 13.2.10 systest ................................................ 171 14 TOMLAB LDO (Linear and Discrete Optimization) 172 14.1 Optimization Algorithms and Solvers in TOMLAB LDO . ............ 172 14.1.1 LinearProgramming............................... ......... 172 14.1.2 Transportation Programming . ............. 173 14.1.3 NetworkProgramming. .......... 173 14.1.4 Mixed-Integer Programming . ......... 174 14.1.5 DynamicProgramming . ......... 174 14.1.6 QuadraticProgramming. ......... 175 14.1.7 Lagrangian Relaxation . ............ 175 14.1.8 UtilityRoutines ................................. ......... 175 14.2 How to Solve Optimization Problems Using TOMLAB LDO . ........... 176 14.2.1 How to Solve Linear Programming Problems . .......... 176 14.2.2 How to Solve Transportation Programming Problems . .............. 177 14.2.3 How to Solve Network Programming Problems . ........... 177 14.2.4 How to Solve Integer Programming Problems . ........... 179 14.2.5 How to Solve Dynamic Programming Problems . ........... 180 14.2.6 How to Solve Lagrangian Relaxation Problems . ............. 180 14.3 Printing Utilities and Print Levels . ............... 182 14.4 Optimization Routines in TOMLAB LDO . ......... 183 14.4.1 akarmark .............................................. 183 14.4.2 balas ................................................. 184 14.4.3 dijkstra ............................................... 185 14.4.4 dpinvent ............................................... 186 14.4.5 dpknap ............................................... 187 14.4.6 karmark ............................................... 188 14.4.7 ksrelax ................................................ 189 14.4.8 labelcor ............................................... 190 14.4.9 lpdual ................................................ 191 14.4.10 lpkarma ............................................... 192 14.4.11 lpsimp1 ............................................... 193 14.4.12 lpsimp2 ............................................... 194 14.4.13 maxflow ............................................... 195 14.4.14 modlabel .............................................
Load more

Recommended publications
  • How to Use Your Favorite MIP Solver: Modeling, Solving, Cannibalizing
    How to use your favorite MIP Solver: modeling, solving, cannibalizing Andrea Lodi University of Bologna, Italy [email protected] January-February, 2012 @ Universit¨atWien A. Lodi, How to use your favorite MIP Solver Setting • We consider a general Mixed Integer Program in the form: T maxfc x : Ax ≤ b; x ≥ 0; xj 2 Z; 8j 2 Ig (1) where matrix A does not have a special structure. A. Lodi, How to use your favorite MIP Solver 1 Setting • We consider a general Mixed Integer Program in the form: T maxfc x : Ax ≤ b; x ≥ 0; xj 2 Z; 8j 2 Ig (1) where matrix A does not have a special structure. • Thus, the problem is solved through branch-and-bound and the bounds are computed by iteratively solving the LP relaxations through a general-purpose LP solver. A. Lodi, How to use your favorite MIP Solver 1 Setting • We consider a general Mixed Integer Program in the form: T maxfc x : Ax ≤ b; x ≥ 0; xj 2 Z; 8j 2 Ig (1) where matrix A does not have a special structure. • Thus, the problem is solved through branch-and-bound and the bounds are computed by iteratively solving the LP relaxations through a general-purpose LP solver. • The course basically covers the MIP but we will try to discuss when possible how crucial is the LP component (the engine), and how much the whole framework is built on top the capability of effectively solving LPs. • Roughly speaking, using the LP computation as a tool, MIP solvers integrate the branch-and-bound and the cutting plane algorithms through variations of the general branch-and-cut scheme [Padberg & Rinaldi 1987] developed in the context of the Traveling Salesman Problem (TSP).
    [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]
  • Propt Product Sheet
    PROPT - The world’s fastest Optimal Control platform for MATLAB. PROPT - ONE OF A KIND, LIGHTNING FAST SOLUTIONS TO YOUR OPTIMAL CONTROL PROBLEMS! NOW WITH WELL OVER 100 TEST CASES! The PROPT software package is intended to When using PROPT, optimally coded analytical solve dynamic optimization problems. Such first and second order derivatives, including problems are usually described by: problem sparsity patterns are automatically generated, thereby making it the first MATLAB • A state-space model of package to be able to fully utilize a system. This can be NLP (and QP) solvers such as: either a set of ordinary KNITRO, CONOPT, SNOPT and differential equations CPLEX. (ODE) or differential PROPT currently uses Gauss or algebraic equations (PAE). Chebyshev-point collocation • Initial and/or final for solving optimal control conditions (sometimes problems. However, the code is also conditions at other written in a more general way, points). allowing for a DAE rather than an ODE formulation. Parameter • A cost functional, i.e. a estimation problems are also scalar value that depends possible to solve. on the state trajectories and the control function. PROPT has three main functions: • Sometimes, additional equations and variables • Computation of the that, for example, relate constant matrices used for the the initial and final differentiation and integration conditions to each other. of the polynomials used to approximate the solution to the trajectory optimization problem. The goal of PROPT is to make it possible to input such problem • Source transformation to turn descriptions as simply as user-supplied expressions into possible, without having to worry optimized MATLAB code for the about the mathematics of the cost function f and constraint actual solver.
    [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]
  • Derivative-Free Optimization: a Review of Algorithms and Comparison of Software Implementations
    J Glob Optim (2013) 56:1247–1293 DOI 10.1007/s10898-012-9951-y Derivative-free optimization: a review of algorithms and comparison of software implementations Luis Miguel Rios · Nikolaos V. Sahinidis Received: 20 December 2011 / Accepted: 23 June 2012 / Published online: 12 July 2012 © Springer Science+Business Media, LLC. 2012 Abstract This paper addresses the solution of bound-constrained optimization problems using algorithms that require only the availability of objective function values but no deriv- ative information. We refer to these algorithms as derivative-free algorithms. Fueled by a growing number of applications in science and engineering, the development of derivative- free optimization algorithms has long been studied, and it has found renewed interest in recent time. Along with many derivative-free algorithms, many software implementations have also appeared. The paper presents a review of derivative-free algorithms, followed by a systematic comparison of 22 related implementations using a test set of 502 problems. The test bed includes convex and nonconvex problems, smooth as well as nonsmooth prob- lems. The algorithms were tested under the same conditions and ranked under several crite- ria, including their ability to find near-global solutions for nonconvex problems, improve a given starting point, and refine a near-optimal solution. A total of 112,448 problem instances were solved. We find that the ability of all these solvers to obtain good solutions dimin- ishes with increasing problem size. For the problems used in this study, TOMLAB/MULTI- MIN, TOMLAB/GLCCLUSTER, MCS and TOMLAB/LGO are better, on average, than other derivative-free solvers in terms of solution quality within 2,500 function evaluations.
    [Show full text]
  • TOMLAB –Unique Features for Optimization in MATLAB
    TOMLAB –Unique Features for Optimization in MATLAB Bad Honnef, Germany October 15, 2004 Kenneth Holmström Tomlab Optimization AB Västerås, Sweden [email protected] ´ Professor in Optimization Department of Mathematics and Physics Mälardalen University, Sweden http://tomlab.biz Outline of the talk • The TOMLAB Optimization Environment – Background and history – Technology available • Optimization in TOMLAB • Tests on customer supplied large-scale optimization examples • Customer cases, embedded solutions, consultant work • Business perspective • Box-bounded global non-convex optimization • Summary http://tomlab.biz Background • MATLAB – a high-level language for mathematical calculations, distributed by MathWorks Inc. • Matlab can be extended by Toolboxes that adds to the features in the software, e.g.: finance, statistics, control, and optimization • Why develop the TOMLAB Optimization Environment? – A uniform approach to optimization didn’t exist in MATLAB – Good optimization solvers were missing – Large-scale optimization was non-existent in MATLAB – Other toolboxes needed robust and fast optimization – Technical advantages from the MATLAB languages • Fast algorithm development and modeling of applied optimization problems • Many built in functions (ODE, linear algebra, …) • GUIdevelopmentfast • Interfaceable with C, Fortran, Java code http://tomlab.biz History of Tomlab • President and founder: Professor Kenneth Holmström • The company founded 1986, Development started 1989 • Two toolboxes NLPLIB och OPERA by 1995 • Integrated format for optimization 1996 • TOMLAB introduced, ISMP97 in Lausanne 1997 • TOMLAB v1.0 distributed for free until summer 1999 • TOMLAB v2.0 first commercial version fall 1999 • TOMLAB starting sales from web site March 2000 • TOMLAB v3.0 expanded with external solvers /SOL spring 2001 • Dash Optimization Ltd’s XpressMP added in TOMLAB fall 2001 • Tomlab Optimization Inc.
    [Show full text]
  • Process Optimization
    Process Optimization Mathematical Programming and Optimization of Multi-Plant Operations and Process Design Ralph W. Pike Director, Minerals Processing Research Institute Horton Professor of Chemical Engineering Louisiana State University Department of Chemical Engineering, Lamar University, April, 10, 2007 Process Optimization • Typical Industrial Problems • Mathematical Programming Software • Mathematical Basis for Optimization • Lagrange Multipliers and the Simplex Algorithm • Generalized Reduced Gradient Algorithm • On-Line Optimization • Mixed Integer Programming and the Branch and Bound Algorithm • Chemical Production Complex Optimization New Results • Using one computer language to write and run a program in another language • Cumulative probability distribution instead of an optimal point using Monte Carlo simulation for a multi-criteria, mixed integer nonlinear programming problem • Global optimization Design vs. Operations • Optimal Design −Uses flowsheet simulators and SQP – Heuristics for a design, a superstructure, an optimal design • Optimal Operations – On-line optimization – Plant optimal scheduling – Corporate supply chain optimization Plant Problem Size Contact Alkylation Ethylene 3,200 TPD 15,000 BPD 200 million lb/yr Units 14 76 ~200 Streams 35 110 ~4,000 Constraints Equality 761 1,579 ~400,000 Inequality 28 50 ~10,000 Variables Measured 43 125 ~300 Unmeasured 732 1,509 ~10,000 Parameters 11 64 ~100 Optimization Programming Languages • GAMS - General Algebraic Modeling System • LINDO - Widely used in business applications
    [Show full text]
  • Optimal Control Theory Version 0.2
    An Introduction to Mathematical Optimal Control Theory Version 0.2 By Lawrence C. Evans Department of Mathematics University of California, Berkeley Chapter 1: Introduction Chapter 2: Controllability, bang-bang principle Chapter 3: Linear time-optimal control Chapter 4: The Pontryagin Maximum Principle Chapter 5: Dynamic programming Chapter 6: Game theory Chapter 7: Introduction to stochastic control theory Appendix: Proofs of the Pontryagin Maximum Principle Exercises References 1 PREFACE These notes build upon a course I taught at the University of Maryland during the fall of 1983. My great thanks go to Martino Bardi, who took careful notes, saved them all these years and recently mailed them to me. Faye Yeager typed up his notes into a first draft of these lectures as they now appear. Scott Armstrong read over the notes and suggested many improvements: thanks, Scott. Stephen Moye of the American Math Society helped me a lot with AMSTeX versus LaTeX issues. My thanks also to Atilla Yilmaz for spotting lots of typos and errors, which I have corrected. I have radically modified much of the notation (to be consistent with my other writings), updated the references, added several new examples, and provided a proof of the Pontryagin Maximum Principle. As this is a course for undergraduates, I have dispensed in certain proofs with various measurability and continuity issues, and as compensation have added various critiques as to the lack of total rigor. This current version of the notes is not yet complete, but meets I think the usual high standards for material posted on the internet. Please email me at [email protected] with any corrections or comments.
    [Show full text]
  • Theory and Experimentation
    Acta Astronautica 122 (2016) 114–136 Contents lists available at ScienceDirect Acta Astronautica journal homepage: www.elsevier.com/locate/actaastro Suboptimal LQR-based spacecraft full motion control: Theory and experimentation Leone Guarnaccia b,1, Riccardo Bevilacqua a,n, Stefano P. Pastorelli b,2 a Department of Mechanical and Aerospace Engineering, University of Florida 308 MAE-A building, P.O. box 116250, Gainesville, FL 32611-6250, United States b Department of Mechanical and Aerospace Engineering, Politecnico di Torino, Corso Duca degli Abruzzi 24, Torino 10129, Italy article info abstract Article history: This work introduces a real time suboptimal control algorithm for six-degree-of-freedom Received 19 January 2015 spacecraft maneuvering based on a State-Dependent-Algebraic-Riccati-Equation (SDARE) Received in revised form approach and real-time linearization of the equations of motion. The control strategy is 18 November 2015 sub-optimal since the gains of the linear quadratic regulator (LQR) are re-computed at Accepted 18 January 2016 each sample time. The cost function of the proposed controller has been compared with Available online 2 February 2016 the one obtained via a general purpose optimal control software, showing, on average, an increase in control effort of approximately 15%, compensated by real-time implement- ability. Lastly, the paper presents experimental tests on a hardware-in-the-loop six- Keywords: Spacecraft degree-of-freedom spacecraft simulator, designed for testing new guidance, navigation, Optimal control and control algorithms for nano-satellites in a one-g laboratory environment. The tests Linear quadratic regulator show the real-time feasibility of the proposed approach. Six-degree-of-freedom & 2016 The Authors.
    [Show full text]
  • Research and Development of an Open Source System for Algebraic Modeling Languages
    Vilnius University Institute of Data Science and Digital Technologies LITHUANIA INFORMATICS (N009) RESEARCH AND DEVELOPMENT OF AN OPEN SOURCE SYSTEM FOR ALGEBRAIC MODELING LANGUAGES Vaidas Juseviˇcius October 2020 Technical Report DMSTI-DS-N009-20-05 VU Institute of Data Science and Digital Technologies, Akademijos str. 4, Vilnius LT-08412, Lithuania www.mii.lt Abstract In this work, we perform an extensive theoretical and experimental analysis of the char- acteristics of five of the most prominent algebraic modeling languages (AMPL, AIMMS, GAMS, JuMP, Pyomo), and modeling systems supporting them. In our theoretical comparison, we evaluate how the features of the reviewed languages match with the requirements for modern AMLs, while in the experimental analysis we use a purpose-built test model li- brary to perform extensive benchmarks of the various AMLs. We then determine the best performing AMLs by comparing the time needed to create model instances for spe- cific type of optimization problems and analyze the impact that the presolve procedures performed by various AMLs have on the actual problem-solving times. Lastly, we pro- vide insights on which AMLs performed best and features that we deem important in the current landscape of mathematical optimization. Keywords: Algebraic modeling languages, Optimization, AMPL, GAMS, JuMP, Py- omo DMSTI-DS-N009-20-05 2 Contents 1 Introduction ................................................................................................. 4 2 Algebraic Modeling Languages .........................................................................
    [Show full text]