The Big-M method with the numerical infinite M

Linear programming is a very well known and deeply applied field of optimization theory. One of its most famous and used algorithms is the so called Simplex algorithm, independently proposed by Kantorovic and Dantzig, between the end of the 30s and the end of the 40s. Even if extremely powerful, the Simplex algorithm suffers of one initialization issue: its starting point must be a feasible basic solution of the problem to solve. To overcome it, two approaches may be used: the two-phases method and the Big-M method, both presenting positive and negative aspects. In this work we aim to propose a non-Archimedean and non-parametric variant of the Big-M method, able to overcome the drawbacks of its classical counterpart (mainly, the difficulty in setting the right value for the constant M). We realized such extension by means of the novel computational methodology proposed by Sergeyev, known as Grossone Methodology. We have validated the new algorithm by testing it on three linear programming problems.

[1]  Tibor Illés,et al.  Pivot versus interior point methods: Pros and cons , 2002, Eur. J. Oper. Res..

[2]  Yaroslav D. Sergeyev,et al.  Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems , 2017 .

[3]  Marco Cococcioni,et al.  Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm , 2018, Appl. Math. Comput..

[4]  Yaroslav D. Sergeyev,et al.  Solving ordinary differential equations by working with infinitesimals numerically on the Infinity Computer , 2013 .

[5]  George B. Dantzig,et al.  Linear Programming 1: Introduction , 1997 .

[6]  Renato De Leone,et al.  Nonlinear programming and Grossone: Quadratic Programing and the role of Constraint Qualifications , 2018, Appl. Math. Comput..

[7]  Yaroslav D. Sergeyev,et al.  Independence of the Grossone-Based Infinity Methodology from Non-standard Analysis and Comments upon Logical Fallacies in Some Texts Asserting the Opposite , 2018, Foundations of Science.

[8]  Yaroslav D. Sergeyev,et al.  On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales , 2018, Commun. Nonlinear Sci. Numer. Simul..

[9]  Yaroslav D. Sergeyev,et al.  Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically , 2013, Appl. Math. Comput..

[10]  Yaroslav D. Sergeyev,et al.  Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology , 2020, Commun. Nonlinear Sci. Numer. Simul..

[11]  T Talaky,et al.  Interior Point Methods of Mathematical Programming , 1997 .

[12]  Marco Cococcioni,et al.  Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems , 2019, NUMTA.

[13]  Yaroslav D. Sergeyev,et al.  A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic , 2017, Math. Comput. Simul..

[14]  Majid Soleimani-Damaneh,et al.  Modified big-M method to recognize the infeasibility of linear programming models , 2008, Knowl. Based Syst..

[15]  Yaroslav D. Sergeyev,et al.  Numerical Methods for Solving Initial Value Problems on the Infinity Computer , 2016, Int. J. Unconv. Comput..

[16]  Renato De Leone,et al.  The use of grossone in Mathematical Programming and Operations Research , 2011, Appl. Math. Comput..

[17]  Marco Cococcioni,et al.  Non-Archimedean game theory: A numerical approach , 2020, Appl. Math. Comput..

[18]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[19]  Alberto Falcone,et al.  A Simulink-Based Infinity Computer Simulator and Some Applications , 2019, NUMTA.

[20]  Marco Cococcioni,et al.  Numerical Asymptotic Results in Game Theory Using Sergeyev's Infinity Computing , 2018, Int. J. Unconv. Comput..

[21]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[22]  Marco Cococcioni,et al.  Solving mixed Pareto-Lexicographic multi-objective optimization problems: The case of priority chains , 2020, Swarm Evol. Comput..

[23]  Fabio Caldarola,et al.  A new approach to the Z-transform through infinite computation , 2020, Commun. Nonlinear Sci. Numer. Simul..

[24]  M. S. Mukhametzhanov,et al.  Conjugate-symplecticity properties of Euler–Maclaurin methods and their implementation on the Infinity Computer , 2018 .