integer+solution

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

• 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

• Transposable integer — A summary of this article appears in Repeating decimal. The digits of some specific integers permute or shift cyclically when they are multiplied by a number n. Examples are: 142857 × 3 = 428571 (shifts cyclically one place left) 142857 × 5 =… …   Wikipedia

• Frobenius solution to the hypergeometric equation — In the following we solve the second order differential equation called the hypergeometric differential equation using Frobenius method, named after Ferdinand Georg Frobenius. This is a method that uses the series solution for a differential… …   Wikipedia

• algebraic integer — noun A number (real or complex) which is a solution to an equation of the form for some set of integers through . See Also: quadratic integer …   Wiktionary

• quadratic integer — noun A number (real or complex) which is a solution to an equation of the form for some integers B and C. For example 42, or 2+3i, or . See Also: algebraic integer …   Wiktionary

• Zero-One Integer Programming — An analytical method consisting of what amounts to a series of yes (1) and no (0) answers to arrive at a solution. In the world of finance, such programming is often used to provide answers to capital rationing problems, as well as to optimize… …   Investment dictionary

• Zero-one integer programming — An analytical method that can be used to determine the solution to a capital rationing problem. The New York Times Financial Glossary …   Financial and business terms

• zero-one integer programming — An analytical method that can be used to determine the solution to a capital rationing problem. Bloomberg Financial Dictionary …   Financial and business terms

• 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

• Cutting-plane method — 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. Such procedures are popularly used to… …   Wikipedia