Higher order duality in multiobjective fractional programming problem with generalized convexity
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...
Main Authors: | Pankaj, Joshi Bhuwan Chandra |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2017-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431700009P.pdf |
Similar Items
-
On nonsmooth multiobjective fractional programming problems involving (p, r)− ρ −(η ,θ)- invex functions
by: Jayswal Anurag, et al.
Published: (2013-01-01) -
Optimality conditions and duality in multiobjective programming with invexity
by: Ferrara Massimiliano, et al.
Published: (2008-01-01) -
Higher order symmetric duality for multiobjective fractional programming problems over cones
by: Kaur Arshpreet, et al.
Published: (2022-01-01) -
Nondifferentiable generalized minimax fractional programming under (Ф,ρ)-invexity
by: Upadhyay B.B., et al.
Published: (2022-01-01) -
Second Order (F, α, ρ, d, E)-convex function and the Duality Problem
by: Abd El-Monem A. Megahed
Published: (2014-04-01)