A Heuristic Method for Obtaining Upper and Lower Bounds for the Minimum of a Linear Function over the Efficient Set

被引：0

作者：

Metev, Boyan ^{[1
]}

机构：

[1] Inst Informat Technol, Sofia 1113, Bulgaria

来源：

CYBERNETICS AND INFORMATION TECHNOLOGIES | 2009年 / 9卷 / 04期

关键词：

Multiobjective optimization problem; optimization over the efficient set;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The paper proposes the use of the Reference Point (RP) method in a heuristic approach for estimating the minimal value of a linear function over the efficient set of a MultiObjective Linear Programming (MOLP) problem.

引用

页码：72 / 80

页数：9

共 50 条

[41] Lower bounds on the minimum pseudo-weight of linear codes
Vontobel, PO
Koetter, R
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 70 - 70
[42] ON AN ENTROPIC METHOD OF OBTAINING LOWER BOUNDS FOR THE COMPLEXITY OF BOOLEAN FUNCTIONS
IUKNA, SP
DOKLADY AKADEMII NAUK SSSR, 1988, 298 (03): : 556 - 559
[43] Lower Bounds on the Minimum Pseudodistance for Linear Codes with q-ary PSK Modulation over AWGN
Skachek, Vitaly
Flanagan, Mark F.
2008 5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, 2008, : 426 - +
[44] Upper and lower bounds on the partition function of the Hofstadter model
Moroz, A
MODERN PHYSICS LETTERS B, 1996, 10 (09): : 409 - 416
[45] A SEQUENCE OF UPPER AND LOWER BOUNDS FOR THE Q-FUNCTION
PHILIPS, TK
SAHRAOUI, A
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (06) : 877 - 878
[46] UPPER AND LOWER BOUNDS TO EIGENVALUES BY WEIGHTING FUNCTION APPROXIMATIONS
BODUR, IN
MARANGONI, RD
INTERNATIONAL JOURNAL OF SOLIDS AND STRUCTURES, 1983, 19 (12) : 1099 - 1114
[47] UPPER AND LOWER BOUNDS FOR A RATIO INVOLVING THE GAMMA FUNCTION
Kershaw, D.
ANALYSIS AND APPLICATIONS, 2005, 3 (03) : 293 - 295
[48] ON UPPER AND LOWER BOUNDS FOR THE VARIANCE OF A FUNCTION OF A RANDOM VARIABLE
CACOULLOS, T
ANNALS OF PROBABILITY, 1982, 10 (03): : 799 - 809
[49] Estimating the Minimum of a Function over the Efficient Set of a MOLP Problem. Some Experiments
Metev, Boyan
Vassilev, Vassil
CYBERNETICS AND INFORMATION TECHNOLOGIES, 2006, 6 (01) : 45 - 57
[50] Upper bounds on the rate of LDPC codes as a function of minimum distance
Ben-Haim, Y
Litsyn, S
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 47 - 51

← 1 2 3 4 5 →