Sequential approximate optimality conditions for multi objective fractional programming problems via sequential approximate subdifferential calculus
Abstract
The purpose of this paper is to establish sequential efficient optimality conditions, without any constraint qualification, characterizing an efficient solution for multiobjec- tive fractional programming problem. The approach used in this investigation is based on sequential subdifferential calculus. By using the same approach, we establish the standard optimality conditions under a constraint qualification. Finally, we present an example illustrating the main result of this paper.
Copyright (c) 2021 M. Laghdir
This work is licensed under a Creative Commons Attribution 4.0 International License.
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
