Dual–primal algorithm for linear optimization

  title={Dual–primal algorithm for linear optimization},
  author={Wei Li},
  journal={Optimization Methods and Software},
  pages={327 - 338}
  • Wei Li
  • Published 1 April 2013
  • Mathematics
  • Optimization Methods and Software
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… 

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

  • Haohao Li
  • Computer Science
    Optim. 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

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

Algorithm for Linear Programming

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



A convergent criss-cross method

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

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

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 dual projective simplex method for linear programming

Feasible region contraction interior point algorithm

Pivot versus interior point methods: Pros and cons

A reduced Newton method for constrained linear least-squares problems