In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional...In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional programming technique. In the objective function of an LFP, if βis negative, the available methods are failed to solve, while our proposed method is capable of solving such problems. In the present paper, we propose a new method and develop FORTRAN programs to solve the problem. The optimal LFP solution procedure is illustrated with numerical examples and also by a computer program. We also compare our method with other available methods for solving LFP problems. Our proposed method of linear fractional programming (LFP) problem is very simple and easy to understand and apply.展开更多
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 problem by its dual gap equ...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 problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.展开更多
This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear frac-tional programming problem with interval coefficients in the objective function. It is proved that we c...This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear frac-tional programming problem with interval coefficients in the objective function. It is proved that we can convert an IVLFP to an optimization problem with interval valued objective function which its bounds are linear fractional functions. Also there is a discussion for the solutions of this kind of optimization problem.展开更多
In this paper, a modified method to find the efficient solutions of multi-objective linear fractional programming (MOLFP) problems is presented. While some of the previously proposed methods provide only one efficient...In this paper, a modified method to find the efficient solutions of multi-objective linear fractional programming (MOLFP) problems is presented. While some of the previously proposed methods provide only one efficient solution to the MOLFP problem, this modified method provides multiple efficient solutions to the problem. As a result, it provides the decision makers flexibility to choose a better option from alternatives according to their financial position and their level of satisfaction of objectives. A numerical example is provided to illustrate the modified method and also a real life oriented production problem is modeled and solved.展开更多
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 programming problem in whi...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 programming problem in which the objective function is a linear fractional function, while constraint functions are in the form of linear inequalities. This approach does not depend on the simplex type method. Here first we transform this LFP problem into linear programming (LP) problem and hence solve this problem algebraically using the concept of duality. Two simple examples to illustrate our algorithm are given. And also we compare this approach with other available methods for solving LFP problems.展开更多
In this paper, we provide a new approach to solve approximately a system of fractional differential equations (FDEs). We extend this approach for approximately solving a fractional-order differential equation model of...In this paper, we provide a new approach to solve approximately a system of fractional differential equations (FDEs). We extend this approach for approximately solving a fractional-order differential equation model of HIV infection of CD4<sup>+</sup>T cells with therapy effect. The fractional derivative in our approach is in the sense of Riemann-Liouville. To solve the problem, we reduce the system of FDE to a discrete optimization problem. By obtaining the optimal solutions of new problem by minimization the total errors, we obtain the approximate solution of the original problem. The numerical solutions obtained from the proposed approach indicate that our approximation is easy to implement and accurate when it is applied to a systems of FDEs.展开更多
This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for...This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for its solution by using α-cut of fuzzy numbers. In this proposed method, we first define membership function for goals by introducing non-deviational variables for each of objective functions with effective use of α-cut intervals to deal with uncertain parameters being represented by fuzzy numbers. In the optimization process the under deviational variables are minimized for finding a most satisfactory solution. The developed method has also been implemented on a problem for illustration and comparison.展开更多
This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by util...This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by utilizing the method,we can convert the initial generalized linear fractional programming problem and its subproblems into a series of linear programming relaxation problems.Based on the branch-and-bound framework and linear programming relaxation problems,a branch-and-bound algorithm is presented for globally solving the generalized linear fractional programming problem,and the computational complexity of the algorithm is given.Finally,numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.展开更多
文摘In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional programming technique. In the objective function of an LFP, if βis negative, the available methods are failed to solve, while our proposed method is capable of solving such problems. In the present paper, we propose a new method and develop FORTRAN programs to solve the problem. The optimal LFP solution procedure is illustrated with numerical examples and also by a computer program. We also compare our method with other available methods for solving LFP problems. Our proposed method of linear fractional programming (LFP) problem is very simple and easy to understand and apply.
基金supported by the National Natural Science Foundation of China(70771080)the Special Fund for Basic Scientific Research of Central Colleges+2 种基金China University of Geosciences(Wuhan) (CUG090113)the Research Foundation for Outstanding Young TeachersChina University of Geosciences(Wuhan)(CUGQNW0801)
文摘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 problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.
文摘This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear frac-tional programming problem with interval coefficients in the objective function. It is proved that we can convert an IVLFP to an optimization problem with interval valued objective function which its bounds are linear fractional functions. Also there is a discussion for the solutions of this kind of optimization problem.
基金Supported by the Natural Science Foundation of Henan Province（0511012000 0511013600） Supported by the Science Foundation for Pure Research of Natural Science of the Education Department of Henan Province（200512950001）
文摘In this paper, a modified method to find the efficient solutions of multi-objective linear fractional programming (MOLFP) problems is presented. While some of the previously proposed methods provide only one efficient solution to the MOLFP problem, this modified method provides multiple efficient solutions to the problem. As a result, it provides the decision makers flexibility to choose a better option from alternatives according to their financial position and their level of satisfaction of objectives. A numerical example is provided to illustrate the modified method and also a real life oriented production problem is modeled and solved.
文摘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 programming problem in which the objective function is a linear fractional function, while constraint functions are in the form of linear inequalities. This approach does not depend on the simplex type method. Here first we transform this LFP problem into linear programming (LP) problem and hence solve this problem algebraically using the concept of duality. Two simple examples to illustrate our algorithm are given. And also we compare this approach with other available methods for solving LFP problems.
文摘In this paper, we provide a new approach to solve approximately a system of fractional differential equations (FDEs). We extend this approach for approximately solving a fractional-order differential equation model of HIV infection of CD4<sup>+</sup>T cells with therapy effect. The fractional derivative in our approach is in the sense of Riemann-Liouville. To solve the problem, we reduce the system of FDE to a discrete optimization problem. By obtaining the optimal solutions of new problem by minimization the total errors, we obtain the approximate solution of the original problem. The numerical solutions obtained from the proposed approach indicate that our approximation is easy to implement and accurate when it is applied to a systems of FDEs.
文摘This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for its solution by using α-cut of fuzzy numbers. In this proposed method, we first define membership function for goals by introducing non-deviational variables for each of objective functions with effective use of α-cut intervals to deal with uncertain parameters being represented by fuzzy numbers. In the optimization process the under deviational variables are minimized for finding a most satisfactory solution. The developed method has also been implemented on a problem for illustration and comparison.
基金the National Natural Science Foundation of China(Nos.11871196,12071133 and 12071112)the China Postdoctoral Science Foundation(No.2017M622340)+1 种基金the Key Scientific and Technological Research Projects of Henan Province(Nos.202102210147 and 192102210114)the Science and Technology Climbing Program of Henan Institute of Science and Technology(No.2018JY01).
文摘This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by utilizing the method,we can convert the initial generalized linear fractional programming problem and its subproblems into a series of linear programming relaxation problems.Based on the branch-and-bound framework and linear programming relaxation problems,a branch-and-bound algorithm is presented for globally solving the generalized linear fractional programming problem,and the computational complexity of the algorithm is given.Finally,numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.
基金Supported by NSFC(U1404105)the Key Scientific and Technological Project of Henan Province(142102210058)+2 种基金the Youth Science Foundation of Henan Normal University(2013qk02)Henan Normal University National Research Project to Cultivate the Funded Projects(01016400105)the Henan Normal University Youth Backbone Teacher Training
