Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions

From MaRDI portal