Duality in nondifferentiable multiobjective fractional programming problem with generalized invexity

2009 ◽  
Vol 35 (1-2) ◽  
pp. 103-118 ◽  
Author(s):  
T. R. Gulati ◽  
Geeta
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Multiobjective Fractional Programming ◽  
Generalized Invexity ◽  
Fractional Programming Problem ◽  
Multiobjective Fractional Programming Problem

On duality for a second-order multiobjective fractional programming problem involving type-I functions

2019 ◽  
Vol 26 (3) ◽  
pp. 393-404 ◽  
Author(s):  
Ramu Dubey ◽  
S. K. Gupta
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Compact Convex ◽  
Second Order ◽  
Type I ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Multiobjective Fractional Programming Problem ◽  
Compact Convex Set ◽  
Formula Type

Abstract The purpose of this paper is to study a nondifferentiable multiobjective fractional programming problem (MFP) in which each component of objective functions contains the support function of a compact convex set. For a differentiable function, we introduce the class of second-order {(C,\alpha,\rho,d)-V} -type-I convex functions. Further, Mond–Weir- and Wolfe-type duals are formulated for this problem and appropriate duality results are proved under the aforesaid assumptions.

scholarly journals On properties of semipreinvex functions

2003 ◽  
Vol 68 (3) ◽  
pp. 449-459 ◽  
Author(s):  
X. M. Yang ◽  
X. Q. Yang ◽  
K. L. Teo
Keyword(s):  
Saddle Point ◽  
Programming Problem ◽  
Fractional Programming ◽  
Optimality Criteria ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Basic Properties ◽  
Multiobjective Fractional Programming Problem ◽  
Semipreinvex Functions

In this paper, we first discuss some basic properties of semipreinvex functions. We then show that the ratio of semipreinvex functions is semipreinvex, which extends earlier results by Khan and Hanson [6] and Craven and Mond [3]. Finally, saddle point optimality criteria are developed for a multiobjective fractional programming problem under semipreinvexity conditions.

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.

Sign in / Sign up

Export Citation Format

Share Document