Back to Search
Start Over
A linearized approach for solving differentiable vector optimization problems with vanishing constraints.
- Source :
-
Mathematical Methods in the Applied Sciences . Mar2024, Vol. 47 Issue 4, p2402-2411. 10p. - Publication Year :
- 2024
-
Abstract
- In this paper, two mathematical methods are used for solving a complex multicriteria optimization problem as the considered convex differentiable vector optimization problem with vanishing constraints. First of them is the linearized approach in which, for the original vector optimization problem with vanishing constraints, its associated multiobjective programming problem is constructed at the given feasible solution. Since the aforesaid multiobjective programming problem constructed in the linearized method is linear, one of the existing methods for solving linear vector optimization problems is applied for solving it. Thus, the procedure for solving the considered differentiable vector optimization problems with vanishing constraints is presented in the paper. [ABSTRACT FROM AUTHOR]
- Subjects :
- *CONVEX functions
Subjects
Details
- Language :
- English
- ISSN :
- 01704214
- Volume :
- 47
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Mathematical Methods in the Applied Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 175388167
- Full Text :
- https://doi.org/10.1002/mma.9752