scientific article; zbMATH DE number 4020859
Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design an interactive software package for microcomputers based on this method. From some computational experience, we can state that the revised iterative goal simplex and method using the sparsity technique is the most efficient one for microcomputers for solving goal programming problems.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763907)