文档介绍：Non-linear Goal Programming Using Multi-Objective ic Algorithms
Kalyanmoy Deb
Kanpur ic Algorithms laboratory (KanGAL)
Department of Mechanical Engineering
Indian Institute of Technology, Kanpur
Kanpur, PIN 208 016, India
E-mail: ******@
Technical Report No. CI-60/98
October 1998
Department puter Science/XI
University of Dortmund, Germany
Abstract
Goal programming is a technique often used in engineering design activities primarily to find -
promised solution which will simultaneously satisfy a number of design goals. In solving goal program-
ming problems, classical methods reduce the multiple goal-attainment problem into a single objective of
minimizing a weighted sum of deviations from goals. Moreover, in tackling non-linear goal programming
problems, classical methods use essive linearization techniques, which are sensitive to the chosen
starting solution. In this paper, we pose the goal programming problem as a multi-objective optimization
problem of minimizing deviations from individual goals. This procedure eliminates the need of having ex-
tra constraints needed with classical formulations and also eliminates the need of any user-defined weight
factor for each goal. The proposed technique can also solve goal programming problems having non-
convex trade-off region, which are difficult to solve using classical methods. The efficacy of the proposed
method is demonstrated by solving a number of non-linear test problems and by solving an engineering
design problem. The results suggest that the proposed approach is an unique, effective, and most practical
tool for solving goal programming problems.
Keywords: Goal programming, ic algorithms, Engineering design
1 Introduction
Developed in the year 1955, goal programming method has enjoyed innumerable applications in engineering
design activities
. Goal programming is different in concept from non-linear programming or optimization
techniques in tha