A Modified Simplex Algorithm for Solving Linear Goal Programming Problems

• 영문명: A Modified Simplex Algorithm for Solving Linear Goal Programming Problems
• 발행기관: 인하대학교 산업경제연구소
• 저자명: 최태성(Tae-Sung Choi)
• 간행물 정보: 『경상논집』연구논문집 제4집, 97~129쪽, 전체 33쪽
• 주제분류: 경제경영 > 경제학
• 파일형태: PDF
• 발행일자: 1990.06.01

영문 초록

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