“linear programming”的概念、定义、翻译、参考文献-科学参考

linear programming

Mathematics

The branch of mathematics concerned with maximizing or minimizing a linear function subject to a number of linear constraints. It has applications in economics, industry, and commerce, for example. In its simplest form, with two variables, the constraints determine a feasible region, which is the interior of a polygon in the plane. The objective function to be maximized or minimized attains its maximum or minimum value at a vertex of the feasible region. For example, consider the problem of maximizing 4x₁−3x₂ subject to

$x_{1} - 2 x_{2} \geq - 4, 2 x_{1} + 3 x_{2} \leq 13, x_{1} - x_{2} \leq 4, x_{1} = 0, x_{2} \geq 0 .$

The feasible region is the interior of the polygon OABCD shown in the figure, and the objective function 4x₁−3x₂ attains its maximum value of 17 at the point B with coordinates (5, 1).

The feasible region

Often integer values are required, and in such cases the vertex is not always admissible and it will be necessary to test all points with integer values which lie close to the vertex. It is also possible that the objective function may be parallel to a constraining condition. In this case, all points on the boundary representing that constraint will be optimal.

Statistics

A method for determining the optimal use of limited resources. The phrase ‘linear programming’ was used by Dantzig in 1949. A typical problem requires the maximization (or minimization) of a linear combination of the non-negative variables x₁, x₂,…, x_n: $linear programming$ where the coefficients c₁, c₂,…, c_n have known values. The function is known as the objective function. The maximization is subject to a set of linear constraints such as $linear programming$ where the coefficients {a_ij} have known values.
In order to solve the problem, inequalities are turned into equalities by introducing non-negative slack variables so that, for example, the first inequality would become $linear programming$
Any solution satisfying all the constraints (with the addition of slack variables as required) is called a feasible solution. A feasible solution involving exactly m non-zero x-variables (including any slack variables) is called a basic feasible solution.
One standard approach to the general problem is to use the simplex method (introduced by Dantzig in 1947). Special algorithms are required for integer programming (where the x-values are required to be integers) and for assignment problems, network flow problems, and transportation problems.
Linear programming. The solution must lie at one of the inner vertices marked with dots: these are the basic feasible solutions. The values of x+y at the other three vertices are 0, 7.5, and 8.

Chemical Engineering

A mathematical technique used to provide an optimal solution to a set of linear equations. The technique uses a model of a process, which consists of a set of equations and also an objective function. The objective function may typically represent the economics of the process. The set of linear equations are known as constraint equations and define a region of feasibility that has an infinite number of solutions. The objective function is used to evaluate the optimal solution from these. Linear programming is widely used for process optimization, product supply and distribution, project management, and general resource allocation.

Computer

A technique in optimization, pioneered by George B. Dantzig, that is widely used in economic, military, and business-management decisions. It deals with the problem of finding nonnegative values of the variables x₁, x₂,…, x_n that satisfy the constraints
$\begin{array}{l} a_{i 1} x_{1} + a_{i 2} x_{2} + \dots + a_{i n} x_{n} = b_{i}, \\ i = 1, 2, \dots, m \end{array}$
and minimize the linear form
$c_{1} x_{1} + c_{2} x_{2} + \dots + c_{n} x_{n}$
Maximizing problems and problems with inequality constraints or unrestricted variables can be converted to this form. An optimum solution (if any exist) is known to be a basic feasible solution, which is one that satisfies the constraints and has at most m positive x_i values.
Computationally such problems are solved by the simplex method, an algorithm that terminates after a finite number of steps. It starts at a basic feasible solution and moves through the set of such solutions in such a manner that the value of the linear form is nonincreasing. Very large problems occur in practice involving sparse matrices. Iterative infinite algorithms are sometimes faster, notably Kamarkar’s method.

Economics

A mathematical procedure for finding the maximum or minimum value of a linear objective function subject to linear constraints.

