Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems.
X. J. LongX. B. LiJ. ZengPublished in: Optim. Lett. (2013)
Keyphrases
- approximate solutions
- set valued
- optimization problems
- lipschitz continuity
- optimal solution
- variational inequalities
- nonlinear programming
- objective function
- evolutionary algorithm
- np hard
- subgradient method
- dominance relation
- metaheuristic
- single valued
- set valued attributes
- exact solution
- cost function
- real numbers
- energy function
- belief functions
- sufficient conditions
- multi objective
- combinatorial optimization
- sensitivity analysis
- linear programming
- genetic algorithm