The (minimizing) achievement function of the traditional goalprogramming (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 goalprogramming (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.
暂无评论