| 词条 | AMPL | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 释义 |
| name = AMPL | logo = | caption = | designers = Robert Fourer David Gay Brian Kernighan Bell Labs | paradigm = multi-paradigm: declarative, imperative | developer = AMPL Optimization, Inc. | released = {{Start date and age|1985}} | latest release version = 20131012 | latest release date = {{Start date and age|2013|10|12}} | latest test version = | latest test date = | typing = | implementations = | dialects = | influenced by = AWK, C | influenced = Coopr | operating system = Cross-platform: Linux, OS X, some Unix, Windows | license = Proprietary (translator), free and open-source (AMPL Solver Library) | genre = Algebraic modeling language (AML) | website = {{URL|www.ampl.com}} | file ext = .mod, .dat, .run }}A Mathematical Programming Language (AMPL) is an algebraic modeling language to describe and solve high-complexity problems for large-scale mathematical computing (i.e., large-scale optimization and scheduling-type problems).[1] It was developed by Robert Fourer, David Gay, and Brian Kernighan at Bell Laboratories. AMPL supports dozens of solvers, both open source and commercial software, including CBC, CPLEX, FortMP, Gurobi, MINOS, IPOPT, SNOPT, KNITRO, and LGO. Problems are passed to solvers as nl files. AMPL is used by more than 100 corporate clients, and by government agencies and academic institutions.[2] One advantage of AMPL is the similarity of its syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization. Many modern solvers available on the NEOS Server (formerly hosted at the Argonne National Laboratory, currently hosted at the University of Wisconsin, Madison[3]) accept AMPL input. According to the NEOS statistics AMPL is the most popular format for representing mathematical programming problems. FeaturesAMPL features a mix of declarative and imperative programming styles. Formulating optimization models occurs via declarative language elements such as sets, scalar and multidimensional parameters, decision variables, objectives and constraints, which allow for concise description of most problems in the domain of mathematical optimization. Procedures and control flow statements are available in AMPL for
To support re-use and simplify construction of large-scale optimization problems, AMPL allows separation of model and data. AMPL supports a wide range of problem types, among them:
AMPL invokes a solver in a separate process which has these advantages:
Interaction with the solver is done through a well-defined nl interface. AvailabilityAMPL is available for many popular 32- and 64-bit operating systems including Linux, Mac OS X, some Unix, and Windows.[5] The translator is proprietary software maintained by AMPL Optimization LLC. However, several online services exist, providing free modeling and solving facilities using AMPL.[6][7] A free student version with limited functionality and a free full-featured version for academic courses are also available.[8] AMPL can be used from within Microsoft Excel via the SolverStudio Excel add-in. The AMPL Solver Library (ASL), which allows reading nl files and provides the automatic differentiation, is open-source. It is used in many solvers to implement AMPL connection. Status historyThis table present significant steps in AMPL history.
{{anchor|example}}A sample modelA transportation problem from George Dantzig is used to provide a sample AMPL model. This problem finds the least cost shipping schedule that meets requirements at markets and supplies at factories.[14] set Plants; set Markets; # Capacity of plant p in cases param Capacity{p in Plants}; # Demand at market m in cases param Demand{m in Markets}; # Distance in thousands of miles param Distance{Plants, Markets};# Freight in dollars per case per thousand miles param Freight; # Transport cost in thousands of dollars per case param TransportCost{p in Plants, m in Markets} := Freight * Distance[p, m] / 1000; # Shipment quantities in cases var shipment{Plants, Markets} >= 0; # Total transportation costs in thousands of dollars minimize cost: sum{p in Plants, m in Markets} TransportCost[p, m] * shipment[p, m]; # Observe supply limit at plant p s.t. supply{p in Plants}: sum{m in Markets} shipment[p, m] <= Capacity[p]; # Satisfy demand at market m s.t. demand{m in Markets}: sum{p in Plants} shipment[p, m] >= Demand[m];set Plants := seattle san-diego; set Markets := new-york chicago topeka; param Capacity := seattle 350 san-diego 600; param Demand := new-york 325 chicago 300 topeka 275; param Distance : new-york chicago topeka := seattle 2.5 1.7 1.8 san-diego 2.5 1.8 1.4; SolversHere is a partial list of solvers supported by AMPL:[15]
See also
References1. ^1 {{cite book| title = AMPL: A Modeling Language for Mathematical Programming| last = Fourer| first = Robert| authorlink = Robert Fourer| author2 = Brian W. Kernighan| year = 2002| publisher = Duxbury Press| isbn = 978-0-534-38809-6| authorlink2 = Brian Kernighan}} 2. ^ {{cite web | title=Position Available | url=http://www.ampl.com/OPENINGS/2011July.html#Product | accessdate=2011-07-29}} 3. ^{{cite web|url=http://neos-guide.org/About/|title=About|publisher=|accessdate=11 August 2015}} 4. ^1 {{Cite journal |authorlink = Robert Fourer | authorlink2 = David M. Gay | title = Extending an Algebraic Modeling Language to Support Constraint Programming | journal = INFORMS Journal on Computing | volume = 14 | issue = 4 | pages = 322–344 | year = 2002 | url = http://joc.journal.informs.org/content/14/4/322 | doi=10.1287/ijoc.14.4.322.2825| last1 = Fourer | first1 = Robert | last2 = Gay | first2 = David M. | citeseerx = 10.1.1.8.9699 }} 5. ^AMPL page at AMPL Optimization Inc. 6. ^{{cite web|url=http://www.neos-server.org/neos/|title=NEOS Server for Optimization|publisher=|accessdate=11 August 2015}} 7. ^{{cite web|url=http://www.ampl.com/TRYAMPL/|title=Try AMPL!|publisher=|accessdate=11 August 2015}} 8. ^{{cite web|url=http://www.ampl.com/DOWNLOADS/index.html|title=AMPL Downloads|publisher=|accessdate=11 August 2015|archive-url=https://web.archive.org/web/20150526013237/http://www.ampl.com/DOWNLOADS/index.html|archive-date=26 May 2015|dead-url=yes|df=dmy-all}} 9. ^{{Cite journal | authorlink1 = Robert Fourer | authorlink2 = David M. Gay | authorlink3 = Brian W. Kernighan | title = A Modeling Language for Mathematical Programming | journal = Management Science | volume = 36 | issue = 5 | pages = 519–554–83 | year = 1990 | url = http://www.ampl.com/REFS/amplmod.pdf | doi=10.1287/mnsc.36.5.519| last1 = Fourer | first1 = Robert | last2 = Gay | first2 = David M. | last3 = Kernighan | first3 = Brian W. }} 10. ^{{cite web|url=http://computing.society.informs.org/pdf/GreenbergHistory.pdf|title=ICS - INFORMS|author=INFORMS|publisher=|accessdate=11 August 2015}} 11. ^{{Cite web | url=https://groups.google.com/group/ampl | title=Google Groups}} 12. ^{{cite web|url=http://www.informs.org/Blogs/E-News-Blog/INFORMS-Impact-Prize|title=INFORMS Impact Prize|author=INFORMS|publisher=|accessdate=11 August 2015|archive-url=https://web.archive.org/web/20131022091250/https://www.informs.org/Blogs/E-News-Blog/INFORMS-Impact-Prize|archive-date=22 October 2013|dead-url=yes|df=dmy-all}} 13. ^{{cite web|url=https://groups.google.com/forum/#!topic/ampl/y1FJcYZz-_Q|title=Google Groups|publisher=|accessdate=11 August 2015}} 14. ^Dantzig, G B, chapter 3.3 in Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963. 15. ^{{cite web|url=http://www.ampl.com/solvers.html|title=Solvers - AMPL|publisher=|accessdate=21 January 2018}} 16. ^{{cite web|url=https://projects.coin-or.org/Couenne |title=Couenne |accessdate=2013-10-27 |deadurl=yes |archiveurl=https://web.archive.org/web/20131029190415/https://projects.coin-or.org/Couenne |archivedate=2013-10-29 |df= }} 17. ^{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/ilogcp|title=mp/solvers/ilogcp at master · ampl/mp · GitHub|work=GitHub|accessdate=11 August 2015}} 18. ^{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/gecode|title=mp/solvers/gecode at master · ampl/mp · GitHub|work=GitHub|accessdate=11 August 2015}} 19. ^{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/jacop|title=mp/solvers/jacop at master · ampl/mp · GitHub|work=GitHub|accessdate=11 August 2015}} 20. ^{{cite web|url=http://ampl.com/products/solvers/solvers-we-sell/lgo/|title=LGO - AMPL|publisher=|accessdate=11 August 2015}} 21. ^{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/localsolver|title=mp/solvers/localsolver at master · ampl/mp · GitHub|work=GitHub|accessdate=11 August 2015}} 22. ^{{cite web|url=http://www.ampl.com/SOLVERS/GUIDE.lpsolve.html|title=Using lpsolve from AMPL|publisher=|accessdate=11 August 2015}} 23. ^{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/sulum|title=mp/solvers/sulum at master · ampl/mp · GitHub|work=GitHub|accessdate=11 August 2015}} External links
7 : 1990 software|Computer algebra systems|Mathematical modeling|Mathematical optimization software|Numerical programming languages|Scripting languages|Text-oriented programming languages |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。