Minmax programming problems with \((p,r)-\rho-(\eta,\theta)\)-invexity (Q1753782)
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: Minmax programming problems with \((p,r)-\rho-(\eta,\theta)\)-invexity |
scientific article; zbMATH DE number 6876011
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minmax programming problems with \((p,r)-\rho-(\eta,\theta)\)-invexity |
scientific article; zbMATH DE number 6876011 |
Statements
Minmax programming problems with \((p,r)-\rho-(\eta,\theta)\)-invexity (English)
0 references
29 May 2018
0 references
Summary: In this paper, we establish the sufficient optimality conditions for minmax programming and generalized fractional minmax programming problems. Based on the sufficient conditions, a duality model is constructed and duality results are derived under a new type of generalised invexity assumption, called \((p,r)-\rho-(\eta,\theta)\)-invexity. Our study extends some of the previously known results in the framework of generalised invexity and duality models. We also provide some examples to illustrate our work.
0 references
\((p,r)-\rho-(\eta,\theta)\)-invex function
0 references
minmax programming
0 references
Schaible dual
0 references
weak strong and strict converse duality results
0 references
optimality condition
0 references
0.9457571
0 references
0.9380928
0 references
0.91840935
0 references
0.9154217
0 references
0.91065127
0 references
0.9057101
0 references
