scholarly journals Higher order symmetric duality for multiobjective fractional programming problems over cones

2021 ◽  
pp. 12-12
Author(s):  
Arshpreet Kaur ◽  
MaheshKumar Sharma
Keyword(s):  
Convex Function ◽  
Programming Problem ◽  
Fractional Programming ◽  
Higher Order ◽  
Symmetric Model ◽  
Multiobjective Fractional Programming ◽  
Symmetric Duality ◽  
Duality Results ◽  
Primal Dual ◽  
Set Up

This article studies a pair of higher order nondifferentiable symmetric fractional programming problem over cones. First, higher order cone convex function is introduced. Then using the properties of this function, duality results are set up, which give the legitimacy of the pair of primal dual symmetric model.

scholarly journals Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints

2020 ◽  
Vol 8 (1) ◽  
pp. 187-205 ◽  
Author(s):  
Ramu Dubey ◽  
Deepmala ◽  
Vishnu Narayan Mishra
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Higher Order ◽  
Multiobjective Fractional Programming ◽  
Symmetric Duality ◽  
Numerical Examples ◽  
Fractional Programming Problem ◽  
Multiobjective Fractional Programming Problem ◽  
Duality Relations ◽  
Definition Of

In this paper, we introduce the definition of higher-order K-(C, α, ρ, d)-convexity/pseudoconvexity over cone and discuss a nontrivial numerical examples for existing such type of functions. The purpose of the paper is to study higher order fractional symmetric duality over arbitrary cones for nondifferentiable Mond-Weir type programs under higher- order K-(C, α, ρ, d)-convexity/pseudoconvexity assumptions. Next, we prove appropriate duality relations under aforesaid assumptions.

scholarly journals Duality for multiobjective fractional programming problems involving d -type-I n-set functions

2009 ◽  
Vol 19 (1) ◽  
pp. 63-73
Author(s):  
I.M. Stancu-Minasian ◽  
Gheorghe Dogaru ◽  
Mădălina Stancu
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Type I ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Duality Results ◽  
Set Functions ◽  
Convexity Assumptions ◽  
Nonlinear Fractional Programming

We establish duality results under generalized convexity assumptions for a multiobjective nonlinear fractional programming problem involving d -type-I n -set functions. Our results generalize the results obtained by Preda and Stancu-Minasian [24], [25].

Non-differentiable higher-order fractional programming problem and their duality results under cone-invex functions

2021 ◽  
Author(s):  
Rajesh Kumar Tripathi ◽  
Arvind Kumar ◽  
Ramu Dubey ◽  
Awanish Kumar Tiwari ◽  
Jasvendra Tyagi ◽  
...  
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Higher Order ◽  
Fractional Programming Problem ◽  
Invex Functions ◽  
Duality Results

scholarly journals Higher order duality in multiobjective fractional programming problem with generalized convexity

2017 ◽  
Vol 27 (2) ◽  
pp. 249-264
Author(s):  
P Pankaj ◽  
Bhuwan Joshi
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Higher Order ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Invex Functions ◽  
Multiobjective Fractional Programming Problem ◽  
Invex Function ◽  
Higher Order Duality

We have introduced higher order generalized hybrid B -(b,?,?,??,?r)-invex function. Then, we have estabilished higher order weak, strong and strict converse duality theorems for a multiobjective fractional programming problem with support function in the numerator of the objective function involving higher order generalized hybrid B -(b,?,?,??,?r)-invex functions. Our results extend and unify several results from the literature.

Sign in / Sign up

Export Citation Format

Share Document