학술저널
A Modified Simplex Algorithm for Solving Linear Goal Programming Problems
A Modified Simplex Algorithm for Solving Linear Goal Programming Problems
- 인하대학교 산업경제연구소
- 경상논집
- 연구논문집 제4집
-
1990.0697 - 129 (33 pages)
- 22
커버이미지 없음
This paper presents a modified simplex algorithm for solving linear goal programming problems. As an extension of the Schniederjans-Kwak approach, the technique offers a potential reduction in computational complexity as well as a simultaneous primal-dual relationship. A mathematical justification is presented in this paper along with a numerical exampe. The computer code based on this modified algorithm is also presented.
Ⅰ. Introduction
Ⅱ. A Generalized Linear Goal Programming Problem
Ⅲ. An Illustrative Example
Ⅳ. Summary
REFERENCES
Appendix
Abstract
(0)
(0)