Algebraic simplex initialization combined with the nonfeasible basis method-Reference-Cited by-同舟云学术

Algebraic simplex initialization combined with the nonfeasible basis method

Published:2015-09 Issue:2 Volume:245 Page:384-391
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Nabli Hédi,Chahdoura Sonia^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference17 articles.

1. Linear programming;Chvatal,1983

2. The s-monotone index selection rules for pivot algorithms of linear programming;Csizmadia;European Journal of Operational Research,2012

3. Maximization of a linear function of variables subject to linear inequalities;Dantzig,1951

4. Linear programming and extensions;Dantzig,1963

5. Linear programming 1: Introduction;Dantzig,1997

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Short Literature on Linear Programming Problem;EAI Endorsed Transactions on Energy Web;2023-11-30

2. MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and Bound;Journal of the Operations Research Society of China;2023-07-03

3. Experiences of mixed method OR Practitioners: moving beyond a technical focus to insights relating to modelling teams;Journal of the Operational Research Society;2021-09-02

4. Solving an Integer Program by Using the Nonfeasible Basis Method Combined with the Cutting Plane Method;Advances in Intelligent Systems and Computing;2021

5. A New Initial Basis for Solving the Blending Problem Without Using Artificial Variables;Advances in Intelligent Systems and Computing;2021