Optimization of a multiobjective programming problem
The purpose of this paper is to suggest the use of the Generalized Distance Approach in the field of multiobjective programming to find "compromising" conditions on the decision variables that will give a "near" optimal value for each of the objectives. A global optimization tech...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Universiti Utara Malaysia
1999
|
| 主題: | |
| 在線閱讀: | http://repo.uum.edu.my/120/1/Lim_Kong_Teong.pdf http://repo.uum.edu.my/120/ http://ijms.uum.edu.my |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Universiti Utara Malaysia |
| 語言: | English |
| id |
my.uum.repo.120 |
|---|---|
| record_format |
eprints |
| spelling |
my.uum.repo.1202010-07-04T04:35:28Z http://repo.uum.edu.my/120/ Optimization of a multiobjective programming problem Lim, Kong Teong QA Mathematics The purpose of this paper is to suggest the use of the Generalized Distance Approach in the field of multiobjective programming to find "compromising" conditions on the decision variables that will give a "near" optimal value for each of the objectives. A global optimization technique called the Controlled Random Search (CRS)procedure has been used to minimize the distance function derived from the Generalized Distance Approach. It is numerically shown that this approach works well in solving multiobjective optimization problems. Universiti Utara Malaysia 1999 Article PeerReviewed application/pdf en http://repo.uum.edu.my/120/1/Lim_Kong_Teong.pdf Lim, Kong Teong (1999) Optimization of a multiobjective programming problem. Analisis, 6 (1&2). pp. 27-42. ISSN 0127-8983 http://ijms.uum.edu.my |
| institution |
Universiti Utara Malaysia |
| building |
UUM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Utara Malaysia |
| content_source |
UUM Institutionali Repository |
| url_provider |
http://repo.uum.edu.my/ |
| language |
English |
| topic |
QA Mathematics |
| spellingShingle |
QA Mathematics Lim, Kong Teong Optimization of a multiobjective programming problem |
| description |
The purpose of this paper is to suggest the use of the Generalized Distance Approach in the field of multiobjective programming to find "compromising" conditions on the decision variables that will give a "near" optimal value for each of the objectives. A global optimization technique called the Controlled Random Search (CRS)procedure has been used to minimize the distance function derived from the Generalized Distance Approach. It is numerically shown that this approach works well in solving multiobjective optimization problems. |
| format |
Article |
| author |
Lim, Kong Teong |
| author_facet |
Lim, Kong Teong |
| author_sort |
Lim, Kong Teong |
| title |
Optimization of a multiobjective programming problem |
| title_short |
Optimization of a multiobjective programming problem |
| title_full |
Optimization of a multiobjective programming problem |
| title_fullStr |
Optimization of a multiobjective programming problem |
| title_full_unstemmed |
Optimization of a multiobjective programming problem |
| title_sort |
optimization of a multiobjective programming problem |
| publisher |
Universiti Utara Malaysia |
| publishDate |
1999 |
| url |
http://repo.uum.edu.my/120/1/Lim_Kong_Teong.pdf http://repo.uum.edu.my/120/ http://ijms.uum.edu.my |
| _version_ |
1644277698006089728 |