Difference between revisions of "Category:AMPL"

From mintOC
Jump to: navigation, search
m (Added introduction part)
m (Removed problem characterization category)
 
(8 intermediate revisions by 4 users not shown)
Line 1: Line 1:
−
This category lists all problems for which [http://www.ampl.org AMPL] code is provided. AMPL does not support differential equations, hence all models are a (finite-dimensional) discretization in one sense or another of a control problem.
+
This category lists all problems for which [http://www.ampl.org AMPL] code is provided. AMPL is a modeling language for mathematical programming, comparable to GAMS and ZIMBL. Its modeling syntax is very close to the mathematical one, and a wide range of linear and nonlinear (mixed-integer) solvers are interfaced. It comes with a commercial licence (free student version limited by 300 variables).
  
−
MIOCPs include features related to different mathematical disciplines. Hence, it is not surprising that very different approaches have been proposed to analyze and solve them. There are three generic approaches to solve model-based optimal control problems, compare <bibref>Binder2001</bibref>: first, solution of the Hamilton-Jacobi-Bellman equation and in a discrete setting Dynamic Programming, second indirect methods, also known as the first optimize, then discretize approach, and third direct methods (first optimize, then discretize) and in particular all--at--once approaches that solve the simulation and the optimization task simultaneously. The combination with the additional combinatorial restrictions on control functions comes at different levels: for free in dynamic programming, as the control space is evaluated anyhow, by means of an enumeration in the inner optimization problem of the necessary conditions of optimality in Pontryagin's maximum principle, or by various methods from integer programming in the direct methods.  
+
AMPL does not directly support control problems or differential equations, hence all models are a (finite-dimensional) discretization in one sense or another of a control problem.
  
−
Even in the case of direct methods, there are multiple alternatives to proceed. Various approaches have been proposed to discretize the differential equations by means of shooting methods or collocation, e.g., <bibref>Bock1984,Biegler1984</bibref>, to (re)formulate the control problem by outer convexification <bibref>Sager2009</bibref>, to use global optimization methods by under- and overestimators, e.g., <bibref>Esposito2000,Papamichail2004,Chachuat2006</bibref>, to optimize the time-points for a given switching structure, e.g., <bibref>Kaya2003,Gerdts2006,Sager2009</bibref>, to consider a static optimization problem instead of the transient behavior, e.g., <bibref>Grossmann2005</bibref>, to approximate nonlinearities by piecewise-linear functions, e.g., <bibref>Martin2006</bibref>, or by approximating the combinatorial decisions by continuous formulations, as in <bibref>Burgschweiger2009</bibref> for drinking water networks.
+
They can be either obtained by hand, or by means of an automatized export. One example are the compilers available to process [[:Category:optimica | optimica]] models that automatically generate AMPL output, e.g., by applying a Radau collocation.
  
−
We do not want to discuss these methods here, but rather refer to <bibref>Sager2009,Sager2009b</bibref> for more comprehensive surveys. The main purpose of mentioning them is to point out that they all discretize the optimization problem in function space in a different manner, and hence result in different mathematical problems that are actually solved on a computer.
+
Recently, the [[:Category:AMPL/TACO | TACO Toolkit for AMPL Control Optimization]] is a new effort aimed at modeling optimal control problems in AMPL. A small set of extensions allows to decouple the choice of a discretization scheme from the actual AMPL model. [[:Category:Muscod | MUSCOD-II]] is the first solver to support AMPL models using the TACO extension.
  
−
Powerful commercial MILP solvers and advances in MINLP solvers as described in the other contributions to this book make the usage of general purpose MILP/MINLP solvers more and more attractive. Please be aware however that the MINLP formulations we provide in this category are only one out of many possible ways to formulate the underlying MIOCP problems.
+
== References ==
 +
<biblist />
  
−
 
+
[[Category: Implementation]]
−
[[Category:Problem characterization]]
+

Latest revision as of 09:56, 28 January 2016

This category lists all problems for which AMPL code is provided. AMPL is a modeling language for mathematical programming, comparable to GAMS and ZIMBL. Its modeling syntax is very close to the mathematical one, and a wide range of linear and nonlinear (mixed-integer) solvers are interfaced. It comes with a commercial licence (free student version limited by 300 variables).

AMPL does not directly support control problems or differential equations, hence all models are a (finite-dimensional) discretization in one sense or another of a control problem.

They can be either obtained by hand, or by means of an automatized export. One example are the compilers available to process optimica models that automatically generate AMPL output, e.g., by applying a Radau collocation.

Recently, the TACO Toolkit for AMPL Control Optimization is a new effort aimed at modeling optimal control problems in AMPL. A small set of extensions allows to decouple the choice of a discretization scheme from the actual AMPL model. MUSCOD-II is the first solver to support AMPL models using the TACO extension.

References

There were no citations found in the article.

Retrieved from "https://mintoc.de/index.php?title=Category:AMPL&oldid=1542"