A Generalization of Iteration-free Search Vectors of Abs Methods

Volume 12, Issue 3, pp 196-200 http://dx.doi.org/10.22436/jmcs.012.03.03

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2280 Downloads
• 3681 Views

Authors

Mostafa Khorramizadeh - Department of Mathematical Sciences Shiraz University of Technology Shiraz 71555-313, Iran.

Abstract

Recently, we introduced iteration-free search vectors of the ABS methods and showed how they can be used to compute the search directions of primal--dual interior point methods, when the coefficient matrix of the constraints of the linear programming problem is square. Here, we generalize those results for the general case when, the coefficient matrix is non-square.

Share and Cite

Keywords

• Interior point methods
• Infeasible interior pointmethods
• Primal--dual algorithms
• ABS algorithms
• Searchdirection.

MSC

•  90C51
•  90C05
•  65F30

References

• [1] J. Abaffy, C. G. Broyden, E. Spedicato , A class of direct methods for linear equations, Numerische Mathematik, 45 (1984), 361-376.


• [2] J. Abaffy, C. G. Broyden, E. Spedicato, Projection Algorithms: Mathematical Techniques for Linear and Nonlinear Equations , Ellis Horwood, Chichester (1989)
  • Google Scholar


• [3] K. Kojima, N. Megiddo, S. Mizuno, A primal-dual infeasible interior point algorithm for linear programming, Mathematical Programming, 61 (1993), 263-280.
  • View Article
  • Google Scholar


• [4] M. Khorramizadeh, On solving Newton systems of Primal-Dual Infeasible Interior Point methods using ABS methods, Applied Mathematical Sciences, 6(106) (2012), 5263-5272.
  • Google Scholar
  • MATH


• [5] S. H. Nasseri, Z. Alizadeh, Solving Linear Programming Problem with Fuzzy Right Hand Sides A Penalty Method, The Journal of Mathematics and Computer Science, 3 (2011), 318-328.
  • Google Scholar


• [6] S. H. Nasseri, F. Zahmatkesh, Huang method for solving fully fuzzy linear system of equations, , 1 (2005), 1-5.
  • Google Scholar


• [7] M. Pattnaik , Fuzzy Muli-Objective Linear Programming Problems Sensivity Analysis, The Journal of Mathematics and Computer Science, 7 (2013), 131-137.


• [8] S. J. Wright, An infeasible interior point algorithm for linear complementary problems, Mathematical Programming, 62 (1996), 103-130.


• [9] S. J. Wright , Primal--Dual Interior--Point Methods, SIAM, Philadelphia (1997)
  • Google Scholar