A rank one updating interior algorithm for linear programming
Author
Source
The Arabian Journal for Science and Engineering
Issue
Vol. 15, Issue 4B (s) (31 Dec. 1990), pp.671-677, 7 p.
Publisher
King Fahd University of Petroleum and Minerals
Publication Date
1990-12-31
Country of Publication
Saudi Arabia
No. of Pages
7
Main Subjects
Engineering & Technology Sciences (Multidisciplinary)
Mathematics
Topics
Abstract EN
In this paper we propose an interior point algorithm for linear programming which requires 0(n3L) arithmetic operations.
Since Karmarkar presented a new polynomial time algorithm for linear programming, many interior point algorithms have been developed.
Karmarkar’s algorithm requires at most O(nL) iterations and 0(n15) arithmetic operations on average in each iteration.
The algorithm proposed in this paper requires 0(nL) iterations like Karmarkar’s algorithm, but it only requires 0(n2) arithmetic operations in each iteration.
As for the revised simplex algorithm, we store an inverse matrix in the algorithm and update it by at most rank one at each iteration.
American Psychological Association (APA)
Mizuno, Shinji. 1990. A rank one updating interior algorithm for linear programming. The Arabian Journal for Science and Engineering،Vol. 15, no. 4B (s), pp.671-677.
https://search.emarefa.net/detail/BIM-395264
Modern Language Association (MLA)
Mizuno, Shinji. A rank one updating interior algorithm for linear programming. The Arabian Journal for Science and Engineering Vol. 15, no. 4B (s) (Dec. 1990), pp.671-677.
https://search.emarefa.net/detail/BIM-395264
American Medical Association (AMA)
Mizuno, Shinji. A rank one updating interior algorithm for linear programming. The Arabian Journal for Science and Engineering. 1990. Vol. 15, no. 4B (s), pp.671-677.
https://search.emarefa.net/detail/BIM-395264
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 676-677
Record ID
BIM-395264