A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces

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

Cites Work

Further Generalizations of Convexity in Mathematical Programming
Phase recovery, MaxCut and complex semidefinite programming
Linear programming in complex space
Some characterizations of robust optimal solutions for uncertain convex optimization problems
Duality for nonlinear programming in complex space
Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
On nonlinear programming in complex spaces
Title not available (Why is that?)
On symmetric duality in mathematical programming withF-convexity
GeneralizedF-convexity and its classification
A new approach to multiobjective programming with a modified objective function
Efficiency for a generalized form of vector optimization problems in complex space
Complex fractional programming and the Charnes-Cooper transformation
Duality with generalized convexity
Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
Criteria of saddle points for the general form of vector optimization problem in complex space
Optimality and duality for complex multi-objective programming
Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
The modified objective function method for univex multiobjective variational problems
Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
Modified objective function method in nonsmooth vector optimization over cones
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
Optimality and duality for multi-objective fractional programming in complex spaces
Characterizing a class of robust vector polynomial optimization via sum of squares conditions
Title not available (Why is that?)

This page was built for publication: A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces

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