EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3835. On optimality conditions for nonsmooth multiobjective programming problems with vanishing constraints
Invited abstract in session MB-41: Vector and Set Optimization II, stream Vector and Set Optimization.
Monday, 10:30-12:00Room: 97 (building: 306)
Authors (first author is the speaker)
1. | Tadeusz Antczak
|
Faculty of Mathematics and Computer Science, University of Lodz |
Abstract
A particular form of extremum problems which attracted the attention of the optimization community over more than the past decade are a so-called optimization problem with vanishing constraints. This follows from the fact that optimization problems of such a type have been served as a model for many extremum problems from structural and topology optimization. In most of works in the optimization literature, optimality and duality results have been proved only for differentiable scalar optimization problems with vanishing constraints. In our considerations, we shall investigate optimality results for a new class of nondifferentiable multiobjective programming problems with vanishing constraints. Namely, we derive both necessary and sufficient optimality conditions for a new class of such nonsmooth vector optimization problems.
Keywords
- Programming, Multi-Objective
- Non-smooth Optimization
- Programming, Nonlinear
Status: accepted
Back to the list of papers