Fractional programming approach to a cost minimization problem in electricity market
نویسندگان
چکیده
منابع مشابه
FGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملfgp approach to multi objective quadratic fractional programming problem
multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...
متن کاملFractional CCP: A Fuzzy Goal Programming Approach
Abstract It is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (CC) problem. For this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. A sam...
متن کاملTOPSIS approach to linear fractional bi-level MODM problem based on fuzzy goal programming
The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multi-objective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ...
متن کاملA Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem
The bandwidth of a sparse matrix is the distance from the main diagonal beyond which all elements of the matrix are zero. The bandwidth minimisation problem for a matrix consists of finding the permutation of rows and columns of the matrix which ensures that the non-zero elements are located in as narrow a band as possible along the main diagonal. This problem, which is known to be NP-complete,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2019
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor171115003g