Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order \((V, \alpha, \rho, \theta)\)-invexity (Q1942857)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order \((V, \alpha, \rho, \theta)\)-invexity |
scientific article; zbMATH DE number 6144811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order \((V, \alpha, \rho, \theta)\)-invexity |
scientific article; zbMATH DE number 6144811 |
Statements
Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order \((V, \alpha, \rho, \theta)\)-invexity (English)
0 references
14 March 2013
0 references
Summary: In the present paper, the concept of higher-order \((V, \alpha, \rho, \theta)\)-invexity is used to study higher-order duality for a nondifferentiable multiobjective fractional programming problem (MFP). We first obtain a result giving higher-order \((V, \alpha, \rho, \theta)\)-invexity of the ratio of two functions. This result is then used to drive sufficient optimality conditions for an efficient solution of (MFP). Moreover, duality theorems are established for Mond-Weir type higher-order dual of (MFP).
0 references
multiobjective fractional programming
0 references
support function
0 references
higher-order \((V, \alpha, \rho, \theta)\)-invexity
0 references
efficiency
0 references
sufficiency
0 references
