Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions

zbMath1147.90401MaRDI QIDQ1884526

G. J. Zalmai

Publication date: 1 November 2004

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

duality theoremsminmax fractional subset programminggeneralized convex n-set functionsparametric and parameter-free dual problemsparametric and parameter-free sufficient optimality conditions

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) 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 ⋮ Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity

This page was built for publication: Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions