180 relations: Affine transformation, AIMMS, Albert W. Tucker, Algebraic modeling language, Algorithm, AMPL, Apache License, APMonitor, Application programming interface, Approximation algorithm, Assignment problem, Barrier function, Benders' decomposition, Block diagram, Block matrix, Branch and bound, Branch and cut, Branch and price, BSD licenses, Canonical form, Cassowary (software), Christos Papadimitriou, Coefficient, COIN-OR, Column generation, Combinatorial optimization, Comparability, Computers and Intractability, Concave function, Cone, Constraint (mathematics), Convex function, Convex lattice polytope, Convex optimization, Convex polytope, Convex set, Coopr, Copyleft, Covering problems, CPLEX, Criss-cross algorithm, Cutting-plane method, Dantzig–Wolfe decomposition, David S. Johnson, Distance (graph theory), Dominating set, Duality (optimization), Dynamic programming, Dynamical system, Economics, ..., Ellipsoid method, Feasible region, Flow network, FortMP, Fourier–Motzkin elimination, Fractional coloring, Frank Lauren Hitchcock, FreeMat, Game theory, Günter M. Ziegler, General Algebraic Modeling System, George Dantzig, GNU Linear Programming Kit, Graph (mathematics), Gurobi, Half-space (geometry), Hirsch conjecture, IMSL Numerical Libraries, Independent set (graph theory), Institute for Operations Research and the Management Sciences, Integer programming, Interior point method, Intersection, Iterative method, Java (programming language), Jiří Matoušek (mathematician), Job shop scheduling, John von Neumann, Joseph Fourier, Karmarkar's algorithm, Karp's 21 NP-complete problems, Klee–Minty cube, Leonhard Euler, Leonid Kantorovich, Leonid Khachiyan, LINDO, Linear equation, Linear form, Linear inequality, Linear programming relaxation, Linear-fractional programming, Linearity, Lingo (programming language), Loss function, LP-type problem, Maple (software), Mark Overmars, Matching (graph theory), Mathcad, Mathematica, Mathematical model, Mathematical optimization, MATLAB, Matrix (mathematics), Maxima and minima, Maximum principle, Michael Garey, Microeconomics, Microsoft Excel, Minkowski addition, MINTO, MOSEK, NAG Numerical Library, Narendra Karmarkar, Naum Z. Shor, NMath Stats, Nobel Memorial Prize in Economic Sciences, Nonlinear programming, NP-hardness, Numerical Algorithms Group, O-Matrix, Octave, Odysseus, Operations research, Optimization Toolbox, OptimJ, Oriented matroid, P (complexity), Packing problems, Permissive free software licence, PHP, Polyhedron, Polytope, Proceedings of the USSR Academy of Sciences, Profit maximization, Proprietary software, Python (programming language), Qoca, Quadratic programming, R, R (programming language), Real number, Robert J. Vanderbei, Routing, SageMath, SAS (software), Scheduling (production processes), Scilab, SCIP (optimization software), Semidefinite programming, Set cover problem, Set packing, Shadow price, Simplex algorithm, Slack variable, Smale's problems, Springer Science+Business Media, Stephen Smale, Stochastic programming, Strong duality, Submodular set function, Sysquake, The Mathematical Intelligencer, Time complexity, Tjalling Koopmans, TOMLAB, Total dual integrality, Transpose, Travelling salesman problem, Unimodular matrix, Unit cube, Variable (computer science), Vector space, Vertex cover, VisSim, Weak duality, World War II, Worst-case complexity, Yinyu Ye, .NET Framework. Expand index (130 more) » « Shrink index
In geometry, an affine transformation, affine mapBerger, Marcel (1987), p. 38.
AIMMS (an acronym for "Advanced Interactive Multidimensional Modeling System") is a software system designed for modeling and solving large-scale optimization and scheduling-type problems.
New!!: Linear programming and AIMMS ·
Albert William Tucker (28 November 1905 – 25 January 1995) was a Canadian mathematician who made important contributions in topology, game theory, and non-linear programming.
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).
In mathematics and computer science, an algorithm is a self-contained step-by-step set of operations to be performed.
New!!: Linear programming and Algorithm ·
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).
New!!: Linear programming and AMPL ·
The Apache License is a free software license written by the Apache Software Foundation (ASF).
Advanced process monitor (APMonitor), is a modeling language for differential algebraic (DAE) equations.
New!!: Linear programming and APMonitor ·
In computer programming, an application programming interface (API) is a set of routines, protocols, and tools for building software applications.
In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems.
The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics.
In constrained optimization, a field of mathematics, a barrier function is a continuous function whose value on a point increases to infinity as the point approaches the boundary of the feasible region (Nocedal and Wright 1999).
Benders' decomposition (or Benders's decomposition) is a technique in mathematical programming that allows the solution of very large linear programming problems that have a special block structure.
A block diagram is a diagram of a system in which the principal parts or functions are represented by blocks connected by lines that show the relationships of the blocks.
New!!: Linear programming and Block diagram ·
In mathematics, a block matrix or a partitioned matrix is a matrix which is interpreted as having been broken into sections called blocks or submatrices.
New!!: Linear programming and Block matrix ·
Branch and bound (BB or B&B) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as general real valued problems.
Branch and cut is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some or all the unknowns are restricted to integer values.
In applied mathematics, branch and price is a method of combinatorial optimization for solving integer linear programming (ILP) and mixed integer linear programming (MILP) problems with many variables.
BSD licenses are a family of permissive free software licenses, imposing minimal restrictions on the redistribution of covered software.
New!!: Linear programming and BSD licenses ·
In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.
Cassowary is an incremental constraint solving toolkit that efficiently solves systems of linear equalities and inequalities.
Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949, Athens) is a Greek engineer, computer scientist, and professor of Computer Science at the University of California, Berkeley.
In mathematics, a coefficient is a multiplicative factor in some term of a polynomial, a series or any expression; it is usually a number, but in any case does not involve any variables of the expression.
New!!: Linear programming and Coefficient ·
COIN-OR, which stands for Computational Infrastructure for Operations Research, is a project that aims to "create for mathematical software what the open literature is for mathematical theory." The open literature (e.g., a research journal) provides the OR community with a peer-review process and an archive.
New!!: Linear programming and COIN-OR ·
Column generation or delayed column generation is an efficient algorithm for solving larger linear programs.
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
In mathematics, any two elements x and y of a set P that is partially ordered by a binary relation ≤ are comparable when either x ≤ y or y ≤ x. If it is not the case that x and y are comparable, then they are called incomparable.
New!!: Linear programming and Comparability ·
In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson.
In mathematics, a concave function is the negative of a convex function.
A cone is a three-dimensional geometric shape that tapers smoothly from a flat base (frequently, though not necessarily, circular) to a point called the apex or vertex.
New!!: Linear programming and Cone ·
In mathematics, a constraint is a condition of an optimization problem that the solution must satisfy.
In mathematics, a real-valued function defined on an interval is called convex (or convex downward or concave upward) if the line segment between any two points on the graph of the function lies above or on the graph, in a Euclidean space (or more generally a vector space) of at least two dimensions.
A convex lattice polytope (also called Z-polyhedron or Z-polytope) is a geometric object playing an important role in discrete geometry and combinatorial commutative algebra.
Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets.
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn.
In Euclidean space, a convex set is the region such that, for every pair of points within the region, every point on the straight line segment that joins the pair of points is also within the region.
New!!: Linear programming and Convex set ·
Coopr is a collection of Python software packages that supports a diverse set of optimization capabilities for formulating and analyzing optimization models.
New!!: Linear programming and Coopr ·
Copyleft (a play on the word copyright) is the practice of offering people the right to freely distribute copies and modified versions of a work with the stipulation that the same rights be preserved in derivative works down the line.
New!!: Linear programming and Copyleft ·
In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that.
IBM ILOG CPLEX Optimization Studio (often informally referred to simply as CPLEX) is an optimization software package.
New!!: Linear programming and CPLEX ·
In mathematical optimization, the criss-cross algorithm denotes a family of algorithms for linear programming.
In mathematical optimization, the cutting-plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts.
Dantzig–Wolfe decomposition is an algorithm for solving linear programming problems with special structure.
David Stifler Johnson (born December 9, 1945, Washington, D.C.) is an American computer scientist specializing in algorithms and optimization.
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them.
In graph theory, a dominating set for a graph G.
In mathematical optimization theory, duality means that optimization problems may be viewed from either of two perspectives, the primal problem or the dual problem (the duality principle).
In mathematics, computer science, economics, and bioinformatics, dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems.
In mathematics, a dynamical system is a set of relationships among two or more measurable quantities, in which a fixed rule describes how the quantities evolve over time in response to their own values.
Economics is the social science that seeks to describe the factors which determine the production, distribution and consumption of goods and services.
New!!: Linear programming and Economics ·
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions.
In mathematical optimization, a feasible region, feasible set, search space, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints.
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow.
New!!: Linear programming and Flow network ·
FortMP is a software package for solving large-scale optimization problems.
New!!: Linear programming and FortMP ·
Fourier–Motzkin elimination, also known as the FME method, is a mathematical algorithm for eliminating variables from a system of linear inequalities.
Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory.
Frank Lauren Hitchcock (1875–1957) was an American mathematician and physicist known for his formulation of the transportation problem in 1941.
FreeMat is a free open source numerical computing environment and programming language, similar to MATLAB and GNU Octave.
New!!: Linear programming and FreeMat ·
Game theory is the study of strategic decision-making.
New!!: Linear programming and Game theory ·
Günter Matthias Ziegler (born 19 May 1963) is a German mathematician.
The General Algebraic Modeling System (GAMS) is a high-level modeling system for mathematical optimization.
George Bernard Dantzig (November 8, 1914 – May 13, 2005) was an American mathematical scientist who made important contributions to operations research, computer science, economics, and statistics.
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.
In mathematics, and more specifically in graph theory, a graph is a representation of a set of objects where some pairs of objects are connected by links.
The Gurobi Optimizer is a commercial optimization solver for linear programming (LP), quadratic programming (QP), quadratically constrained programming (QCP), mixed integer linear programming (MILP), mixed-integer quadratic programming (MIQP), and mixed-integer quadratically constrained programming (MIQCP).
New!!: Linear programming and Gurobi ·
In geometry, a half-space is either of the two parts into which a plane divides the three-dimensional Euclidean space.
In mathematical programming and polyhedral combinatorics, the Hirsch conjecture is the statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n − d.
IMSL (International Mathematics and Statistics Library) is a commercial collection of software libraries of numerical analysis functionality that are implemented in the computer programming languages of C, Java, C#.NET, and Fortran.
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.
The Institute for Operations Research and the Management Sciences (INFORMS) is an international society for practitioners in the fields of operations research (OR) and management science.
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
Interior point methods (also referred to as barrier methods) are a certain class of algorithms that solves linear and nonlinear convex optimization problems.
In mathematics, the intersection of two or more objects is another, usually "smaller" object.
New!!: Linear programming and Intersection ·
In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems.
Java is a general-purpose computer programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible.
Jiří (Jirka) Matoušek (10 March 1963 – 9 March 2015) was a Czech mathematician working in computational geometry and algebraic topology.
Job shop scheduling (or job-shop problem) is an optimization problem in computer science and operations research in which ideal jobs are assigned to resources at particular times.
John von Neumann (Hungarian: Neumann János,; December 28, 1903 – February 8, 1957) was a Hungarian-American pure and applied mathematician, physicist, inventor, polymath, and polyglot.
Jean-Baptiste Joseph Fourier (21 March 1768 – 16 May 1830) was a French mathematician and physicist born in Auxerre and best known for initiating the investigation of Fourier series and their applications to problems of heat transfer and vibrations.
Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems.
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.
The Klee–Minty cube (named after Victor Klee and George J. Minty) is a unit cube whose corners have been slightly perturbed.
Leonhard Euler (17071783) was a pioneering Swiss mathematician and physicist.
Leonid Vitaliyevich Kantorovich (a) (19 January 19127 April 1986) was a Soviet mathematician and economist, known for his theory and development of techniques for the optimal allocation of resources.
Leonid Genrikhovich Khachiyan (Լեոնիդ Գենրիխովիչ Խաչիյան; Леонид Генрихович Хачиян; May 3, 1952 – April 29, 2005) was a Soviet mathematician of Armenian descent who taught Computer Science at Rutgers University.
LINDO is a software package for linear programming, integer programming, nonlinear programming, stochastic programming and global optimization.
New!!: Linear programming and LINDO ·
A linear equation is an algebraic equation in which each term is either a constant or the product of a constant and (the first power of) a single variable.
In linear algebra, a linear functional or linear form (also called a one-form or covector) is a linear map from a vector space to its field of scalars.
New!!: Linear programming and Linear form ·
In mathematics a linear inequality is an inequality which involves a linear function.
In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval.
In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP).
In common usage, linearity refers to a mathematical relationship or function that can be graphically represented as a straight line, as in two quantities that are directly proportional to each other, such as voltage and current in an RLC circuit, or the mass and weight of an object.
New!!: Linear programming and Linearity ·
Lingo is a verbose object-oriented scripting language developed by John H. Thompson for use in Adobe Director (formerly Macromedia Director).
In mathematical optimization, statistics, decision theory and machine learning, a loss function or cost function is a function that maps an event or values of one or more variables onto a real number intuitively representing some "cost" associated with the event.
New!!: Linear programming and Loss function ·
In the study of algorithms, an LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties with low-dimensional linear programs and that may be solved by similar algorithms.
Maple is a commercial computer algebra system developed and sold commercially by Maplesoft, a software company based in Waterloo, Ontario, Canada.
Markus Hendrik "Mark" Overmars (born 29 September 1958 in Zeist, Netherlands) is a Dutch computer scientist and teacher of game programming known for his game development application Game Maker.
New!!: Linear programming and Mark Overmars ·
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
Mathcad is computer software primarily intended for the verification, validation, documentation and re-use of engineering calculations.
New!!: Linear programming and Mathcad ·
Mathematica is a computational software program used in many scientific, engineering, mathematical and computing fields, based on symbolic mathematics.
New!!: Linear programming and Mathematica ·
A mathematical model is a description of a system using mathematical concepts and language.
In mathematics, computer science and operations research, mathematical optimization (alternatively, optimization or mathematical programming) is the selection of a best element (with regard to some criteria) from some set of available alternatives.
MATLAB (matrix laboratory) is a multi-paradigm numerical computing environment and fourth-generation programming language.
New!!: Linear programming and MATLAB ·
In mathematics, a matrix (plural matrices) is a rectangular array—of numbers, symbols, or expressions, arranged in rows and columns—that is interpreted and manipulated in certain prescribed ways.
In mathematical analysis, the maxima and minima (the plural of maximum and minimum) of a function, known collectively as extrema (the plural of extremum), are the largest and smallest value of the function, either within a given range (the local or relative extrema) or on the entire domain of a function (the global or absolute extrema).
In mathematics, the maximum principle is a property of solutions to certain partial differential equations, of the elliptic and parabolic types.
Michael Randolph Garey is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness.
New!!: Linear programming and Michael Garey ·
Microeconomics (from Greek prefix mikro- meaning "small") is a branch of economics that studies the behavior of individuals and firms in making decisions regarding the allocation of limited resources.
Microsoft Excel is a spreadsheet application developed by Microsoft for Microsoft Windows,, and iOS.
In geometry, the Minkowski sum (also known as dilation) of two sets of position vectors A and B in Euclidean space is formed by adding each vector in A to each vector in B, i.e., the set Analogously, the Minkowski difference is defined as The concept is named for Hermann Minkowski.
MINTO is an integer programming solver which uses branch and bound algorithm.
New!!: Linear programming and MINTO ·
MOSEK is a software package for the solution of linear, mixed-integer linear, quadratic, mixed-integer quadratic, quadratically constraint, conic and convex nonlinear mathematical optimization problems.
New!!: Linear programming and MOSEK ·
The NAG Numerical Library is a software product developed and sold by The Numerical Algorithms Group.
Narendra Krishna Karmarkar (born 1957) is an Indian mathematician, who developed Karmarkar's algorithm.
Naum Zuselevich Shor (Шор Наум Зуселевич) (1 January 1937 – 26 February 2006) was a Soviet and Ukrainian Jewish mathematician specializing in optimization.
New!!: Linear programming and Naum Z. Shor ·
NMath Stats is a statistical package for the Microsoft.NET Framework.
New!!: Linear programming and NMath Stats ·
The Nobel Memorial Prize in Economic Sciences (officially Sveriges riksbanks pris i ekonomisk vetenskap till Alfred Nobels minne, or the Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel), commonly referred to as the Nobel Prize in Economics, and as a "category of the Nobel Prize" by the Nobel Foundation itself, which owns the name Nobel Prize, though the Foundation itself does not refer to it as such.
In mathematics, nonlinear programming is the process of solving an optimization problem defined by a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized, where some of the constraints or the objective function are nonlinear.
NP-hardness (''n''on-deterministic ''p''olynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP".
New!!: Linear programming and NP-hardness ·
The Numerical Algorithms Group (NAG) is a software company which provides methods for the solution of mathematical and statistical problems, and offers services to users of High performance computing (HPC) systems.
O-Matrix is a matrix programming language for mathematics, engineering, science, and financial analysis, marketed by Harmonic Software.
New!!: Linear programming and O-Matrix ·
In music, an octave (octavus: eighth) or perfect octave is the interval between one musical pitch and another with half or double its frequency.
New!!: Linear programming and Octave ·
Odysseus (Ὀδυσσεύς), also known by the Latin name Ulysses (Ulyssēs, Ulixēs), was a legendary Greek king of Ithaca and the hero of Homer's epic poem the Odyssey.
New!!: Linear programming and Odysseus ·
Operations research, or operational research in British usage, is a discipline that deals with the application of advanced analytical methods to help make better decisions.
Optimization Toolbox is an optimization software package developed by MathWorks.
OptimJ is an extension of the Java with language support for writing optimization models and abstractions for bulk data processing.
New!!: Linear programming and OptimJ ·
An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of arrangements of vectors in a vector space over an ordered field (particularly for partially ordered vector spaces).
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes.
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers.
A permissive free software licence is a class of free software licence with minimal requirements about how the software can be redistributed.
PHP is a server-side scripting language designed for web development but also used as a general-purpose programming language.
New!!: Linear programming and PHP ·
In elementary geometry, a polyhedron (plural polyhedra or polyhedrons) is a solid in three dimensions with flat polygonal faces, straight edges and sharp corners or vertices.
New!!: Linear programming and Polyhedron ·
In elementary geometry, a polytope is a geometric object with flat sides, and may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope.
New!!: Linear programming and Polytope ·
The Proceedings of the USSR Academy of Sciences (Доклады Академии Наук СССР, Doklady Akademii Nauk SSSR (DAN SSSR), Comptes rendus de l'Académie des sciences de l'URSS) was a Soviet journal that was dedicated to publishing original, academic research papers in physics, mathematics, chemistry, geology, and biology.
In economics, profit maximization is the short run or long run process by which a firm determines the price and output level that returns the greatest profit.
Proprietary software, non-free software (in the sense of missing freedoms), or closed-source software is software, where the developers or distributors reserve all freedoms and rights.
Python is a widely used general-purpose, high-level programming language.
Qoca is a GPL library for incrementally solving systems of linear equations with various goal functions.
New!!: Linear programming and Qoca ·
Quadratic programming (QP) is a special type of mathematical optimization problem.
R (named ar/or) is the 18th letter of the modern English alphabet and the ISO basic Latin alphabet.
New!!: Linear programming and R ·
R is a programming language and software environment for statistical computing and graphics.
In mathematics, a real number is a value that represents a quantity along a continuous line.
New!!: Linear programming and Real number ·
Robert J. Vanderbei (born 1955) is an American mathematician and Professor in the Department of Operations Research and Financial Engineering at Princeton University.
Routing is the process of selecting best paths in a network.
New!!: Linear programming and Routing ·
SageMath (previously Sage or SAGE, System for Algebra and Geometry Experimentation) is mathematical software with features covering many aspects of mathematics, including algebra, combinatorics, numerical mathematics, number theory, and calculus.
New!!: Linear programming and SageMath ·
SAS (Statistical Analysis System) is a software suite developed by SAS Institute for advanced analytics, multivariate analyses, business intelligence, data management, and predictive analytics.
Scheduling is the process of arranging, controlling and optimizing work and workloads in a production process or manufacturing process.
Scilab is an open source, cross-platform numerical computational package and a high-level, numerically oriented programming language.
New!!: Linear programming and Scilab ·
SCIP (Solving Constraint Integer Programs) is a mixed integer programming solver and a framework for Branch and cut and Branch and price, developed at Zuse Institute Berlin.
Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (that is, a function to be maximized or minimized) over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron.
The set cover problem is a classical question in combinatorics, computer science and complexity theory.
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems.
New!!: Linear programming and Set packing ·
The term "Shadow Price" or "Shadow Pricing" is used to refer to monetary values assigned to currently unknowable or difficult to calculate costs.
New!!: Linear programming and Shadow price ·
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming.
In an optimization problem, a slack variable is a variable that is added to an inequality constraint to transform it to an equality.
Smale's problems are a list of eighteen unsolved problems in mathematics that was proposed by Steve Smale in 1998, republished in 1999.
Springer Science+Business Media or Springer is a global publishing company that publishes books, e-books and peer-reviewed journals in science, technical and medical (STM) publishing.
Stephen Smale (born July 15, 1930) is an American mathematician from Flint, Michigan.
New!!: Linear programming and Stephen Smale ·
In the field of mathematical optimization, stochastic programming is a framework for modeling optimization problems that involve uncertainty.
Strong duality is a concept in optimization such that the primal and dual solutions are equivalent.
In mathematics, a submodular set function (also known as a submodular function) is a set function whose value, informally, has the property that the difference in the incremental value of the function, that a single element makes when added to an input set, decreases as the size of the input set increases.
Sysquake is a numerical computing environment based on a programming language mostly-compatible with MATLAB.
New!!: Linear programming and Sysquake ·
The Mathematical Intelligencer is a mathematical journal published by Springer Verlag that aims at a conversational and scholarly tone, rather than the technical and specialist tone more common amongst such journals.
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input.
Tjalling Charles Koopmans (August 28, 1910 – February 26, 1985) was a Dutch American mathematician and economist, the joint winner with Leonid Kantorovich of the 1975 Nobel Memorial Prize in Economic Sciences.
The TOMLAB Optimization Environment is a modeling platform for solving applied optimization problems in MATLAB.
New!!: Linear programming and TOMLAB ·
In mathematical optimization, total dual integrality is a sufficient condition for the integrality of a polyhedron.
In linear algebra, the transpose of a matrix A is another matrix AT (also written A′, Atr, tA or At) created by any one of the following equivalent actions.
New!!: Linear programming and Transpose ·
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
In mathematics, a unimodular matrix M is a square integer matrix having determinant +1 or −1.
A unit cube, more formally a cube of side 1, is a cube whose sides are 1 unit long.
New!!: Linear programming and Unit cube ·
In computer programming, a variable or scalar is a storage location paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.
A vector space (also called a linear space) is a collection of objects called vectors, which may be added together and multiplied ("scaled") by numbers, called scalars in this context.
New!!: Linear programming and Vector space ·
In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.
New!!: Linear programming and Vertex cover ·
VisSim is a visual block diagram language for simulation of dynamical systems and model based design of embedded systems.
New!!: Linear programming and VisSim ·
In applied mathematics, weak duality is a concept in optimization which states that the duality gap is always greater than or equal to 0.
New!!: Linear programming and Weak duality ·
World War II (WWII or WW2), also known as the Second World War, was a global war that lasted from 1939 to 1945, though related conflicts began earlier.
New!!: Linear programming and World War II ·
In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an algorithm requires in the worst-case.
Yinyu Ye (born 1948) is a Chinese American theoretical computer scientist working on mathematical optimization.
New!!: Linear programming and Yinyu Ye ·
.NET Framework (pronounced dot net) is a software framework developed by Microsoft that runs primarily on Microsoft Windows.
0-1 integer program, 0-1 integer programming, 0-1 integer programs, 0-1 linear programming, 0–1 integer program, 1-0 linear programming, Binary integer program, Binary integer programming, Binary integer programs, Integer linear program, Integer linear programs, Integer programs, Integral linear program, Integral polyhedron, Integral polytope, LP problem, Linear Programming, Linear optimisation, Linear optimization, Linear problem, Linear program, Linear programme, Linear programmer, Linear programmers, Linear programming duality, Linear programming problem, Linear programs, Lp solve, Mixed integer linear programming, Mixed integer program, Mixed integer programming, Mixed integer programs.