Approximations of objective function and constraints in bi-criteria optimization problems

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 sec...

Full description

Saved in:
Bibliographic Details
Published inJournal of numerical analysis and approximation theory Vol. 47; no. 2
Main Authors Traian Ionut Luca, Dorel I. Duca
Format Journal Article
LanguageEnglish
Published Publishing House of the Romanian Academy 01.12.2018
Subjects
bi-criteria optimization
efficient solution
eta-approximation
incave function
invex function
optimization
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2457-6794
2501-059X