scientific article; zbMATH DE number 1114457
The first part of this paper explores combinatorial extensions to the AMPL modeling language, with the goal of showing that such a language can provide the expressiveness desired by builders of combinatorial optimization models. AMPL's broad range of forms for set and arithmetic expressions are particularly well suited to a variety of extensions. In many cases, it suffices to define new operators by analogy with the syntactic forms of current ones, or to extend the range of contexts in which variables are permitted. Further advantage is gained by extending the concept of a variable to permit values that are arbitrary objects or sets of objects. The second part of this paper considers how ILOG SOLVER could provide the general-purpose solver required by the first part's language extensions. The major focus of SOLVER has been to serve as a C++ class library for embedding constraint logic programming techniques in users' applications. As its range of applications has expanded, it has accumulated a variety of constraint and expression forms, which have turned out to correspond nicely to the features that would be needed to provide a general-purpose algorithmic framework for the AMPL combinatorial extensions. Thus SOLVER provides an empirical confirmation of the proposed extensions' practical value, while also demonstrating that a general-purpose optimizer for combinatorial optimization is a reasonable possibility. An implementatio of a link from integer programs in AMPL to the optimization procedures in SOLVER is described in section 4, and specific SOLVER C++ classes that would correspond to the proposed AMPL combinatorial extensions are identified in section 5. Thus this paper lays the groundwork for the actual implementation of combinatorial features in an algebraic modeling language. Section 6 concludes by discussing some of the challenges that are likely to be faced in any initial implementation and the refinements that are likely to follow. For the entire collection see [Zbl 0881.00042].
- Extending an algebraic modeling language to support constraint programming
- The AMPL modeling language: an aid to formulating and solving optimization problems
- A Modeling Language for Mathematical Programming
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
- Embedding optimisation algorithms with Mosel
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- Extending an algebraic modeling language to support constraint programming
- Using expression graphs in optimization algorithms
- Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
- Declarative specification and solution of combinatorial auctions using logic programming
- Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming
- Logic Programming
- A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development
- DrAmpl: A meta solver for optimization problem analysis
- A Modeling Language for Mathematical Programming
- Polylithic modeling and solution approaches using algebraic modeling systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377040)