تعريف linear programming في الإنجليزية الإنجليزية القاموس.
the branch of mathematics concerned with the minimization or maximization of a linear function of several variables and inequalities; used in many branches of industry to minimize costs or maximize production
Technique for determining the optimum outcome from situations represented by linear equations and constraints Linear relationships give a straight line graph, while nonlinear relationships give a curve
Finding the largest or smallest value taken on by a given function (the objective function) given that satisfy certain linear constraints The constraints are inequalities of the form Many applied problems, such as designing the cheapest animal feed that meets given nutritional goals, can be formulated as linear programming problems
The problem, and associated area of mathematics, of maximizing or minimizing a linear function on a convex set, especially a polytope Equivalently, maximizing a linear expression in some number of variables subject to linear equalities and inequalities
a mathematical technique used in economics; finds the maximum or minimum of linear functions in many variables subject to constraints
A mathematical procedure for minimizing or maximizing a linear function of several variables, subject to a finite number of linear restrictions on these variables
In operations research, a procedure for locating the maximum or minimum of a linear function of variables that are subject to linear constraints Synonym linear optimization
Mathematical modeling technique useful for guiding quantitative decisions in business, industrial engineering, and to a lesser extent the social and physical sciences. Solving a linear programming problem can be reduced to finding the optimum value (see optimization) of a linear equation (called an objective function), subject to a set of constraints expressed as inequalities. The number of inequalities and variables depends on the complexity of the problem, whose solution is found by solving the system of inequalities like a system of equations. The extensive use of linear programming during World War II to deal with transportation, scheduling and allocations of resources under constraints like cost and priority gave the subject an impetus that carried it into the postwar era. The number of equations and variables needed to model real-life situations accurately is large, and the solution process can be time-consuming even with computers. See also simplex method
shows how best to allocate multiple scarce resources among alternative courses of action in the short run when capacity cannot be increased
A technique for finding the best of all possible solutions of a system of linear equalities and inequalities The criterion for the best solution is the maximum or minimum value of a given linear function of bounded variables, called the objective function
Technique for finding the maximum value of some equation subject to stated linear constraints
A technique of operations research (not necessarily computer programming) when an optimum value or ration of values is to be found in a situation involving many variables and for which there is no unique solution