integer+linear+programming

См. также в других словарях:

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Linear programming relaxation — 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 [0,1] .That is,… …   Wikipedia

• Linear programming — Dieser Artikel oder Abschnitt ist nicht hinreichend mit Belegen (Literatur, Webseiten oder Einzelnachweisen) versehen. Die fraglichen Angaben werden daher möglicherweise demnächst gelöscht. Hilf Wikipedia, indem du die Angaben recherchierst und… …   Deutsch Wikipedia

• GNU Linear Programming Kit — Original author(s) Andrew O. Makhorin Developer(s) GNU Project Stable release 4.47 / September 9, 2011; 51 days ago ( …   Wikipedia

• Hilbert basis (linear programming) — In linear programming, a Hilbert basis for a convex cone is a minimal set of integer vectors such that every integer vector in the convex cone is a linear combination of the vectors in the Hilbert basis with non negative integer coefficients.More …   Wikipedia

• Integer programming — Variant of linear programming whereby the solution values must be integers. The New York Times Financial Glossary …   Financial and business terms

• integer programming — Variant of linear programming in which the solution values must be integers. Bloomberg Financial Dictionary …   Financial and business terms

• Linear congruential generator — A linear congruential generator (LCG) represent one of the oldest and best known pseudorandom number generator algorithms. [ [http://demonstrations.wolfram.com/LinearCongruentialGenerators/ Linear Congruential Generators] by Joe Bolte, The… …   Wikipedia

• Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… …   Wikipedia

• Goal programming — is a branch of multiobjective optimization, which in turn is a branch of multi criteria decision analysis (MCDA), also known as multiple criteria decision making (MCDM). It can be thought of as an extension or generalisation of linear programming …   Wikipedia

• Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving 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,… …   Wikipedia