The (minimizing) achievement function of the traditional Goal Programming (GP) model has five basic forms: n(i), p(i), (n(i)+p(i)), (n(i)-p(i)), and (p(i)-n(i)), where n(i) and p(i) are nonnegative under and over achi...
详细信息
ISBN:
(纸本)9781424436705
The (minimizing) achievement function of the traditional Goal Programming (GP) model has five basic forms: n(i), p(i), (n(i)+p(i)), (n(i)-p(i)), and (p(i)-n(i)), where n(i) and p(i) are nonnegative under and over achievement variables in the i(th) goal-constraint. Zhang and Shang (2001) proposed the theory of Coal Programs with -n(i), -p(i), and -(n(i)+p(i)) 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.
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 t...
详细信息
ISBN:
(纸本)9781424436712
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.
The (minimizing) achievement function of the traditional goal programming (GP) model has five basic forms: n(i), p(i), (n(i) + p(i)), (n(i) - p(i)), and (p(i) - n(i)), where n(i) and p(i) are nonnegative under and ove...
详细信息
The (minimizing) achievement function of the traditional goal programming (GP) model has five basic forms: n(i), p(i), (n(i) + p(i)), (n(i) - p(i)), and (p(i) - n(i)), where n(i) and p(i) are nonnegative under and over achievement variables in the ith goal-constraint. This paper proposes and justifies three new objective-function forms: -n(i), -p(i), and (n(i) +p(i)) and presents an algorithm for solving the ensuing nonconvex program. We also introduce the intuitive concepts of the supposed indifference satisfactory interval (SISI), and the supposed indifference dissatisfactory interval (SIDI). We believe that these concepts will help the decision maker understand the different objective-function forms. (C) 2001 Elsevier Science B.V. All rights reserved.
暂无评论