Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming (Q541798)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5905126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming |
scientific article; zbMATH DE number 5905126 |
Statements
Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming (English)
0 references
8 June 2011
0 references
Summary: We consider nondifferentiable minimax fractional programming problems involving \(B\)-\((p,r)\)-invex functions with respect to \(\eta\) and \(b\). Sufficient optimality conditions and duality results for a class of nondifferentiable minimax fractional programming problems are obtained under \(B\)-\((p,r)\)-invexity assumption on objective and constraint functions. Parametric duality, Mond-Weir duality, and Wolfe duality problems may be formulated, and duality results are derived under \(B\)-\((p,r)\)-invex functions.
0 references
invex functions
0 references
duality problems
0 references
0 references
0 references
0 references
0.9544036984443665
0 references
0.9165149331092834
0 references
0.9142710566520692
0 references
0.914012849330902
0 references
