solving nonlinear FP problems. In addition, several examples are provided to demonstrate the performance of these suggested fractional algorithms. 1. Introduction A nonlinear fractional programming (FP) problem minimizes or maximizes a ratio …

Jun 10, 2020 · This paper presents a method to find a Pareto optimal solution for the multi-objective linear plus linear fractional programming problem through nonlinear membership function. The proposed approach defines a fuzzy goal for each objective through a nonlinear membership function.

Mar 1, 2010 · In this paper, an algorithm that identifies redundant objective function (s) and redundant constraint (s) simultaneously in multi-objective nonlinear stochastic fractional programming problems is provided. A solution procedure is also …

Oct 21, 2016 · If in the nonlinear case the objective function is a ratio of two functions or involves several such ratios, then the optimization problem is called a fractional program. Apart from isolated earlier results, most of the work in fractional programming were done since about 1960.

Mar 8, 2012 · The present paper discusses a multiobjective integer nonlinear fractional programming problem based on cutting plane technique.

Oct 15, 2006 · The equivalence between multiobjective fractional programming problem and corresponding vector minimization problem opens various possibilities of developing solution procedures for different fractional type problems with several ratios in which objectives are strong nonlinear functions.

Abstract: This paper proposes an approach where it can be applied to the optimization decisions making problems under uncertainties and solves a multi-level multi-objective fractional programming problems involving stochastic parameters coefficient …

Jan 1, 2012 · We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex.

Dec 19, 2016 · In this paper, we will extend the methods adopted for the single-objective problem (FP) in [12] to the multiobjective problem (MFP). A function \ ( F: R^ {n}\rightarrow R \) is said to be sublinear if for any \ ( \alpha_ {1},\,\alpha_ {2}\in R^ {n} \), $$ F (\alpha_ {1}+\alpha_ {2})\leq F (\alpha_ {1})+F (\alpha_ {2})\, , $$

Nov 13, 2023 · Here we find the solution of the nonlinear programming problem by using Karush-Kuhn-Tucker condition. A numerical example is presented. 1. Introduction. Nonlinear programming is generally presenting far greater challenges than linear programming.