A Parametric Hybrid-Direction Algorithm for Bounded-Variable Linear Programming

Authors

  • Khalil DJELOUD Department of Mathematics-Higher Normal School of Laghouat, Algeria

DOI:

https://doi.org/10.19139/soic-2310-5070-3554

Keywords:

Linear programming, Adapted method, Feasible solution, Hybrid direction, Optimality estimation, long step rule

Abstract

This paper proposes a parametric hybrid-direction algorithm for bounded-variable linear programming. The method is based on an odd integer parameter ν, which defines a family of search directions within a unified framework. Inparticular, when ν= -1, the proposed approach reduces to a special case corresponding to previously studied hybrid-direction methods [1, 2, 5, 7], whose effectiveness has been demonstrated in connection with the simplex algorithm of the open-source solver GLPK [15]. Computational experiments on randomly generated problems show that the algorithm is efficient and robust, with stable performance in terms of iteration counts and CPU time. Among the tested values ν=1 provides thebest overall results, offering a good compromise between convergence speed and computational cost.

Downloads

Published

2026-07-17

How to Cite

DJELOUD, K. (2026). A Parametric Hybrid-Direction Algorithm for Bounded-Variable Linear Programming. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-3554

Issue

Section

Research Articles