Duality and alternative in multi-objective optimization
نویسندگان
چکیده
منابع مشابه
Duality of Multi-objective Programming
The convexity theory plays an important role in many aspects of mathematical programming. In recent years, in order to relax convexity assumption, various generalized convexity notions have been obtained. One of them is the concept of ) , ( r p B− invexity defined by T.Antczak [1], which extended the class of B − invex functions with respect toη and b and the classes of ) , ( r p invex function...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Cluster Validity Analysis of Alternative Results from Multi-Objective Optimization
This paper investigates validity analysis of alternative clustering results obtained using the algorithm named Multiobjective K-Means Genetic Algorithm (MOKGA). The reported results are promising. MOKGA gives the optimal number of clusters as a solution set. The achieved clustering results are then analyzed and validated under several cluster validity techniques proposed in the literature. The ...
متن کاملDirected Multi-Objective Optimization
While evolutionary computing inspired approaches to multi-objective optimization have many advantages over conventional approaches; they generally do not explicitly exploit directional/gradient information. This can be inefficient if the underlying objectives are reasonably smooth, and this may limit the application of such approaches to real-world problems. This paper develops a local framewor...
متن کاملHardness and Approximability in Multi-Objective Optimization
We systematically study the hardness and the approximability of combinatorial multiobjective NP optimization problems (multi-objective problems, for short). We define solution notions that precisely capture the typical algorithmic tasks in multiobjective optimization. These notions inherit polynomial-time Turing reducibility from multivalued functions, which allows us to compare the solution no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1977
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1977-0679534-8