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:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia
1999
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/120/1/Lim_Kong_Teong.pdf http://repo.uum.edu.my/120/ http://ijms.uum.edu.my |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Utara Malaysia |
| Language: | English |
| Summary: | 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. |
|---|