Nonlinear Modeling, Estimation and Predictive Control in Apmonitor

Total Page:16

File Type:pdf, Size:1020Kb

Nonlinear Modeling, Estimation and Predictive Control in Apmonitor Brigham Young University BYU ScholarsArchive Faculty Publications 2014-11-05 Nonlinear Modeling, Estimation and Predictive Control in APMonitor John Hedengren Brigham Young University, [email protected] Reza Asgharzadeh Shishavan Brigham Young University Kody M. Powell University of Utah Thomas F. Edgar University of Texas at Austin Follow this and additional works at: https://scholarsarchive.byu.edu/facpub Part of the Chemical Engineering Commons BYU ScholarsArchive Citation Hedengren, John; Asgharzadeh Shishavan, Reza; Powell, Kody M.; and Edgar, Thomas F., "Nonlinear Modeling, Estimation and Predictive Control in APMonitor" (2014). Faculty Publications. 1667. https://scholarsarchive.byu.edu/facpub/1667 This Peer-Reviewed Article is brought to you for free and open access by BYU ScholarsArchive. It has been accepted for inclusion in Faculty Publications by an authorized administrator of BYU ScholarsArchive. For more information, please contact [email protected], [email protected]. Computers and Chemical Engineering 70 (2014) 133–148 Contents lists available at ScienceDirect Computers and Chemical Engineering j ournal homepage: www.elsevier.com/locate/compchemeng Nonlinear modeling, estimation and predictive control in APMonitor a,∗ a b b John D. Hedengren , Reza Asgharzadeh Shishavan , Kody M. Powell , Thomas F. Edgar a Department of Chemical Engineering, Brigham Young University, Provo, UT 84602, United States b The University of Texas at Austin, Austin, TX 78712, United States a r t i c l e i n f o a b s t r a c t Article history: This paper describes nonlinear methods in model building, dynamic data reconciliation, and dynamic Received 10 August 2013 optimization that are inspired by researchers and motivated by industrial applications. A new formulation Received in revised form 19 April 2014 of the 1-norm objective with a dead-band for estimation and control is presented. The dead-band in the Accepted 27 April 2014 objective is desirable for noise rejection, minimizing unnecessary parameter adjustments and movement Available online 9 May 2014 of manipulated variables. As a motivating example, a small and well-known nonlinear multivariable level control problem is detailed that has a number of common characteristics to larger controllers seen in Keywords: practice. The methods are also demonstrated on larger problems to reveal algorithmic scaling with sparse Advanced process control methods. The implementation details reveal capabilities of employing nonlinear methods in dynamic Differential algebraic equations applications with example code in both Matlab and Python programming languages. Model predictive control Dynamic parameter estimation © 2014 Elsevier Ltd. All rights reserved. Data reconciliation Dynamic optimization 1. Introduction are present. The art of using linear models to perform nonlin- ear control has been refined by a number of control experts to Applications of Model Predictive Control (MPC) are ubiquitous extend linear MPC to a wider range of applications. While this in a number of industries such as refining and petrochemicals approach is beneficial in deploying applications, maintenance costs (Darby and Nikolaou, 2012). Applications are also somewhat are increased and sustainability is decreased due to the complexity common in chemicals, food manufacture, mining, and other man- of the heuristic rules and configuration. ufacturing industries (Qin and Badgwell, 2003). Contributions by A purpose of this article is to give implementation details on Morari and others have extended the MPC applications to building using nonlinear models in the typical steps of dynamic optimiza- climate control (Gyalistras et al., 2011; Oldewurtel et al., 2010), tion including (1) model construction, (2) fitting parameters to data, stochastic systems (Nolde et al., 2008; Oldewurtel et al., 2008), (3) optimizing over a future predictive horizon, and (4) transfor- induction motors (Papafotiou et al., 2007), and other fast processes ming differential equations into sets of algebraic equations. Recent with explicit MPC (Bemporad et al., 2002; Hedengren and Edgar, advancements in numerical techniques have permitted the direct 2008; Johansen, 2004; Domahidi et al., 2011; Ferreau et al., 2008; application of nonlinear models in control applications (Findeisen Pannocchia et al., 2007). A majority of the applications employ et al., 2007), however, many nonlinear MPC applications require linear models that are constructed from empirical model identifi- advanced training to build and sustain an application. Perhaps cation, however, some of these processes have either semi-batch the one remaining obstacle to further utilization of nonlinear characteristics or nonlinear behavior. To ensure that the linear technology is the ease of deploying and sustaining applications models are applicable over a wider range of operating conditions by researchers and practitioners. Up to this point, there remain and disturbances, the linear models are retrofitted with elements relatively few actual industrial applications of control based on that approximate nonlinear control characteristics. Some of the nonlinear models. An objective of this paper is to reduce the barri- nonlinear process is captured by including gain scheduling, switch- ers to implementation of nonlinear advanced control applications. ing between multiple models depending on operating conditions, This is attempted by giving implementation details on the following and other logical programming when certain events or conditions topics: • ∗ nonlinear model development Corresponding author. Tel.: +1 801 477 7341. • parameter estimation from dynamic data E-mail address: [email protected] (J.D. Hedengren). http://dx.doi.org/10.1016/j.compchemeng.2014.04.013 0098-1354/© 2014 Elsevier Ltd. All rights reserved. 134 J.D. Hedengren et al. / Computers and Chemical Engineering 70 (2014) 133–148 • model predictive control with large-scale models or nonlinear, empirical or based on fundamental forms that results • direct transcription for solution of dynamic models from material and energy balances, reaction kinetic mechanisms, or other pre-defined model structure. The foundation of many of these correlations is on equations of motion, individual reaction In addition to the theoretical underpinnings of the techniques, expressions, or balance equations around a control volume such as a practical application with process data is used to demonstrate accumulation = inlet − outlet + generation − consumption. In the case model identification and control. The application used in this of a mole balance, for example, this includes molar flows, reactions, paper is a simple level control system that was selected to illus- d ni = − − trate the concepts without burdening the reader with model and an accumulation term (ni) (ni) (ni) . Model d t in out rxn complexity. In practice, much larger and more complex systems structure may also include constraints such as fixed gain ratios, can be solved using these techniques. An illustration of scale- constraints on compositions, or other bounds that reflect physical up to larger problems gives an indication of the size that can be realism. Detailing the full range of potential model structures is out- solved with current computational resources. The example prob- side the scope of this document. Eq. (1) is a statement of a general lems are demonstrated with the APMonitor Optimization Suite model form that may include differential, algebraic, continuous, (Hedengren, 2014, 2012), freely available software for solution of binary, and integer variables. linear programming (LP), quadratic programming (QP), nonlinear programming (NLP), and mixed-integer (MILP and MINLP) prob- lems. Several other software platforms can also solve dynamic d x optimization problems with a variety of modeling systems, solu- 0 = f , x, y, p, d, u (1a) d t tion strategies, and solvers (Cizniar et al., 2005; Houska et al., 2011; Piela et al., 1991; Tummescheit et al., 2010; Simon et al., 2009; Nagy et al., 2007). 0 = g(x, y, p, d, u) (1b) Of particular interest for this overview is the transformation of the differential and algebraic equation (DAE) systems into equiv- alent NLP or MINLP problems that can be solved by large-scale optimizers such as the active set solver APOPT (Hedengren et al., 0 ≤ h(x, y, p, d, u) (1c) 2012) and the interior point solver IPOPT (Wächter and Biegler, 2006). Specific examples are included in the appendices with commands to reproduce the examples in this paper. Some other The solution of Eq. (1) is determined by the initial state x0, a set of examples include applications of computational biology (Abbott parameters p, a trajectory of disturbance values d = (d0,d1,. .,dn−1), et al., 2012), unmanned aerial systems (Sun et al., 2014), chemi- and a sequence of control moves u = (u0,u1,. .,un−1). Likewise, the cal process control (Soderstrom et al., 2010), solid oxide fuel cells variables values may be determined from the equations such as (Jacobsen et al., 2013; Spivey et al., 2012), industrial process fouling differential x or algebraic equations y. The equations include dif- (Spivey et al., 2010), boiler load following (Jensen and Hedengren, ferential f, algebraic g, and inequality constraints h. The inequality 2012), energy storage (Powell et al., 2957; Powell and Edgar, 2011, constraints are included to model physical phenomena such as 2012), subsea monitoring systems (Hedengren and Brower, 2012; phase changes where complementarity conditions are required.
Recommended publications
  • Click to Edit Master Title Style
    Click to edit Master title style MINLP with Combined Interior Point and Active Set Methods Jose L. Mojica Adam D. Lewis John D. Hedengren Brigham Young University INFORM 2013, Minneapolis, MN Presentation Overview NLP Benchmarking Hock-Schittkowski Dynamic optimization Biological models Combining Interior Point and Active Set MINLP Benchmarking MacMINLP MINLP Model Predictive Control Chiller Thermal Energy Storage Unmanned Aerial Systems Future Developments Oct 9, 2013 APMonitor.com APOPT.com Brigham Young University Overview of Benchmark Testing NLP Benchmark Testing 1 1 2 3 3 min J (x, y,u) APOPT , BPOPT , IPOPT , SNOPT , MINOS x Problem characteristics: s.t. 0 f , x, y,u t Hock Schittkowski, Dynamic Opt, SBML 0 g(x, y,u) Nonlinear Programming (NLP) Differential Algebraic Equations (DAEs) 0 h(x, y,u) n m APMonitor Modeling Language x, y u MINLP Benchmark Testing min J (x, y,u, z) 1 1 2 APOPT , BPOPT , BONMIN x s.t. 0 f , x, y,u, z Problem characteristics: t MacMINLP, Industrial Test Set 0 g(x, y,u, z) Mixed Integer Nonlinear Programming (MINLP) 0 h(x, y,u, z) Mixed Integer Differential Algebraic Equations (MIDAEs) x, y n u m z m APMonitor & AMPL Modeling Language 1–APS, LLC 2–EPL, 3–SBS, Inc. Oct 9, 2013 APMonitor.com APOPT.com Brigham Young University NLP Benchmark – Summary (494) 100 90 80 APOPT+BPOPT APOPT 70 1.0 BPOPT 1.0 60 IPOPT 3.10 IPOPT 50 2.3 SNOPT Percentage (%) 6.1 40 Benchmark Results MINOS 494 Problems 5.5 30 20 10 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 Not worse than 2 times slower than
    [Show full text]
  • Click to Edit Master Title Style
    Click to edit Master title style APMonitor Modeling Language John Hedengren Brigham Young University Advanced Process Solutions, LLC http://apmonitor.com Overview of APM Software as a service accessible through: MATLAB, Python, Web-browser interface Linux / Windows / Mac OS / Android platforms Solvers 1 1 2 3 3 APOPT , BPOPT , IPOPT , SNOPT , MINOS Problem characteristics: min J (x, y,u, z) Large-scale x s.t. 0 f , x, y,u, z Nonlinear Programming (NLP) t Mixed Integer NLP (MINLP) 0 g(x, y,u, z) Multi-objective 0 h(x, y,u, z) n m m Real-time systems x, y u z Differential Algebraic Equations (DAEs) 1 – APS, LLC 2 – EPL 3 – SBS, Inc. Oct 14, 2012 APMonitor.com Advanced Process Solutions, LLC Overview of APM Vector / matrix algebra with set notation Automatic Differentiation st nd Exact 1 and 2 Derivatives Large-scale, sparse systems of equations Object-oriented access Thermo-physical properties Database of preprogrammed models Parallel processing Optimization with uncertain parameters Custom solver or model connections Oct 14, 2012 APMonitor.com Advanced Process Solutions, LLC Unique Features of APM Initialization with nonlinear presolve minJ(x, y,u) x s.t. 0 f ,x, y,u min J (x, y,u) t 0 g(x, y,u) 0h(x, y,u) x minJ(x, y,u) x s.t. 0 f ,x, y,u s.t. 0 f , x, y,u t 0 g(x, y,u) t 0 h(x, y,u) minJ(x, y,u) x s.t. 0 f ,x, y,u t 0g(x, y,u) 0h(x, y,u) 0 g(x, y,u) minJ(x, y,u) x s.t.
    [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]
  • GEKKO Documentation Release 1.0.1
    GEKKO Documentation Release 1.0.1 Logan Beal, John Hedengren Aug 31, 2021 Contents 1 Overview 1 2 Installation 3 3 Project Support 5 4 Citing GEKKO 7 5 Contents 9 6 Overview of GEKKO 89 Index 91 i ii CHAPTER 1 Overview GEKKO is a Python package for machine learning and optimization of mixed-integer and differential algebraic equa- tions. It is coupled with large-scale solvers for linear, quadratic, nonlinear, and mixed integer programming (LP, QP, NLP, MILP, MINLP). Modes of operation include parameter regression, data reconciliation, real-time optimization, dynamic simulation, and nonlinear predictive control. GEKKO is an object-oriented Python library to facilitate local execution of APMonitor. More of the backend details are available at What does GEKKO do? and in the GEKKO Journal Article. Example applications are available to get started with GEKKO. 1 GEKKO Documentation, Release 1.0.1 2 Chapter 1. Overview CHAPTER 2 Installation A pip package is available: pip install gekko Use the —-user option to install if there is a permission error because Python is installed for all users and the account lacks administrative priviledge. The most recent version is 0.2. You can upgrade from the command line with the upgrade flag: pip install--upgrade gekko Another method is to install in a Jupyter notebook with !pip install gekko or with Python code, although this is not the preferred method: try: from pip import main as pipmain except: from pip._internal import main as pipmain pipmain(['install','gekko']) 3 GEKKO Documentation, Release 1.0.1 4 Chapter 2. Installation CHAPTER 3 Project Support There are GEKKO tutorials and documentation in: • GitHub Repository (examples folder) • Dynamic Optimization Course • APMonitor Documentation • GEKKO Documentation • 18 Example Applications with Videos For project specific help, search in the GEKKO topic tags on StackOverflow.
    [Show full text]
  • Component-Oriented Acausal Modeling of the Dynamical Systems in Python Language on the Example of the Model of the Sucker Rod String
    Component-oriented acausal modeling of the dynamical systems in Python language on the example of the model of the sucker rod string Volodymyr B. Kopei, Oleh R. Onysko and Vitalii G. Panchuk Department of Computerized Mechanical Engineering, Ivano-Frankivsk National Technical University of Oil and Gas, Ivano-Frankivsk, Ukraine ABSTRACT Typically, component-oriented acausal hybrid modeling of complex dynamic systems is implemented by specialized modeling languages. A well-known example is the Modelica language. The specialized nature, complexity of implementation and learning of such languages somewhat limits their development and wide use by developers who know only general-purpose languages. The paper suggests the principle of developing simple to understand and modify Modelica-like system based on the general-purpose programming language Python. The principle consists in: (1) Python classes are used to describe components and their systems, (2) declarative symbolic tools SymPy are used to describe components behavior by difference or differential equations, (3) the solution procedure uses a function initially created using the SymPy lambdify function and computes unknown values in the current step using known values from the previous step, (4) Python imperative constructs are used for simple events handling, (5) external solvers of differential-algebraic equations can optionally be applied via the Assimulo interface, (6) SymPy package allows to arbitrarily manipulate model equations, generate code and solve some equations symbolically. The basic set of mechanical components (1D translational “mass”, “spring-damper” and “force”) is developed. The models of a sucker rods string are developed and simulated using these components. The comparison of results of the sucker rod string simulations with practical dynamometer cards and Submitted 22 March 2019 Accepted 24 September 2019 Modelica results verify the adequacy of the models.
    [Show full text]
  • Datascientist Manual
    DATASCIENTIST MANUAL . 2 « Approcherait le comportement de la réalité, celui qui aimerait s’epanouir dans l’holistique, l’intégratif et le multiniveaux, l’énactif, l’incarné et le situé, le probabiliste et le non linéaire, pris à la fois dans l’empirique, le théorique, le logique et le philosophique. » 4 (* = not yet mastered) THEORY OF La théorie des probabilités en mathématiques est l'étude des phénomènes caractérisés PROBABILITY par le hasard et l'incertitude. Elle consistue le socle des statistiques appliqué. Rubriques ↓ Back to top ↑_ Notations Formalisme de Kolmogorov Opération sur les ensembles Probabilités conditionnelles Espérences conditionnelles Densités & Fonctions de répartition Variables aleatoires Vecteurs aleatoires Lois de probabilités Convergences et théorèmes limites Divergences et dissimilarités entre les distributions Théorie générale de la mesure & Intégration ------------------------------------------------------------------------------------------------------------------------------------------ 6 Notations [pdf*] Formalisme de Kolmogorov Phé nomé né alé atoiré Expé riéncé alé atoiré L’univérs Ω Ré alisation éléméntairé (ω ∈ Ω) Evé némént Variablé aléatoiré → fonction dé l’univér Ω Opération sur les ensembles : Union / Intersection / Complémentaire …. Loi dé Augustus dé Morgan ? Independance & Probabilités conditionnelles (opération sur des ensembles) Espérences conditionnelles 8 Variables aleatoires (discret vs reel) … Vecteurs aleatoires : Multiplét dé variablés alé atoiré (discret vs reel) … Loi marginalés Loi
    [Show full text]
  • Optimization of Battery Storage Profitability with Wind Energy
    Optimization of Battery Storage Profitability with Wind Energy Joseph Bloxham, Baichuan Liu, John Hedengren, Logan Beal Date 4/20/2018 Table of Contents Table of Contents ................................................................................................................ ii List of Figures ...................................................................................................................... iii List of Tables ....................................................................................................................... iv Optimization of Battery Storage Profitability with Wind Energy ....................................... 1 Abstract .............................................................................................................................. 1 Introduction and Background............................................................................................. 1 Modeling Framework ......................................................................................................... 2 Software ......................................................................................................................... 2 Model Overview ............................................................................................................. 2 Model Assumptions ....................................................................................................... 3 Input Data .....................................................................................................................
    [Show full text]
  • Comparison of Simulation Tools for Dynamic Models
    Comparison of Simulation Tools for Dynamic Models Sveinung M. Sund1, Marianne Plouvier2, and Bernt Lie1 1University of South-Eastern Norway, [email protected], 2IMT Mines Albi, France Abstract els to experimental data, to reuse such models for pro- cess design, stability analysis, control design, estimator Macroscopic models are used extensively in process en- design, etc. The various simulation tools have different gineering, and can often be posed as DAE (Differential support for and capabilities wrt. analysis and synthesis. Algebraic Equation) models. Three generic tools for solv- An important question is then: is it wise to aim at a one- ing such DAEs are compared: OpenModelica, Julia, and language/tool solution, or is it better to use different tools MATLAB. To make the comparison concrete, a simple for simulation and design/synthesis as long as the lan- non-linear process model from the literature was extended guages can interact? by removing simplifying assumptions; the more complex model was posed as DAEs. Some implementation details 1.2 Previous Work of DAE models in OpenModelica, Julia, and MATLAB Specialized process engineering tools are well developed, are given. Selected simulation results are given, with re- e.g., from AspenTech1, Process Systems Enterprise2, etc. sulting execution time. The three tools gave identical sim- More generic tools are also popular, such as Modelica ulation results. The tools are then compared wrt. cost, based tools (OpenModelica3, JModelica.org4, Dymola5, ease of use, documentation, numeric quality, Eco-system etc.), other high level tools (DAE Tools6, APMonitor7), , and possibility for reuse of models/library. Overall, Julia script based tools (MATLAB8, Python9, Julia10, etc.), and appears may appear as the best choice.
    [Show full text]
  • Numerical Optimization of Industrial Processes
    Czech Technical University in Prague Faculty of Electrical Engineering Department of Control Engineering Bachelor’s thesis Numerical optimization of industrial processes Lenka Caletková Supervisor: Ing. Jan Šulc Study Programme: Cybernetics and Robotics Field of Study: Systems and control Date: May 2013 iv Acknowledgements I would like to show my greatest appreciation to my supervisor Ing. Jan Šulc, who was always willing to help me with this project - even in his extra time - during the last two semesters. Without his encouragement and guidance this project would not have materialized. Many thanks belong to all my friends, who supported me in my tough times. Last but not least, I want to thank my supportive sister Jana and my great parents, who enabled me to study at the CTU, always stood by my side and gave me all their love. Abstract This thesis handles the conception of numerical optimizations and presents Python libraries, which are able to solve optimization problems. It compares their usability, stability and computing possibilities. All these aspects were tested on two specific industrial processes - control of the tunnel ventilation and heating systems control in buildings. A functional code in Python programming language for performance optimization of tunnel ventilation represents the outcome of this thesis. Abstrakt Tato bakalářská práce se věnuje pojmu numerické optimalizace a prezentuje knihovny pro- gramovacího jazyka Python, které je možné použít pro řešení optimalizačních úloh. Zároveň porovnává jejich použitelnost, stabilitu a výpočetní schopnosti. Všechny tyto aspekty byly testovány na dvou konkrétních průmyslových procesech - řízení ventilace v tunelech a řízení tepelných systémů v budovách. Výstup této práce představuje funkční kód v jazyce Python, který má za úkol optimalizovat výkon při ventilaci tunelu.
    [Show full text]
  • Software Implementation for Optimization of Production Planning Within Refineries
    Vol.VII(LXX) 1 - 10 Economic Insights – Trends and Challenges No. 1/2018 Software Implementation for Optimization of Production Planning within Refineries Cătălin Popescu Faculty of Economic Sciences, Petroleum-Gas University of Ploieşti, Bd. Bucureşti 39, 100680, Ploieşti, Romania e-mail: [email protected] Abstract The paper will analyse the advantages of using the RPMS program in order to optimize the production plan and to decide on the structure of raw materials and final products within refineries. Also, the paper will include some real-time refining activities to be analysed with the aim of optimizing production. Key words: optimization; RPM; production planning; decision point JEL Classification: C44; C61; C63; L23; L86 Introduction The most popular manufacturing optimization software used today by most refineries are RPMS (Honeywell License), PIMS (Aspen License), and GRTMPS (Harperly Systems License), all based on the LP-Linear Programming principles. These allow modelling of the refinery by using different tables and aim to find the optimal solution taking into account a number of limitations introduced in LP, either linear or non-linear. The constant change in demand-to-offer ratio on the global energy market, as well as the diversity of raw materials and final products on the market require significant economic and financial assessment capacities in the shortest possible time. The development of information systems within companies has allowed shorten the time to assess opportunities and risks in making decisions in order to conclude contracts for the purchase and sale of petroleum products, by taking into account all the expenditures related to the production and transport of goods.
    [Show full text]
  • Edit Master Title Style
    Click to edit Master title style APOPT and BPOPT: New NLP and MINLP Solvers for Differential Algebraic Systems with Benchmark Testing John D. Hedengren Jose L. Mojica Brigham Young University Kody M. Powell Wesley Cole Thomas F. Edgar The University of Texas at Austin Presentation Overview Overview of Benchmarking Testing. NLP Benchmarking Hock-Schittkowski Dynamic optimization Biological models MINLP Benchmarking MacMINLP Case studies Gravity Drained tank (MIDAE control problem) Energy Storage for smart grid Future Developments Oct 17, 2012 APMonitor.com | APOPT.com BYU – UT Austin Overview of Benchmark Testing NLP Benchmark Testing 1 1 2 3 3 min J (x, y,u) APOPT , BPOPT , IPOPT , SNOPT , MINOS x Problem characteristics: s.t. 0 f , x, y,u t Hock Schittkowski, Dynamic Opt, SBML 0 g(x, y,u) Nonlinear Programming (NLP) Differential Algebraic Equations (DAEs) 0 h(x, y,u) n m APMonitor Modeling Language x, y u MINLP Benchmark Testing min J (x, y,u, z) 1 1 2 4 APOPT , BPOPT , BONMIN , DICOPT x s.t. 0 f , x, y,u, z Problem characteristics: t MacMINLP, Industrial Test Set 0 g(x, y,u, z) Mixed Integer Nonlinear Programming (MINLP) 0 h(x, y,u, z) Mixed Integer Differential Algebraic Equations (MIDAEs) x, y n u m z m APMonitor & AMPL Modeling Language 1–APS, LLC 2–EPL, 3–SBS, Inc., 4-CMU Oct 17, 2012 APMonitor.com | APOPT.com BYU – UT Austin NLP Benchmark – Hock-Schittkowski (116) 100 90 80 70 60 APOPT+BPOPT APOPT 50 1.0 BPOPT 40 1.0 Percentage (%) IPOPT 3.10 30 IPOPT 2.3 SNOPT 20 6.1 MINOS 5.5 10 0 0 0.5
    [Show full text]
  • Linear Programming 1 Linear Programming
    Linear programming 1 Linear programming Linear programming (LP, or linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polyhedron, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine function defined on this polyhedron. A linear programming algorithm finds a point in the polyhedron where this A pictorial representation of a simple linear program with two variables and six inequalities. function has the smallest (or largest) value if such a point exists. The set of feasible solutions is depicted in light Linear programs are problems that can be expressed in canonical form: red and forms a polygon, a 2-dimensional polytope. The linear cost function is represented by the red line and the arrow: The red line is a level set of the cost function, and the arrow indicates the direction in which we are optimizing. A closed feasible region of a problem with three variables is a convex polyhedron. The surfaces giving a fixed value of the objective function are planes (not shown). The linear programming problem is to find a point on the polyhedron that is on the plane with the highest possible value.
    [Show full text]