Sufficiency and duality for multiobjective programming under new invexity

DOI10.1155/2016/8462602MaRDI QIDQ1793665zbMATH OpenOpenAlexWikidataFDO

Authors Yingchun Zheng, Xiaoyan Gao

Publication date 12 October 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/8462602

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Review text

Summary: A class of multiobjective programming problems including inequality constraints is considered. To this aim, some new concepts of generalized \(\left(F, P\right)\)-type I and \(\left(F, P\right)\)-type II functions are introduced in the differentiable assumption by using the sublinear function \(F\). These new functions are used to establish and prove the sufficient optimality conditions for weak efficiency or efficiency of the multiobjective programming problems. Moreover, two kinds of dual models are formulated. The weak dual, strong dual, and strict converse dual results are obtained under the aforesaid functions.

Recommendations

• Sufficiency and duality in multiobjective programming under generalized type I functions
• Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
• Optimality and duality in nondifferentiable and multiobjective programming under generalized d-invexity
• On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
• scientific article; zbMATH DE number 7009380

Cites work

• ( , )-invexity in nonsmooth optimization
• Efficiency and generalized convex duality for nondifferentiable multiobjective programs
• Higher-order symmetric duality with higher-order generalized invexity
• Nonsmooth - ( , )-invexity in multiobjective programming problems
• On G-invex multiobjective programming. II: Duality
• On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
• Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
• Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
• Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions
• Optimality conditions and duality in nonsmooth multiobjective programs
• Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under (, )-invexity
• Second order symmetric duality in nondifferentiable multiobjective fractional programming with cone convex functions
• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (, )-V-type I functions

Cited in

(4)

• Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
• Multiobjective programming with new invexities
• SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
• New sufficiency for global optimality and duality of nonlinear multi-objective programming problems via underestimators

This page was built for publication: Sufficiency and duality for multiobjective programming under new invexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793665)