dual linear programming

dual linear programming

[′dü·əl ¦lin·ē·ər ′prō‚gram·iŋ]
(mathematics)
Linear programming in which the maximum and minimum number are the same number.
Mentioned in ?
References in periodicals archive ?
The primal-dual path following algorithm is an example of an IPM that operates simultaneously on the primal and dual linear programming problems.