Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming

DOI10.1155/IJMMS.2005.1253zbMath1085.90058OpenAlexW2037546441MaRDI QIDQ2575930

G. J. Zalmai

Publication date: 7 December 2005

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/52294

zbMATH Keywords

discrete minmax fractional subset programming problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (2)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions

This page was built for publication: Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming