scholarly journals Second Order Duality in Multiobjective Fractional Programming with Square Root Term under Generalized Univex Function

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Arun Kumar Tripathy
Keyword(s):  
Fractional Programming ◽  
Sufficient Conditions ◽  
Positive Semidefinite ◽  
Second Order ◽  
Square Root ◽  
Multiobjective Fractional Programming ◽  
Multiobjective Fractional Programming Problem ◽  
Second Order Duality ◽  
Root Term ◽  
Necessary And Sufficient

Three approaches of second order mixed type duality are introduced for a nondifferentiable multiobjective fractional programming problem in which the numerator and denominator of objective function contain square root of positive semidefinite quadratic form. Also, the necessary and sufficient conditions of efficient solution for fractional programming are established and a parameterization technique is used to establish duality results under generalized second order ρ-univexity assumption.

APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING

2004 ◽  
Vol 21 (02) ◽  
pp. 197-206 ◽  
Author(s):  
NARENDER KUMAR ◽  
R. K. BUDHRAJA ◽  
APARNA MEHRA
Keyword(s):  
Fractional Programming ◽  
Sufficient Conditions ◽  
Approximate Solutions ◽  
Efficient Solutions ◽  
Parametric Approach ◽  
Multiobjective Fractional Programming ◽  
Set Functions ◽  
New Concepts ◽  
Multiobjective Fractional Programming Problem ◽  
Necessary And Sufficient

In this paper, we introduce new concepts of ε-weak efficient solutions and ε-efficient solutions for a nonconvex multiobjective fractional programming problem involving n-set functions. Using an ε-parametric approach and a new theorem of alternative for nonconvex n-set functions, some necessary and sufficient conditions for ε-approximate solutions are derived

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 second- order symmetric duality for a class of multiobjective fractional programming problem

2012 ◽  
Vol 43 (2) ◽  
pp. 267-279 ◽  
Author(s):  
Deo Brat Ojha
Keyword(s):  
Fractional Programming ◽  
Strong Duality ◽  
Second Order ◽  
Multiobjective Fractional Programming ◽  
Duality Theorems ◽  
Symmetric Duality ◽  
Multiobjective Fractional Programming Problem ◽  
Special Cases ◽  
Second Order Symmetric Duality ◽  
Dual Models

This article is concerned with a pair of second-order symmetric duals in the context of non-differentiable multiobjective fractional programming problems. We establish the weak and strong duality theorems for the new pair of dual models. Discussion on some special cases shows that results in this paper extend previous work in this area.

Sign in / Sign up

Export Citation Format

Share Document