DrAmpl: A meta solver for optimization problem analysis

DOI10.1007/S10287-009-0101-ZMaRDI QIDQ601972zbMATH OpenOpenAlexFDO

Authors Robert Fourer, D. Orban

Publication date 29 October 2010

Published in Computational Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10287-009-0101-z

zbMATH Keywords

directed acyclic graphoptimization modelAMPL modeling languageconvexity assessmentsolver recommendationstructural model analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• The AMPL modeling language: an aid to formulating and solving optimization problems
• A Modeling Language for Mathematical Programming
• scientific article; zbMATH DE number 1639657
• Analyzing mathematical programs using MProbe
• scientific article; zbMATH DE number 1114457

Cites work

• scientific article; zbMATH DE number 992821 (Why is no real title available?)
• scientific article; zbMATH DE number 3131420 (Why is no real title available?)
• scientific article; zbMATH DE number 107545 (Why is no real title available?)
• scientific article; zbMATH DE number 140017 (Why is no real title available?)
• scientific article; zbMATH DE number 1971713 (Why is no real title available?)
• scientific article; zbMATH DE number 1456803 (Why is no real title available?)
• A trust region method based on interior point techniques for nonlinear programming.
• An SQP method for general nonlinear programs using only equality constrained subproblems
• An interior-point algorithm for nonconvex nonlinear programming
• Analyzing mathematical programs using MProbe
• Computational Graphs and Rounding Error
• Convexity and concavity detection in computational graphs: tree walks for convexity assessment
• Disciplined convex programming
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Interval analysis on directed acyclic graphs for global optimization
• On the Convergence of Successive Linear-Quadratic Programming Algorithms
• Solving the Trust-Region Subproblem using the Lanczos Method

Cited in

(5)

• SUSPECT: MINLP special structure detector for Pyomo
• Polyhedral approximation in mixed-integer convex optimization
• DrAmpl
• A hybrid LP/NLP paradigm for global optimization relaxations
• Computing in operations research using Julia

Describes a project that uses

Uses Software

• HSL-VF05
• NEOS
• FrontLine
• MProbe
• COPS
• Excel
• GAMS
• AMPL
• SNOPT
• LANCELOT

This page was built for publication: DrAmpl: A meta solver for optimization problem analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601972)