A barrier-type method for multiobjective optimization
نویسندگان
چکیده
منابع مشابه
Newton's Method for Multiobjective Optimization
We propose an extension of Newton’s Method for unconstrained multiobjective optimization (multicriteria optimization). The method does not scalarize the original vector optimization problem, i.e. we do not make use of any of the classical techniques that transform a multiobjective problem into a family of standard optimization problems. Neither ordering information nor weighting factors for the...
متن کاملMultiobjective fuzzy optimization method
1 Technical University of Cluj-Napoca Abstract -The paper proposes a new multiobjective optimization method, based on fuzzy techniques. The method performs a real multiobjective optimization, every parameter modification taking into account the unfulfillment degrees of all the requirements. It uses fuzzy sets to define fuzzy objectives and fuzzy systems to compute new parameter values. The stra...
متن کاملAdaptive Weighted Sum Method for Multiobjective Optimization
This paper presents an adaptive weighted sum method for multiobjective optimization problems. The authors developed the bi-objective adaptive weighted sum method, which determines uniformly-spaced Pareto optimal solutions, finds solutions on non-convex regions, and neglects non-Pareto optimal solutions. However, the method could solve only problems with two objective functions. In this work, th...
متن کاملAn Exact Method for a Discrete Multiobjective Linear Fractional Optimization
Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming. In this work, we develop a branch and cut algorithm based on continuous fractional optimization, for generating the whole integer efficient solutions of the MOILFP problem. The basic idea of...
متن کاملA Method for Constrained Multiobjective Optimization Based on SQP Techniques
We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2019
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2019.1576667