24x7 Service; AnyTime; AnyWhere

Optimization of a multiobjective programming problem

Lim, Kong Teong (1999) Optimization of a multiobjective programming problem. Analisis, 6 (1&2). pp. 27-42. ISSN 0127-8983

[thumbnail of Lim_Kong_Teong.pdf]
Download (1MB) | Preview
Official URL:


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.

Item Type: Article
Uncontrolled Keywords: multiobjective programming, global optimization technique, controlled random search
Subjects: Q Science > QA Mathematics
Divisions: College of Business
Depositing User: Mrs. Norazmilah Yaakub
Date Deposited: 04 Jul 2010 04:35
Last Modified: 04 Jul 2010 04:35

Actions (login required)

View Item View Item