Now showing items 1-6 of 6
A genuinely polynomial primal simplex algorithm for the assignment problem
We present a primal simplex algorithm that solves the assignment problem in 1 2n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,...,n. The algorithm utilizes degeneracy by ...
A characterization of the optimal set of linear programs based on the augmented lagrangian
(Taylor & Francis, 1999)
It is proved that in a certain neighborhood of the optimal set of multipliers, the set of minimizers of the augmented lagrangian nmction generates a new characterization of the optimal solution set of the linear program.
A new finite continuation algorithm for linear programming
(Society for Industrial and Applied Mathematics, 1996)
We describe a new finite continuation algorithm for linear programming. The dual of the linear programming problem with unit lower and upper bounds is formulated as an f\ minimization problem augmented with the addition ...
Concurrent consideration of product design, process planning and production planning activities
In manufacturing engineering, product design, process planning and production planning activities are often considered independently. However, in order to effectively respond to changes in business situations, such as ...
Piecewise-linear pathways to the optimal solution set in linear programming
(Kluwer Academic Publishers - Plenum Publishers, 1997)
This paper takes a fresh look at the application of quadratic penalty functions to linear programming. Recently, Madsen et al. (Ref. 1) described a continuation algorithm for linear programming based on smoothing a dual ...
Linear programming via a quadratic penalty function
(Physica - Verlag, 1996)
We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive at a new characterization of primal optimal solutions in linear programs. The algorithmic implications of this analysis ...