Large-scale nonlinear programming using IPOPT: An integrating framework for enterprise-wide dynamic optimization

نویسندگان

  • Lorenz T. Biegler
  • Victor M. Zavala
چکیده

Integrationof real-timeoptimization and controlwithhigher level decision-making (scheduling andplanning) is an essential goal for profitable operation in a highly competitive environment. While integrated large-scale optimization models have been formulated for this task, their size and complexity remains a challenge to many available optimization solvers. On the other hand, recent development of powerful, large-scale solvers leads to a reconsideration of these formulations, in particular, through development of efficient large-scale barrier methods for nonlinear programming (NLP). As a result, it is now realistic to eal-time optimization odel predictive control oving horizon estimation onlinear programming ensitivity solve NLPs on the order of amillion variables, for instance, with the IPOPT algorithm.Moreover, the recent NLP sensitivity extension to IPOPT quickly computes approximate solutions of perturbedNLPs. This allows on-line computations to be drastically reduced, even when large nonlinear optimization models are considered. These developments are demonstrated on dynamic real-time optimization strategies that can be used tomerge and replace the tasks of (steady-state) real-time optimization and (linear)model predictive control. We consider a recent case study of a low density polyethylene (LDPE) process to illustrate these concepts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-scale Nonlinear Programming: An Integrating Framework for Enterprise-Wide Dynamic Optimization

Integration of real-time optimization and control with higher level decision making (scheduling and planning) is an essential goal for profitable operation in a highly competitive environment. While integrated large-scale optimization models have been formulated for this task, their size and complexity remains a challenge to many available optimization solvers. On the other hand, recent develop...

متن کامل

Dynamic Optimization in JModelica.org

We present the open-source software framework in JModelica.org for numerically solving large-scale dynamic optimization problems. The framework solves problems whose dynamic systems are described in Modelica, an open modeling language supported by several different tools. The framework implements a numerical method based on direct local collocation, of which the details are presented. The imple...

متن کامل

Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods

The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods ...

متن کامل

Large-Scale Nonlinear Programming for Multi-scenario Optimization

Multi-scenario optimization is a convenient way to formulate design optimization problems that are tolerant to disturbances and model uncertainties and/or need to operate under a variety of different conditions. Moreover, this problem class is often an essential tool to deal with semi-infinite problems. Here we adapt the IPOPT barrier nonlinear programming algorithm to provide efficient paralle...

متن کامل

Optimization-based approach to path planning for closed chain robot systems

An application of advanced optimization techniques to solve the path planning problem for closed chain robot systems is proposed. The approach to path planning is formulated as a “quasi-dynamic” NonLinear Programming (NLP) problem with equality and inequality constraints in terms of the joint variables. The essence of the method is to find joint paths which satisfy the given constraints and min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Chemical Engineering

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2009