DrAmpl

Dr. Ampl is an AMPL-based optimization problem analyzer which may be used either as a stand-alone tool or hooked to a server such as NEOS. The capabilities of this analyzer include classification of the problem at hand, analysis of the objective and constraint functions and their variables, the providing of upper and lower bounds on the values of these functions over the feasible set and assessment of convexity. Two antagonistic approaches are considered for the latter point; namely a convexity disprover and a convexity prover.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 8 articles , 1 standard article )

Showing results 1 to 8 of 8.
Sorted by year (citations)

  1. Khajavirad, Aida; Sahinidis, Nikolaos V.: A hybrid LP/NLP paradigm for global optimization relaxations (2018)
  2. Lubin, Miles; Yamangil, Emre; Bent, Russell; Vielma, Juan Pablo: Polyhedral approximation in mixed-integer convex optimization (2018)
  3. Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma: Polyhedral approximation in mixed-integer convex optimization (2016) arXiv
  4. Lubin, Miles; Dunning, Iain: Computing in operations research using Julia (2015)
  5. Gay, David M.: Using expression graphs in optimization algorithms (2012)
  6. Fourer, Robert; Maheshwari, Chandrakant; Neumaier, Arnold; Orban, Dominique; Schichl, Hermann: Convexity and concavity detection in computational graphs: tree walks for convexity assessment (2010)
  7. Fourer, Robert; Orban, Dominique: DrAmpl: A meta solver for optimization problem analysis (2010)
  8. Grant, Michael; Boyd, Stephen; Ye, Yinyu: Disciplined convex programming (2006)