Reinforcement learning of simplex pivot rules: a proof of concept
V Suriyanarayana, O Tavaslıoğlu, AB Patel… - Optimization …, 2022 - Springer
At each iteration of the simplex method there are typically many possible entering columns.
We use deep value-based reinforcement learning to choose dynamically between two …
We use deep value-based reinforcement learning to choose dynamically between two …
A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Y Yang - Research in the Mathematical Sciences, 2020 - Springer
In this paper, a double-pivot simplex method is proposed. Two upper bounds of iteration
numbers are derived. Applying one of the bounds to some special linear programming (LP) …
numbers are derived. Applying one of the bounds to some special linear programming (LP) …
Improving a primal–dual simplex-type algorithm using interior point methods
Interior point methods and simplex-type algorithms are the most widely-used algorithms for
solving linear programming problems. The simplex algorithm has many important …
solving linear programming problems. The simplex algorithm has many important …
A control rule for planning promotion in a Nigerian university setting
VU Ekhosuehi - Croatian Operational Research Review, 2016 - hrcak.srce.hr
Sažetak This paper examines the attainability problem in a graded manpower system,
where the objective is to maximise the total throughput. The problem is modelled as a linear …
where the objective is to maximise the total throughput. The problem is modelled as a linear …
[PDF][PDF] A modified row pivot simplex algorithm
YG Yang - arXiv preprint arXiv:2107.08468, 2021 - researchgate.net
In this paper, a modified row pivot simplex method is discussed. The row pivot simplex
method considers general linear programming (LP) problem that includes linear equality …
method considers general linear programming (LP) problem that includes linear equality …
Multiplicity of approach and method in augmentation of simplex method: A review
The purpose of this review paper is to set an augmentation approach and exemplify
distribution of augmentation works in Simplex method. The augmentation approach is …
distribution of augmentation works in Simplex method. The augmentation approach is …
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
M Tano, R Miyashiro, T Kitahara - Operations Research Letters, 2019 - Elsevier
In this paper, we consider the number of simplex iterations with the steepest-edge rule for
the simplex method. For a nondegenerate linear programming problem, we show two upper …
the simplex method. For a nondegenerate linear programming problem, we show two upper …
On the facet pivot simplex method for linear programming I: algorithms and numerical test
Y Yang - arXiv preprint arXiv:2107.08468, 2021 - arxiv.org
The Hirsch Conjecture stated that any d-dimensional polytope with n facets has a diameter
at most equal to nd. This conjecture was disproven by Santos (A counterexample to the …
at most equal to nd. This conjecture was disproven by Santos (A counterexample to the …
An integer programming model for timetabling at the University of Groningen
R Schininà - 2024 - fse.studenttheses.ub.rug.nl
University Course Timetabling is a big challenge that many universities must go through
before the start of each academic year. This is a very complex administrative task that …
before the start of each academic year. This is a very complex administrative task that …
[PDF][PDF] A double-pivot degenerate-tolerable simplex algorithm for linear programming
A double pivot algorithm that combines features of two recently published papers by these
authors is proposed. The proposed algorithm is implemented in MATLAB. The MATLAB …
authors is proposed. The proposed algorithm is implemented in MATLAB. The MATLAB …