ms·1978년 4월 1일
Note—An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination
Jeffrey L. Arthur, A. Ravindran
Management Science
56
피인용
5.0
FWCI
0
IS/마케팅/OM 탑저널 피인용
1
IS/마케팅/OM 탑저널 참고문헌
- 주제수리최적화 알고리즘 · 생산·최적화
01Abstract
An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive factors in the objective function inherent in most goal programming formulations. Preliminary results indicate that the partitioning algorithm is superior to the existing methods for solving goal programming problems.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 24(8) · 867–868
- 토픽Optimization and Mathematical Programming · Control and Systems Engineering
- DOI10.1287/mnsc.24.8.867
- 저자Jeffrey L. Arthur, A. Ravindran