Approximate solutions, Continuous-time linear fractional programming problems, Dinkelbach-type algorithm, Weak duality, Weak-star convergence,
Abstract This article presents a new approximation algorithm for globally solving a class of general...
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional p...
In this paper, a dual of a given linear fractional program is defined and the weak, direct and conve...
Fractional Programming, Parametric Optimization, Nonconvex Programming, Nonlinear Programming, AMS s...
AbstractIn this paper, we develop a discrete approximation method for solving continuous-time linear...
AbstractIn this paper, we present necessary optimality conditions and sufficient optimality conditio...
A new dual problem for convex generalized fractional programs with no duality gap is presented and i...
In many decision problems, criteria that can be expressed as ratios occur. The corresponding optimiz...
For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear f...
In this paper, we consider the min–max linear fractional programming problem (MLFP) which is NP-hard...
A sequential method is proposed for solving a nonlinear optimization problem depending on a paramete...
Abstract. In this article, a hybrid of the parametric method and discretization approach is proposed...
In this paper, a deterministic global optimization algorithm is proposed for solving min-max and max...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
The object of this thesis is to study the multi-criteria linear fractional programming problems (MLF...
Abstract This article presents a new approximation algorithm for globally solving a class of general...
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional p...
In this paper, a dual of a given linear fractional program is defined and the weak, direct and conve...
Fractional Programming, Parametric Optimization, Nonconvex Programming, Nonlinear Programming, AMS s...
AbstractIn this paper, we develop a discrete approximation method for solving continuous-time linear...
AbstractIn this paper, we present necessary optimality conditions and sufficient optimality conditio...
A new dual problem for convex generalized fractional programs with no duality gap is presented and i...
In many decision problems, criteria that can be expressed as ratios occur. The corresponding optimiz...
For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear f...
In this paper, we consider the min–max linear fractional programming problem (MLFP) which is NP-hard...
A sequential method is proposed for solving a nonlinear optimization problem depending on a paramete...
Abstract. In this article, a hybrid of the parametric method and discretization approach is proposed...
In this paper, a deterministic global optimization algorithm is proposed for solving min-max and max...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
The object of this thesis is to study the multi-criteria linear fractional programming problems (MLF...
Abstract This article presents a new approximation algorithm for globally solving a class of general...
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional p...
In this paper, a dual of a given linear fractional program is defined and the weak, direct and conve...
DOI
Add to ORKG