Affiliation:
1. Faculty of Mathematics and Computer Science University of Lodz Lodz Poland
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.
Subject
General Engineering,General Mathematics
Reference29 articles.
1. Algorithms for the general problem of mathematical programming (in Russian);Pshenichnyi B. N.;Kibernetika,1970
2. The Linearization Method for Constrained Optimization
3. A new successive linearization approach for solving nonlinear programming problems;Albayrak I.;Appl. Appl. Math.,2019
4. An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
5. Linear and Nonlinear Programming