DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (H_p, r)-INVEX FUNCTIONS

Abstract

Abstract. In this paper, we have taken step in the direction to establish weak, strong and strict converse duality theorems for three types of dual models related to multiojective fractional programming problems involving (Hp, r)-invex functions.

Optimality and duality results for E-differentiable multiobjective fractional programming problems under E-convexity

“…Subsequently, necessary optimality conditions similar to the well-known Karush-Kuhn-Tucker necessary optimality conditions for a smooth nonlinear programming problem were presented for various differentiable multiobjective fractional programming problems (for example, see [14,22,23,28,33]). One of such optimality criteria are the following parametric Karush-Kuhn-Tucker optimality conditions, which are necessary for optimality of a feasible solution x in the problem (MP v E E ).…”

Efficiency and duality for a vector of quotients of curvilinear functionals on the first‐order jet bundle

“…1 Since the last decade, many researchers contributed and extended the theory of real valued fractional programming problems to the multiobjective fractional programming case. The duality theory for the multiobjective fractional programming case has been explored by many researchers working in this area, a few of them are Bot et al, 2 Ho 3 and Jayswal et al 4 Variational problems arise in wide areas of research in optimization theory. These problems are of curvilinear integral-type subject to some boundary conditions.…”