Preinvexity in Multiobjective Fractional Programming

DOI10.1080/02522667.1992.10699113zbMath0770.90059OpenAlexW2315710276MaRDI QIDQ4024148

Norma G. Rueda, Chanchal Singh, Surjeet Kaur Suneja

Publication date: 25 February 1993

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1992.10699113

zbMATH Keywords

multiobjective fractional programmingpreinvexitysaddle point optimality criteriaLagrangian type duality theory

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Fractional programming (90C32)

Related Items

Lagrangian duality for preinvex set-valued functions, Higher order type-I α-invexity and duality in nondifferentiable mathematical programming, Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions, Sectionally Convexible Functions, Multiobjective fractional programming with generalized convexity

Cites Work

• A class of multiple-criteria fractional programming problems
• Pre-invex functions in multiple objective optimization
• Duality theory in multiobjective programming
• Proper efficiency and the theory of vector maximization
• Duality in multiple objective fractional programming problems involving non-convex functions
• A duality theorem for a multiple objective fractional optimization problem
• What is invexity?
• A class of nonconvex functions and mathematical programming
• Convex Transformable Programming Problems and Invexity
• Multiobjective fractional duality
• A Dual For A Multiple Objective Fractional Programming Problem