scientific article; zbMATH DE number 682561

zbMath0811.90104MaRDI QIDQ4312260

Shashi Pandey, C. R. Bector, Davinder Bhatia

Publication date: 6 November 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrangian approachgeneralized fractional program

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Fractional programming (90C32)

Related Items (7)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ A note on fractional minmax programs containing \(n\)-set functions ⋮ On minimax fractional programming of generalized convex set functions ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions

This page was built for publication: