Nonlinear Goal Programming with -ni-pi and -(ni+pi) Goals
The (minimizing) achievement function of the traditional Goal Programming (GP) model has five basic forms: ni,pi,(ni+pi),(n-pi),and (pi-ni),where ni and pi are nonnegative under and over achievement variables in the ith goal-constraint. Zhang and Shang (2001) proposed the theory of Goal Programs with -ni,-pi and -(ni+pi) goals, which has many interesting and practical applications. This paper extends the theory further into the nonlinear situation and proposes a new algorithm for solving the ensuing nonconvex nonlinear program. Results obtained in this paper shows that the basic conclusions for the linear GP model still hold for the nonlinear case.
Nonlinear Goal Programming Nonconvez Goal Programming Multiobjective Algorithm
Zhiyong Zhang Shanlin Yang Xinbao Liu Jen S.Shang Jianbo Yang
Management School,Hefei University of Technology,Hefei 230009,Anhui Province,P.R.China Logistics Sch Management School,Hefei University of Technology,Hefei 230009,Anhui Province,P.R.China Joseph M.Katz Graduate School of Business,University of Pittsburgh,Pittsburgh,PA 15260,USA Manchester Business School (East),University of Manchester,Manchester M15 6PB,UK
国际会议
北京
英文
894-898
2009-10-21(万方平台首次上网日期,不代表论文的发表时间)