linear programming

(redirected from LP problem)
Also found in: Thesaurus, Financial, Encyclopedia.
Related to LP problem: 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 ?
Verdegay (1982) showed that an LP problem with the crisp target and some fuzzy constraints is equal to a common parametric LP model and thus, we are able to use parametric approaches to solve these FLP problems.
In order to solve the optimization problem in (5), we formulate the problem as a LP problem as follows.
The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which are designed to retain original lengths of mesh edges.
[26] studied the formulated LP problem by considering the corresponding continuous-time approximation model and gave an elegant approximate solution in continuous-time forms.
in which h is a small positive number and [z.sup.*.sub.jo] is the optimal solution to the following LP problem:
The main idea of combining Linear Programming (LP) models to fuzzy sets is to include the opinion of multiple experts who define the left hand side parameters on an LP problem, namely [a.sub.ij].
We try to illustrate important features of these tools in LP problem solving.
We then formulate the joint link scheduling and routing algorithm and convert it into an LP problem which can be easily solved.
Proposition 8 is an LP problem, which can be numerically solved by the LP optimal toolbox.
For example, it is proposed to transform a multiobjective linear programming problem (LP problem) to the system of linear inequalities.
Buckley and Feuring [9] proposed amethod to find the solution for a fully fuzzified linear programming problem by changing the objective function into a multiobjective LP problem. Allahviranloo et al proposed a method based on ranking function for solving FFLP problems.
Here, we are going to present an LP problem, corresponding to the optimization problem (6), for approximating the optimal solution of problem (6), i.e., the GD.