Add to ORKGA sequential method is proposed for solving a nonlinear optimization problem depending on a parameter; for a particular value of the parameter, the problem becomes the well-known linear fractional programming problem. Some properties of the objective function and the set of optimal solutions are established. An appropriate use of Farkas' lemma allows us to obtain some optimality conditions for the problem. Finally, the previous results permit to describe an algorithm to solve the problem
In this paper a linear programming-based optimization algorithm called the Sequential Cutting Plane ...
Abstract. In this paper a methodology is developed to solve a nonlinear fractional programming probl...
In many decision problems, criteria that can be expressed as ratios occur. The corresponding optimiz...
A method for solving the fractional nonlinear optimization problem has been proposed. It is shown th...
The aim of this paper is to study the class of maximization problems having linear constraints and a...
The main purpose of this paper is to delineate an algorithm for fractional programming with nonlinea...
This study aims to present an interactive method in order to solve multiple objective linear fractio...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
In this paper we will restate the sequential methods suggested by the Authors for solving a linear ...
In this paper, a deterministic global optimization algorithm is proposed for solving min-max and max...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
The purpose of this paper is to establish sequential efficient optimality conditions, without any co...
A decomposition method for non-linear programming problems with structured linear constraints is des...
For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear f...
Fractional Programming, Parametric Optimization, Nonconvex Programming, Nonlinear Programming, AMS s...
In this paper a linear programming-based optimization algorithm called the Sequential Cutting Plane ...
Abstract. In this paper a methodology is developed to solve a nonlinear fractional programming probl...
In many decision problems, criteria that can be expressed as ratios occur. The corresponding optimiz...
A method for solving the fractional nonlinear optimization problem has been proposed. It is shown th...
The aim of this paper is to study the class of maximization problems having linear constraints and a...
The main purpose of this paper is to delineate an algorithm for fractional programming with nonlinea...
This study aims to present an interactive method in order to solve multiple objective linear fractio...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
In this paper we will restate the sequential methods suggested by the Authors for solving a linear ...
In this paper, a deterministic global optimization algorithm is proposed for solving min-max and max...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
The purpose of this paper is to establish sequential efficient optimality conditions, without any co...
A decomposition method for non-linear programming problems with structured linear constraints is des...
For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear f...
Fractional Programming, Parametric Optimization, Nonconvex Programming, Nonlinear Programming, AMS s...
In this paper a linear programming-based optimization algorithm called the Sequential Cutting Plane ...
Abstract. In this paper a methodology is developed to solve a nonlinear fractional programming probl...
In many decision problems, criteria that can be expressed as ratios occur. The corresponding optimiz...