linear programming

(redirected from Integer program)
Also found in: Thesaurus, Financial, Encyclopedia.
Related to Integer program: Integer number, Integer linear programming

linear programming

n
1. (Economics) maths a technique used in economics, etc, for determining the maximum or minimum of a linear function of non-negative variables subject to constraints expressed as linear equalities or inequalities
2. (Mathematics) maths a technique used in economics, etc, for determining the maximum or minimum of a linear function of non-negative variables subject to constraints expressed as linear equalities or inequalities
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.linear programming - a mathematical technique used in economics; finds the maximum or minimum of linear functions in many variables subject to constraints
applied math, applied mathematics - the branches of mathematics that are involved in the study of the physical or biological or sociological world
References in periodicals archive ?
This model is an integer program where the objective is to maximize the investor's profit.
When some, but not all decision variables are restricted to be integer, this problem called a mixed integer problem and when all decision variables are integers, it's a pure integer program.
The algorithm uses the best objective of the remaining linear programming formulations that do not need to be investigated any further because they do not include any better integer program solution to update the best bound.
As with the regular SDD, this is a mixed integer programming problem that can be rewritten as an integer program.
Recent experience with other NP-hard problems formulated as 0-1 integer programs--principally the TSP--indicate that a careful study of structure of the particular integer program can lead to very effective practical procedures.
Then, the second step transposes this ordered list into a net layout using an integer program formulation.
Stowe (1985) shows that Mehta's procedures can be formulated and solved as an integer program.
This integer program will have nm(np + nm) integer variables and at most (3[n.
We can formulate a bounded 0-1 Knapsack problem as a linear integer program [17].
Based on the objective function and the associated constraints mentioned earlier, the pure integer program takes the mathematical structure shown below.
In general, the integer program generates a plan that has about three-quarters of the same assignments as those made by the expert.