An interior point method, based on rank-1 updates, for linear programming
Author:
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Link
http://link.springer.com/content/pdf/10.1007/BF01584845.pdf
Reference19 articles.
1. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373–395.
2. P.M. Vaidya, An algorithm for linear programming which requires O(((m + n)n 2 + (m + n)1.5n)L) arithmetic operations, Proceedings of the 19th ACM Symposium on the Theory of Computing, 1987, pp. 29–38.
3. C.C. Gonzaga, An algorithm for solving linear programming problems in O(n 3L) operations, in: N. Megiddo (Ed.), Progress in Mathematical Programming, Springer, Berlin, 1989, pp. 1–28.
4. M. Kojima, S. Mizuno, A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems, Mathematical Programming 44 (1989) 1–26.
5. R.D.C. Monteiro, I. Adler, Interior path following primal—dual algorithms, Part II: convex quadratic programming, Mathematical Programming 44 (1989) 43–66.
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interior Point Methods for Nonlinear Optimization;Lecture Notes in Mathematics;2010
2. Hierarchical production planning with demand constraints;Computers & Industrial Engineering;2004-06
3. Practical solution approaches to solve a hierarchical stochastic production planning problem in a flexible automated workshop in China;IIE Transactions;2003-02
4. Karmarkar’s and interaction/prediction algorithms for hierarchical production planning for the highest business benefit;Computers in Industry;2002-10
5. Hierarchical Production Planning in Flexible Automated Workshops with Delay Interaction;The International Journal of Advanced Manufacturing Technology;2002-03-15
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3