Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions (Q819625): Difference between revisions

The authors consider generalized fractional programming problems. These problems have arisen in multiobjective programming, approximation theory, goal programming, and economics. Firstly, the authors give the definitions of differentiability, convexity, and certain types of generalized convexity for \(n\)-set functions, and recall a set of optimality conditions for generalized fractional programming problems. Secondly, they present four sets of parametric and nonparametric saddle-point-type necessary and sufficient optimality conditions for generalized fractional programming problems. Finally, making use of these optimality conditions, they formulate two Lagrangian-type dual problems and prove corresponding duality theorems.