This study aims to address the difficulties in solving coupled generalized non-linear Burger equations using local fractional calculus as a framework. The methodology used in this work, particularly ...

Abstract: This article presents the study of linear fractional programming (LFP) problems under intuitionistic fuzzy setting. The objective of this paper is to solve ...

This is two cpp program that one of them for solving Linear Programing(LP) problem with simplex method print step by step simplex tables. it also supports both Big M method and Two-Phase method for ...

Solve linear optimization problems including minimization and maximization with simplex algorithm. Uses the Big M method to solve problems with larger equal constraints in Python ...

The boundary value problems (BVPs) have attracted the attention of many scientists from both practical and theoretical points of view, for these problems have remarkable applications in different ...

ABSTRACT: Most of the current methods for solving linear fractional programming (LFP) problems depend on the simplex type method. In this paper, we present a new approach for solving linear fractional ...

ABSTRACT: Most of the current methods for solving linear fractional programming (LFP) problems depend on the simplex type method. In this paper, we present a new approach for solving linear fractional ...

Abstract: A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level ...