Mixed Integer Linear Fractional Programming (MILFPP) presents a challenging optimization paradigm where some decision variables are constrained to integer values while others may assume fractional or continuous values. In this paper, we propose an algorithmic framework for solving MILFP problems by iteratively introducing Gomorian mixed integer constraints to achieve mixed integer optimum basic feasible solutions (MIOBFS). Through a detailed investigation, we demonstrate the effectiveness of our approach in obtaining optimal solutions for complex MILFP instances. Our findings contribute to the advancement of optimization methodologies tailored to address mixed integer programming challenges in real-world applications.

___________________________________________________________________________________

Keywords: Mixed Integer Linear Fractional Programming, Optimization, Gomorian Mixed Integer Constraints, Algorithm, Integer Programming.