Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones

DOI10.1007/s12597-015-0214-9zbMath1365.90235OpenAlexW2466424982MaRDI QIDQ2359244

Megha Sharma, Surjeet Kaur Suneja

Publication date: 27 June 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-015-0214-9

zbMATH Keywords

dualityoptimalitytype-I functionsarcwise cone connected functions

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Duality in vector optimization in Banach spaces with generalized convexity
• Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
• Optimality and duality in vector optimization involving generalized type I functions over cones
• Elementary properties of arcwise connected sets and functions
• Optimality criteria in mathematical programming involving generalized invexity
• Generalized arcwise-connected functions and characterizations of local- global minimum properties
• On sufficiency of the Kuhn-Tucker conditions
• Perfect duality for convexlike programs
• Optimality conditions and duality involving arcwise connected and generalized arcwise connected functions
• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
• Multiple objective fractional programming involving semilocally type I-preinvex and related functions
• Arcwise connected functions and applications in multiobjective optimization
• A note on arewise connected sets and functions
• Necessary and sufficient conditions in constrained optimization
• Generalized invexity and duality in multiobjective programming problems