No label defined (Q3975282)
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 17929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17929 |
Statements
26 June 1992
0 references
generalized convexity
0 references
necessary and sufficient optimality conditions
0 references
duality theorems
0 references
bi-nonlinear programming
0 references
0.8871853351593018
0 references
0.8766030073165894
0 references
0.8684309720993042
0 references
0.8548879027366638
0 references
[For the entire collection see Zbl 0727.00014.] The duality problem for minimax programs is considered. The maximization is discrete, components of the function and constraints vectors are convex or quasi-convex or strictly pseudo-convex. The program is transformed to a majorant minimization program for which necessary and sufficient optimality conditions are proved. The sufficient conditions for this generalized convex case were not known beforehand. Two variants of dual programs are suggested. Different (weak, strong, strict converse) duality theorems under various weaker convexity assumptions are established. The results are specified for generalized fractional and bi- nonlinear programming problems.
0 references
