Approximate Solutions to Nonsmooth Multiobjective Programming Problems
Keywords:
Mathematical programming, optimality conditions, nonlinear programming, nonsmooth analysis and approximate conditions.Abstract
We consider a multiobjective mathematical programming problem with inequality and equality constraints, where all functions are locally Lipschitz. An approximate strong Karush-Kuhn-Tucker (ASKKT for short) condition is defined and we show that every local efficient solution is an ASKKT point without any additional condition. Then a nonsmooth version of cone-continuity regularity is
defined for this kind of problem. It is revealed that every ASKKT point under the cone-continuity regularity is a strong Karush-Kuhn-Tucker (SKKT for short) point. Correspondingly, the ASKKTs and the cone-continuity property are defined and the relations between them are investigated.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
