scientific article; zbMATH DE number 17929

From MaRDI portal
Publication:3975282





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975282)