Duality for a class of minmax and inexact programming problem (Q1340521)
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: Duality for a class of minmax and inexact programming problem |
scientific article; zbMATH DE number 703302
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality for a class of minmax and inexact programming problem |
scientific article; zbMATH DE number 703302 |
Statements
Duality for a class of minmax and inexact programming problem (English)
0 references
14 December 1994
0 references
The authors give necessary and sufficient optimality conditions for a minmax of a quasiconvex-quasiconcave function on a feasible set defined by quasiconcave functions. A Mond-Weir type dual and duality theorems under weaker convexity conditions as well as an application to inexact programming problems are given.
0 references
necessary and sufficient optimality conditions
0 references
minmax of a quasiconvex- quasiconcave function
0 references
duality theorems
0 references
inexact programming
0 references
