Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On nonsmooth multiobjective fractional programming problem involving \((p,r)\)-\(\rho\)-\((\eta,theta)\)-invex functions - MaRDI portal

On nonsmooth multiobjective fractional programming problem involving \((p,r)\)-\(\rho\)-\((\eta,theta)\)-invex functions (Q6486686)

From MaRDI portal
scientific article; zbMATH DE number 6369858
Language Label Description Also known as
English
On nonsmooth multiobjective fractional programming problem involving \((p,r)\)-\(\rho\)-\((\eta,theta)\)-invex functions
scientific article; zbMATH DE number 6369858

    Statements

    On nonsmooth multiobjective fractional programming problem involving \((p,r)\)-\(\rho\)-\((\eta,theta)\)-invex functions (English)
    0 references
    0 references
    0 references
    14 November 2014
    0 references
    The class of multiobjective fractional programming problems (MFP) is considered, where the involved functions are locally Lipschitz. The authors first introduce the definition of the \((p,r)\)-\(\rho\)-\((\eta,\theta)\)-invex class about the Clarke generalized gradient and further extend the \((p,r)\)-\(\rho\)-\((\eta,\theta)\)-invex functions to the case of nondifferentiable functions. Based upon these generalized invex functions, sufficient optimality conditions for multiobjective fractional programming problems are derived. Further on, the authors formulate three different types of dual models corresponding to (MFP), and prove appropriate weak, strong and strict converse duality theorems.
    0 references
    Clarke gradient
    0 references
    efficiency
    0 references
    sufficient optimality conditions
    0 references
    duality theorems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references