|
AMPL, an acronym for "A Mathematical Programming Language", is an algebraic modeling language for describing and solving high-complexity problems for large-scale mathematical computation (i.e. large-scale optimization and scheduling-type problems).〔 〕 It was developed by Robert Fourer, David Gay and Brian Kernighan at Bell Laboratories. AMPL supports dozens of solvers, both open source and commercial, 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 a hundred corporate clients. It is also used by government agencies and academic institutions.〔 (【引用サイトリンク】 url=http://www.ampl.com/OPENINGS/2011July.html#Product ) 〕 One particular 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〔(【引用サイトリンク】title=NEOS Server for Optimization )〕 server (formerly hosted at the Argonne National Laboratory, currently hosted at the University of Wisconsin, Madison〔(【引用サイトリンク】title=About )〕) accept AMPL input. According to the NEOS statistics AMPL is the most popular format for representing mathematical programming problems. ==Features== AMPL features a mixture of declarative and imperative programming styles. Formulation of optimization models takes place through declarative language elements such as sets, scalar and multidimensional parameters, decision variables, objectives and constraints, which allow for a concise description of most problems in the domain of mathematical optimization. Procedures and control flow statements are available in AMPL for * the exchange of data with external data sources such as spreadsheets, databases, XML and text files * data pre- and post-processing tasks around optimization models * the construction of hybrid algorithms for problem types for which no direct efficient solvers are available. 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: * Linear programming * Quadratic programming * Nonlinear programming * Mixed-integer programming * Mixed-integer quadratic programming with or without convex quadratic constraints * Mixed-integer nonlinear programming * Second-order cone programming * Global optimization * Semidefinite programming problems with bilinear matrix inequalities * Complementarity problems (MPECs) in discrete or continuous variables * Constraint programming〔 〕 AMPL invokes a solver in a separate process which has the following advantages: * User can interrupt the solution process at any time * Solver errors do not affect the interpreter * 32-bit version of AMPL can be used with a 64-bit solver and vice versa Interaction with the solver is done through a well-defined nl interface. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「AMPL」の詳細全文を読む スポンサード リンク
|