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 …

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) …

Interior point methods and simplex-type algorithms are the most widely-used algorithms for
solving linear programming problems. The simplex algorithm has many important …

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 …

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 …

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 …

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 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 …

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 …

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 …