Higher order duality in multiobjective fractional programming problem with generalized convexity

DOI10.2298/YJOR170121009PzbMath1474.90465MaRDI QIDQ4987694

No author found.

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

dualitymultiobjective fractional programmingsupport function\rho\theta\widetilde{p}\widetilde{r})\)-invex functionhigher-order \(B-(b

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Iterative numerical methods for linear systems (65F10)

Related Items (1)

HIGHER ORDER DUALITY FOR A NEW CLASS OF NONCONVEX SEMI-INFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH SUPPORT FUNCTIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Nondifferentiable higher order duality in multiobjective programming involving cones
• Generalized \((\eta,\rho)\)-invex functions and global semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms
• Invexity and optimization
• Optimality criteria in mathematical programming involving generalized invexity
• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• Second- and higher-order duality in nonlinear programming
• Necessary conditions and sufficient conditions for static minmax problems
• Higher-order generalized invexity and duality in mathematical programming
• Duality for a class of nondifferentiable multiobjective programming problems
• Higher-order generalized invexity and duality in nondifferentiable mathematical programming
• Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
• On fractional programming containing support functions
• Second order duality for fractional programming with support functions.
• Generalized hybrid \(B-(b, \rho, \theta, \tilde{p}, \tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming
• Strong and Weak Convexity of Sets and Functions
• Necessary and sufficient conditions in constrained optimization
• Invex functions and constrained local minima
• Higher Order Convexity and Duality in Multiobjective Programming Problems
• Convex Analysis
• On \((p,r)\)-invexity-type nonlinear programming problems.

This page was built for publication: Higher order duality in multiobjective fractional programming problem with generalized convexity