Approximations of bi-criteria optimization problem

Traian Ionut Luca, Dorel I. Duca


In this article we study approximation methods for solving bi-criteria optimization problems. Initial problem is approximated by a new one
consisting of the second order approximation of feasible set and components of objective function might be initial function, first or
second approximation of it.
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.


efficient solution; bi-criteria optimization; eta-approximation; invex and incave function

Full Text:



Boncea, H., Duca, D.I., On the η (1; 2) approximated problems, Carpathian Journal of Mathematics, vol. 28, no. 1, pp. 17-24, (2012).

Chankong, V., Haimes, Y., Multiobjective Decision Making Theory and Methodology, North-Holland, (1983).

Chikalov, I., Hussain, S., Moshkov, M., Bi-criteria optimization of decision trees with applications to data analysis, European journal of Operational Research, vol. 266, no. 2, pp. 689-701, (2018).

Konno, H., Yamazaki, H., Mean absolute deviation portfolio optimization model and its applications to Tokyo Stock Market, Management Science, vol. 37, no.5, pp. 519-531, (1991).

Mahalov A., Luca T.I., Minimax rule for energy optimization, Computers and Fluids, vol. 151, pp. 35-45, (2017).

Palacio, A., Adenso-Diaz, B., Lozano, S., Furio, S., Bi-criteria optimization model for locating maritime container depots: application to the port of Valencia, Networks and Spatial Economics, vol. 16, no. 1, pp. 331-348, (2016).



  • There are currently no refbacks.