On Efficient Solutions for Semidefinite Linear Fractional Vector Optimization Problems
Keywords:
Semidefinite linear fractional vector optimization problem, efficient solutions, properly efficient solutions, optimality conditions, vector dual problem, weak duality theorem, strong duality theorem.Abstract
We consider a semidefinite linear fractional vector optimization problem (FVP) and establish optimality theorem for efficient solutions for (FVP), which hold without any constraint qualification and which are expressed by sequences. Moreover, we discuss the relations between properly efficient solution of (FVP) and one of its related linear vector optimization problem (LVP). By using the relation, we obtain optimality theorem for properly efficient solutions for (FVP), which hold without any constraint qualification and which are expressed by sequences.
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.
