A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING

@inproceedings{Tamura1988ADI,
  title={A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING},
  author={Akihisa Tamura and Hitoshi Takehara and Komei Fukuda and Satoru Fujishige and Masakazu Kojima},
  year={1988}
}
This paper proposes a hybrid computational method (DIPS method) which works as a simplex method for solving a standard form linear program, and, simultaneously, as an interior point method for solving its dual. The DIPS method generates a sequence of primal basic feasible solutions and a sequence of dual interior feasible solutions interdependently. Along the sequences, the duality gap decreases monotonically. As a simplex method, it gives a special column selection rule satisfying an… CONTINUE READING

Figures from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

The steepest descent gravitational method for linear programming

  • Discrete Applied Mathematics
  • 1989
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables

M. J. Todd, Burrell, B. P. 1986
  • Algorithmica, 1, 409-424.
  • 1986
VIEW 2 EXCERPTS

A New Polynomial-time Algorithm for Linear Programming

Karmarkar, N. 1984
  • Combinatorica, 4, 373-395.
  • 1984
VIEW 1 EXCERPT