# Dual–primal algorithm for linear optimization

@article{Li2013DualprimalAF, title={Dual–primal algorithm for linear optimization}, author={Wei Li}, journal={Optimization Methods and Software}, year={2013}, volume={28}, pages={327 - 338} }

The purpose of this paper is to present a new approach for solving linear programming, which has some interesting theoretical properties. In each step of the iteration, we trace a direction completely different from primal simplex method, dual simplex method, primal–dual method and interior point method. The new method is impervious to primal degeneracy and can reach a pair of exact primal and dual optimal solutions without purifying process. Numerical results are presented that support our…

## 4 Citations

### An interesting characteristic of phase-1 of dual–primal algorithm for linear programming

- Computer ScienceOptim. Methods Softw.
- 2014

It is found that the phase-1 algorithm developed in [Li (2013] always terminates in one iteration, and this fact does not come by chance.

### A new non-monotonic infeasible simplex-type algorithm for Linear Programming

- Computer SciencePeerJ Comput. Sci.
- 2020

This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual…

### Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis

- Computer ScienceAppl. Math. Comput.
- 2015

### Algorithm for Linear Programming

- Computer Science, Mathematics
- 2012

In this paper, the “An Algorithm for Linear Programming” is described, which aims to provide an algorithm for linear programming with real-time requirements.

## References

SHOWING 1-10 OF 41 REFERENCES

### A least-squares primal-dual algorithm for solving linear programming problems

- MathematicsOper. Res. Lett.
- 2002

### A convergent criss-cross method

- Mathematics
- 1985

Our paper presents a new Criss-Cross method for solving linear programming problems. Starting from a neither primal nor dual feasible solution, we reach an optimal solution in finite number of steps…

### Theory and algorithms for linear optimization - an interior point approach

- MathematicsWiley-Interscience series in discrete mathematics and optimization
- 1998

This chapter discusses duality Theory for Linear Optimization, a Polynomial Algorithm for the Skew-Symmetric Model, and Parametric and Sensitivity Analysis, as well as implementing Interior Point Methods.

### Combined projected gradient algorithm for linear programming

- Computer ScienceOptim. Methods Softw.
- 2006

A new general-purpose solution algorithm, called combined projected gradient algorithm with the proof that it converges successfully, is derived, which not only reduces the possibility of difficulty arising from degeneracy, but also reaches a pair of exact primal and dual optimal solutions.

### A reduced Newton method for constrained linear least-squares problems

- Mathematics, Computer ScienceJ. Comput. Appl. Math.
- 2010

### A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule

- Computer ScienceComput. Math. Appl.
- 2006

### Some new properties of the equality constrained and weighted least squares problem

- Mathematics, Computer Science
- 2000