سال انتشار: ۱۳۸۴

محل انتشار: چهارمین کنفرانس ملی مهندسی صنایع

تعداد صفحات: ۷

نویسنده(ها):

Yahia Zare – Department of Industrial Engineering Yazd University Yazd, Iran

چکیده:

Typically, due to transformation of a probabilistic constraint into an equivalent deterministic form (EDF), a nonlinear constrained generates. The effectiveness of a linearly approximated goalprogramming (GP) model representing such a nonlinear goal program is the topic of this article. The
goodness and efficiency of a proposed iterative solution technique for solving this special class of nonlinear goal programming (NGP) problem in a finite number of iterations is discussed. The proposed computer algorithm is tested and verified by experimenting on classical chanceconstrained goal programming (CCGP) problems.