Difference between revisions of "Sven Leyffer's Test Problems"

From Svenleyffer
Jump to navigation Jump to search
 
(One intermediate revision by the same user not shown)
Line 3: Line 3:
 
The problems are written in the modeling language [http://www.ampl.com AMPL].
 
The problems are written in the modeling language [http://www.ampl.com AMPL].
  
==== [[MacMPEC|MacMPEC: Mathematical Programs with Equilibrium Constraints]] ====
+
==== OPECS: Optimization Problems with Equilibrium Constraints ====
 +
 
 +
===== [[MacMPEC|MacMPEC: Mathematical Programs with Equilibrium Constraints]] =====
 
A  collection of Mathematical Programs with Equilibrium Constraints (MPEC) test problems in AMPL. The problems are largely academic with some small application examples.
 
A  collection of Mathematical Programs with Equilibrium Constraints (MPEC) test problems in AMPL. The problems are largely academic with some small application examples.
  
==== [[MacEPEC|Equilibrium Problems with Equilibrium Constraints (EPEC)]] ====
+
===== [[BndMPCC|BndMPCC: Bound-Constrained Mathematical Programs with Complementarity Constraints]] =====
 +
A small collection of MPCCs that have only simple bounds or complementarity constraints between variables.
 +
 
 +
===== [[MacEPEC|Equilibrium Problems with Equilibrium Constraints (EPEC)]] =====
 
A small collection or equilibrium problems with equilibrium constraints (EPECs). All models are written in AMPL.
 
A small collection or equilibrium problems with equilibrium constraints (EPECs). All models are written in AMPL.
  
Line 13: Line 18:
 
A small collection of multi-objective optimization problems (MOOPs). The problems are written in AMPL and formulated as multi-objective problems and also as MPECs that compute an optimal approximation of the Pareto surface.
 
A small collection of multi-objective optimization problems (MOOPs). The problems are written in AMPL and formulated as multi-objective problems and also as MPECs that compute an optimal approximation of the Pareto surface.
  
__NOTOC__
+
==== [[SrcInvert|AMPL Models for MIPDECO Source Inversion]] ====
 +
 
 +
A small collection of mixed-integer PDE-constrained optimization (MIPDECO) problems that model a 2D source inversion problem.

Latest revision as of 11:26, 17 September 2020

MacMINLP: Mixed Integer Nonlinear Programs

A collection of mixed-integer nonlinear optimization problems from academia and applications. The problems are written in the modeling language AMPL.

OPECS: Optimization Problems with Equilibrium Constraints

MacMPEC: Mathematical Programs with Equilibrium Constraints

A collection of Mathematical Programs with Equilibrium Constraints (MPEC) test problems in AMPL. The problems are largely academic with some small application examples.

BndMPCC: Bound-Constrained Mathematical Programs with Complementarity Constraints

A small collection of MPCCs that have only simple bounds or complementarity constraints between variables.

Equilibrium Problems with Equilibrium Constraints (EPEC)

A small collection or equilibrium problems with equilibrium constraints (EPECs). All models are written in AMPL.

Multiobjective Optimization Testproblems

A small collection of multi-objective optimization problems (MOOPs). The problems are written in AMPL and formulated as multi-objective problems and also as MPECs that compute an optimal approximation of the Pareto surface.

AMPL Models for MIPDECO Source Inversion

A small collection of mixed-integer PDE-constrained optimization (MIPDECO) problems that model a 2D source inversion problem.