Saddle-point type optimality criteria and duality relations for generalized fractional programming.
From MaRDI portal
Publication:2467817
DOI10.1007/BF03399224zbMath1278.90399OpenAlexW2776726817MaRDI QIDQ2467817
C. S. Lalitha, Surjeet Kaur Suneja, Seema Khurana
Publication date: 29 January 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03399224
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Equivalent Lagrangians for generalized fractional programming
- An algorithm for generalized fractional programs
- Saddle-point type optimality criteria for generalized fractional programming
- Generalized fractional programming duality: A parametric approach
- Perfect duality for convexlike programs
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized nonlinear fractional programming
- A class of nonconvex functions and pre-variational inequalities
- A new algorithm for generalized fractional programs
- Duality relations for generalized fractional programming involving \(n\)-set functions
- Duality in generalized linear fractional programming
- What is invexity?
- Generalized fractional programming duablity: a ratio game approach