Author:
Luca Traian Ionut,Duca Dorel I.
Abstract
In this paper we study approximation methods for solving bi-criteria optimization problems.
Initial problem is approximated by a new one which has the components of the objective and the constraints are replaced by their approximation functions. Components of the objective function are first and second order approximated and constraints are first order approximated. Conditions such that efficient solution of the approximate problem will remain efficient for initial problem and reciprocally are studied.
Numerical examples are developed to emphasize the importance of these conditions.
Publisher
Academia Romana Filiala Cluj
Reference6 articles.
1. D.I. Duca, A. Ratiu, Semi-infinite optimization problems and their first order approximations, Annals of the Tiberiu Popoviciu Seminar of Functional Equations, Approximation and Convexity, 11 (2013), pp. 87–94,
2. V. Chankong, Y. Haimes, Multiobjective Decision Making Theory and Methodology, North-Holland, (1983).
3. I. Chikalov, S. Hussain, M. Moshkov, Bi-criteria optimization of decision trees with applications to data analysis, European journal of Operational Research, vol. 266 (2018) no. 2, pp. 689–701, https://doi.org/10.1016/j.ejor.2017.10.021
4. H. Konno, H. Yamazaki, Mean absolute deviation portfolio optimization model and its applications to Tokyo Stock Market, Management Science, 37 (1991) no.5, pp. 519–531, https://doi.org/10.1287/mnsc.37.5.519
5. A. Mahalov, T.I. Luca, Minimax rule for energy optimization, Computers and Fluids, 151 (2017), pp. 35–45, https://doi.org/10.1016/j.compfluid.2016.08.014