일반화된 선형/목표계획법의 마이크로컴퓨터용 소프트웨어 개발

Software Development of Generalized Linear/Goal Programming for Microcomputer

The propose of this study is to presnet a generalized linear/goal programming software, which has been developed to run on mickrocomputers with at least 512 K bytes of memory. The main characteristics of our algorithm for solving LP/GP problems are outlined as follows ; First, it uses the revised simplex algorithm, which is the most efficient computational procedure for computers. Second, it employs the sparse matrix technique to overcome the limited memory of microcomputers. Last, it uses the modified product form of invers (MPFI) to reduce round-off errors. The test runs with our code written in FORTRAN show that it can be used as an effective tool for solving linear/goal programming problems of considerable size.