Higher Order Convexity and Duality in Multiobjective Programming Problems
From MaRDI portal
Cited in
(13)- Higher-order symmetric duality in vector optimization problem involving generalized cone-invex functions
- Higher-order duality for multiobjective programming problems involving \({(F, \alpha, \rho, d)}\)-V-type I functions
- Optimality and duality in multiobjective programming involving higher order semilocally strong convexity
- Higher-order \((\Phi,\rho)\)-\(V\)-invexity and duality for vector optimization problems
- Higher-order duality for a class of nondifferentiable multiobjective programming problems involving generalized type I and related functions
- Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
- Higher order duality in multiobjective programming with cone constraints
- Nondifferentiable higher order duality in multiobjective programming involving cones
- Wolfe type higher order multiple objective nondifferentiable symmetric dual programming with generalized invex function
- Higher order duality in multiobjective fractional programming problem with generalized convexity
- Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems
- Higher-order duality for multiobjective optimization problems containing support functions over cones
- scientific article; zbMATH DE number 5240538 (Why is no real title available?)
This page was built for publication: Higher Order Convexity and Duality in Multiobjective Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946117)
