Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions

DOI10.1155/2014/904640MaRDI QIDQ469982zbMATHOpenAlexWikidataFDO

Authors Pallavi Kharbanda, Divya Agarwal, Deepa Sinha

Publication date 11 November 2014

Published in ISRN Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2014/904640

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Multi-objective and goal programming (90C29)

Recommendations

• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
• Nonsmooth multiobjective optimization involving generalized univex functions
• Generalized univex functions in nonsmooth multiobjective optimization
• On nonsmooth multiobjective programming with generalized univexity

Cites work

• scientific article; zbMATH DE number 592621 (Why is no real title available?)
• scientific article; zbMATH DE number 746083 (Why is no real title available?)
• A class of nonconvex functions and mathematical programming
• Multiobjective programming under \(d\)-invexity
• Multiobjective programming under generalized type I invexity
• Necessary and sufficient conditions in constrained optimization
• Nondifferentiable multiobjective programming under generalized \(d\)-univexity
• Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
• Nonsmooth multiobjective optimization involving generalized univex functions
• On generalised convex mathematical programming
• On multiple-objective optimization with generalized univexity
• On sufficiency of the Kuhn-Tucker conditions
• Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
• Optimality and duality with generalized convexity
• Optimality conditions and duality for a class of nonlinear fractional programming problems.
• Optimization and nonsmooth analysis
• Pre-invex functions in multiple objective optimization
• Some nondifferentiable multiobjective programming problems
• Strong and Weak Convexity of Sets and Functions
• Sufficiency and duality in multiobjective programming under generalized type I functions
• \(D\)-invexity and optimality conditions
• \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization

Cited in

(7)

• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
• Efficiency and duality in nonsmooth multiobjective programming with \((F,\alpha,\rho,\theta)\)-\(d\)-\(V\)-univexity
• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
• On nonsmooth multiobjective programming with generalized univexity
• scientific article; zbMATH DE number 6019694 (Why is no real title available?)
• Generalized univex functions in nonsmooth multiobjective optimization
• Nonsmooth multiobjective optimization involving generalized univex functions

This page was built for publication: Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions

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