|
Pyomo
Pyomo is a collection of Python software packages for formulating optimization models. Pyomo was developed by William Hart and Jean-Paul Watson at Sandia National Laboratories and David Woodruff at University of California, Davis. Significant extensions to Pyomo were developed by Bethany Nicholson and John Siirola at Sandia National Laboratories, Carl Laird at Purdue University, and Gabriel Hackebeil. Pyomo is an open-source project that is freely available, and it is licensed with the BSD license. Pyomo is developed as part of the COIN-OR project. Pyomo is a popular open-source software package that is used by a variety of government agencies and academic institutions. Features Pyomo allows users to formulate optimization problems in Python in a manner that is similar to the notation commonly used in mathematical optimization. Pyomo supports an object-oriented style of formulating optimization models, which are defined with a variety of modeling components: sets, scalar a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Optimization Software
Given a transformation between input and output values, described by a mathematical function ''f'', optimization deals with generating and selecting a best solution from some set of available alternatives, by systematically choosing input values from within an allowed set, computing the output of the function, and recording the best output values found during the process. Many real-world problems can be modeled in this way. For example, the inputs can be design parameters of a motor, the output can be the power consumption, or the inputs can be business choices and the output can be the obtained profit. An optimization problem, in this case a minimization problem, can be represented in the following way :''Given:'' a function ''f'' : ''A'' \to R from some set ''A'' to the real numbers :''Search for:'' an element ''x''0 in ''A'' such that ''f''(''x''0) ≤ ''f''(''x'') for all ''x'' in ''A''. In continuous optimization, ''A'' is some subset of the Euclidean space R''n'', often spec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
APOPT
APOPT (for Advanced Process OPTimizer) is a software package for solving large-scale optimization problems of any of these forms: * Linear programming (LP) * Quadratic programming (QP) * Quadratically constrained quadratic program (QCQP) * Nonlinear programming (NLP) * Mixed integer programming (MIP) * Mixed integer linear programming (MILP) * Mixed integer nonlinear programming (MINLP) Applications of the APOPT include chemical reactors, friction stir welding, prevention of hydrate formation in deep-sea pipelines, computational biology, solid oxide fuel cell A solid oxide fuel cell (or SOFC) is an electrochemical conversion device that produces electricity directly from oxidizing a fuel. Fuel cells are characterized by their electrolyte material; the SOFC has a solid oxide or ceramic electrolyte. A ...s, and flight controls for Unmanned Aerial Vehicles (UAVs). Benchmark Testing Standard benchmarks such as CUTEr and SBML curated models are used to test the performance ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Modeling Language
Algebraic modeling languages (AML) are high-level computer programming languages for describing and solving high complexity problems for large scale mathematical computation (i.e. large scale optimization type problems). One particular advantage of some algebraic modeling languages like AIMMS, AMPL, GAMS, Gekko, MathProg, Mosel, and OPL is the similarity of their syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization, which is supported by certain language elements like sets, indices, algebraic expressions, powerful sparse index and data handling variables, constraints with arbitrary names. The algebraic formulation of a model does not contain any hints how to process it. An AML does not solve those problems directly; instead, it calls appropriate external algorithms to obtain a solution. These algorithms are called solvers and can handle certain kind of mathematical probl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sandia National Laboratories
Sandia National Laboratories (SNL), also known as Sandia, is one of three research and development laboratories of the United States Department of Energy's National Nuclear Security Administration (NNSA). Headquartered in Kirtland Air Force Base in Albuquerque, New Mexico, it has a second principal facility next to Lawrence Livermore National Laboratory in California and a test facility in Waimea, Kauai, Hawaii. Sandia is owned by the U.S. federal government but privately managed and operated by National Technology and Engineering Solutions of Sandia, a wholly owned subsidiary of Honeywell International. Established in 1949, SNL is a "multimission laboratory" with the primary goal of advancing U.S. national security by developing various science-based technologies. Its work spans roughly 70 areas of activity, including nuclear deterrence, arms control, nonproliferation, hazardous waste disposal, and climate change. Sandia hosts a wide variety of research initiatives, incl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
AMPL
AMPL (A Mathematical Programming Language) 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). 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, 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. 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) accept AMPL input. Ac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spreadsheet
A spreadsheet is a computer application for computation, organization, analysis and storage of data in tabular form. Spreadsheets were developed as computerized analogs of paper accounting worksheets. The program operates on data entered in cells of a table. Each cell may contain either numeric or text data, or the results of formulas that automatically calculate and display a value based on the contents of other cells. The term ''spreadsheet'' may also refer to one such electronic document. Spreadsheet users can adjust any stored value and observe the effects on calculated values. This makes the spreadsheet useful for "what-if" analysis since many cases can be rapidly investigated without manual recalculation. Modern spreadsheet software can have multiple interacting sheets and can display data either as text and numerals or in graphical form. Besides performing basic arithmetic and mathematical functions, modern spreadsheets provide built-in functions for common financial a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Python (programming Language) Software
Python may refer to: Snakes * Pythonidae, a family of nonvenomous snakes found in Africa, Asia, and Australia ** ''Python'' (genus), a genus of Pythonidae found in Africa and Asia * Python (mythology), a mythical serpent Computing * Python (programming language), a widely used programming language * Python, a native code compiler for CMU Common Lisp * Python, the internal project name for the PERQ 3 computer workstation People * Python of Aenus (4th-century BCE), student of Plato * Python (painter), (ca. 360–320 BCE) vase painter in Poseidonia * Python of Byzantium, orator, diplomat of Philip II of Macedon * Python of Catana, poet who accompanied Alexander the Great * Python Anghelo (1954–2014) Romanian graphic artist Roller coasters * Python (Efteling), a roller coaster in the Netherlands * Python (Busch Gardens Tampa Bay), a defunct roller coaster * Python (Coney Island, Cincinnati, Ohio), a steel roller coaster Vehicles * Python (automobile maker), an Australian ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nl (format)
nl is a file format for presenting and archiving mathematical programming problems. Initially, this format has been invented for connecting solvers to AMPL. It has also been adopted by other systems such as COIN-OR (as one of the input formats), FortSP (for interacting with external solvers), and Coopr (as one of its output formats). The nl format 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 The nl format is low-level and is designed for compactness, not for readability. It has both binary and textual representation. Most commercial and a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
GLPK
The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library. The package is part of the GNU Project and is released under the GNU General Public License. Problems can be modeled in the language GNU MathProg (previously known as GMPL) which shares many parts of the syntax with AMPL and solved with standalone solver GLPSOL. GLPK can also be used as a C library. GLPK uses the revised simplex method and the primal-dual interior point method for non-integer problems and the branch-and-bound algorithm together with Gomory's mixed integer cuts for (mixed) integer problems. GLPK is supported in the free edition of the OptimJ modeling system An independent project provides a Java-based interface to GLPK (via JNI). This allows Java applications to call out to GLPK in a relatively ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IPOPT
IPOPT, short for "Interior Point OPTimizer, pronounced I-P-Opt", is a software library for large scale nonlinear optimization of continuous systems. It is written in Fortran and C and is released under the EPL (formerly CPL). IPOPT implements a primal-dual interior point method, and uses line searches based on Filter methods (Fletcher and Leyffer). IPOPT can be called from various modeling environments and C. IPOPT is part of the COIN-OR project. IPOPT is designed to exploit 1st and 2nd derivative ( Hessians) information if provided (usually via automatic differentiation routines in modeling environments such as AMPL). If no Hessians are provided, IPOPT will approximate them using a quasi-Newton methods, specifically a BFGS update. IPOPT was originally developed by Ph.D. studenAndreas Wächterand ProfLorenz T. Bieglerof the Department of Chemical Engineering at Carnegie Mellon University. Their work was recognized with thINFORMS Computing Society Prizein 2009. Arvind ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CPLEX
IBM ILOG CPLEX Optimization Studio (often informally referred to simply as CPLEX) is an optimization software package. In 2004, the work on CPLEX earned the first INFORMS Impact Prize. History The CPLEX Optimizer was named for the simplex method as implemented in the C programming language, although today it also supports other types of mathematical optimization and offers interfaces other than C. It was originally developed by Robert E. Bixby and sold commercially from 1988 by CPLEX Optimization Inc. This was acquired by ILOG in 1997 and ILOG was subsequently acquired by IBM in January 2009. CPLEX continues to be actively developed by IBM. Features The IBM ILOG CPLEX Optimizer solves integer programming problems, very large linear programming problems using either primal or dual variants of the simplex method or the barrier interior point method, convex and non-convex quadratic programming problems, and convex quadratically constrained problems (solved via second-order ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