单词	linear programming
释义	linear programming Mathematics The branch of mathematics concerned with maximizing or minimizing a linear function subject to a number of linear constraints. It has applications in economics, industry, and commerce, for example. In its simplest form, with two variables, the constraints determine a feasible region, which is the interior of a polygon in the plane. The objective function to be maximized or minimized attains its maximum or minimum value at a vertex of the feasible region. For example, consider the problem of maximizing 4x₁−3x₂ subject to $x_{1} - 2 x_{2} \geq - 4, 2 x_{1} + 3 x_{2} \leq 13, x_{1} - x_{2} \leq 4, x_{1} = 0, x_{2} \geq 0 .$ The feasible region is the interior of the polygon OABCD shown in the figure, and the objective function 4x₁−3x₂ attains its maximum value of 17 at the point B with coordinates (5, 1). The feasible region Often integer values are required, and in such cases the vertex is not always admissible and it will be necessary to test all points with integer values which lie close to the vertex. It is also possible that the objective function may be parallel to a constraining condition. In this case, all points on the boundary representing that constraint will be optimal. Statistics A method for determining the optimal use of limited resources. The phrase ‘linear programming’ was used by Dantzig in 1949. A typical problem requires the maximization (or minimization) of a linear combination of the non-negative variables x₁, x₂,…, x_n: $linear programming$ where the coefficients c₁, c₂,…, c_n have known values. The function is known as the objective function. The maximization is subject to a set of linear constraints such as $linear programming$ where the coefficients {a_ij} have known values. In order to solve the problem, inequalities are turned into equalities by introducing non-negative slack variables so that, for example, the first inequality would become $linear programming$ Any solution satisfying all the constraints (with the addition of slack variables as required) is called a feasible solution. A feasible solution involving exactly m non-zero x-variables (including any slack variables) is called a basic feasible solution. One standard approach to the general problem is to use the simplex method (introduced by Dantzig in 1947). Special algorithms are required for integer programming (where the x-values are required to be integers) and for assignment problems, network flow problems, and transportation problems. Linear programming. The solution must lie at one of the inner vertices marked with dots: these are the basic feasible solutions. The values of x+y at the other three vertices are 0, 7.5, and 8. Chemical Engineering A mathematical technique used to provide an optimal solution to a set of linear equations. The technique uses a model of a process, which consists of a set of equations and also an objective function. The objective function may typically represent the economics of the process. The set of linear equations are known as constraint equations and define a region of feasibility that has an infinite number of solutions. The objective function is used to evaluate the optimal solution from these. Linear programming is widely used for process optimization, product supply and distribution, project management, and general resource allocation. Computer A technique in optimization, pioneered by George B. Dantzig, that is widely used in economic, military, and business-management decisions. It deals with the problem of finding nonnegative values of the variables x₁, x₂,…, x_n that satisfy the constraints $\begin{array}{l} a_{i 1} x_{1} + a_{i 2} x_{2} + \dots + a_{i n} x_{n} = b_{i}, \\ i = 1, 2, \dots, m \end{array}$ and minimize the linear form $c_{1} x_{1} + c_{2} x_{2} + \dots + c_{n} x_{n}$ Maximizing problems and problems with inequality constraints or unrestricted variables can be converted to this form. An optimum solution (if any exist) is known to be a basic feasible solution, which is one that satisfies the constraints and has at most m positive x_i values. Computationally such problems are solved by the simplex method, an algorithm that terminates after a finite number of steps. It starts at a basic feasible solution and moves through the set of such solutions in such a manner that the value of the linear form is nonincreasing. Very large problems occur in practice involving sparse matrices. Iterative infinite algorithms are sometimes faster, notably Kamarkar’s method. Economics A mathematical procedure for finding the maximum or minimum value of a linear objective function subject to linear constraints.
随便看	OLE oleaginous oleate olecranon process OLED olefines olefins oleic acid Olenekian Olenelloidea oleosome oleum olfaction olfactory lobe oligimer oligo- Oligocene Oligochaeta oligoclase oligodendrocyte oligohaline water oligomictic oligonucleotide oligopeptide oligopoly