{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T07:09:56Z","timestamp":1721113796040},"reference-count":32,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,1]]},"abstract":"<p>Linear programming algorithms have been widely used in Decision Support Systems. These systems have incorporated linear programming algorithms for the solution of the given problems. Yet, the special structure of each linear problem may take advantage of different linear programming algorithms or different techniques used in these algorithms. This paper proposes a web-based DSS that assists decision makers in the solution of linear programming problems with a variety of linear programming algorithms and techniques. Two linear programming algorithms have been included in the DSS: (i) revised simplex algorithm and (ii) exterior primal simplex algorithm. Furthermore, ten scaling techniques, five basis update methods and eight pivoting rules have been incorporated in the DSS. All linear programming algorithms and methods have been implemented using MATLAB and converted to Java classes using MATLAB Builder JA, while the web interface of the DSS has been designed using Java Server Pages.<\/p>","DOI":"10.4018\/ijdsst.2014040103","type":"journal-article","created":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T17:40:22Z","timestamp":1424972422000},"page":"46-62","source":"Crossref","is-referenced-by-count":1,"title":["A Decision Support System for Solving Linear Programming Problems"],"prefix":"10.4018","volume":"6","author":[{"given":"Nikolaos","family":"Ploskas","sequence":"first","affiliation":[{"name":"Department of Applied Informatics, University of Macedonia, Thessaloniki, Greece"}]},{"given":"Nikolaos","family":"Samaras","sequence":"additional","affiliation":[{"name":"Department of Applied Informatics, University of Macedonia, Thessaloniki, Greece"}]},{"given":"Jason","family":"Papathanasiou","sequence":"additional","affiliation":[{"name":"Department of Business Administration, University of Macedonia, Thessaloniki, Greece"}]}],"member":"2432","reference":[{"key":"ijdsst.2014040103-0","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-9978(02)00037-6"},{"key":"ijdsst.2014040103-1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584344"},{"key":"ijdsst.2014040103-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2005.07.002"},{"key":"ijdsst.2014040103-3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.2.103"},{"key":"ijdsst.2014040103-4","unstructured":"Dantzig, G. B. (1953). Computational Algorithm of the Revised Simplex Method. RAND Report RM-1266, The RAND Corporation, Santa Monica, CA."},{"key":"ijdsst.2014040103-5","author":"G. B.Dantzig","year":"1963","journal-title":"Linear Programming and Extensions"},{"key":"ijdsst.2014040103-6","doi-asserted-by":"publisher","DOI":"10.2307\/2001993"},{"key":"ijdsst.2014040103-7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1998.726698"},{"key":"ijdsst.2014040103-8","unstructured":"G\u00e4rtner, B. (1995). Randomized optimization by Simplex-type methods. Doctoral dissertation, Freie Universit\u00e4t, Germany."},{"key":"ijdsst.2014040103-9","first-page":"10","article-title":"Electronic mail distribution of linear programming test problems.","volume":"13","author":"D. M.Gay","year":"1985","journal-title":"Math. Program. Soc. COAL News"},{"key":"ijdsst.2014040103-10","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(97)00009-1"},{"key":"ijdsst.2014040103-11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01593804"},{"key":"ijdsst.2014040103-12","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.14.4.295"},{"key":"ijdsst.2014040103-13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589349"},{"key":"ijdsst.2014040103-14","article-title":"How Good is the Simplex Algorithm","author":"V.Klee","year":"1972","journal-title":"Inequalities \u2013 III"},{"key":"ijdsst.2014040103-15","unstructured":"Lappi, J., Nuutinen, T., & Siitonen, M. (1996). A linear programming software for multilevel forest management planning. In Management systems for a global economy with global resource concerns, 470-482. Proceedings of the symposium on system analysis in forest resources. Pacific Grove, CA."},{"key":"ijdsst.2014040103-16","doi-asserted-by":"publisher","DOI":"10.1080\/02331939308843895"},{"key":"ijdsst.2014040103-17","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(94)90052-3"},{"key":"ijdsst.2014040103-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.08.001"},{"key":"ijdsst.2014040103-19","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.3.3.255"},{"key":"ijdsst.2014040103-20","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00072-3"},{"key":"ijdsst.2014040103-21","unstructured":"Mavrotas, G. (2000). Multiple Objective Linear Programming under Uncertainty: Development of a DSS and Application in Energy Planning. Unpublished doctoral dissertation, National Technical University of Athens, Greece."},{"key":"ijdsst.2014040103-22","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.12.3.183"},{"key":"ijdsst.2014040103-23","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00400-9"},{"key":"ijdsst.2014040103-24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41077-2_8"},{"key":"ijdsst.2014040103-25","first-page":"27","article-title":"Web-based and model-driven decision support systems: concepts and issues.","volume":"Vol. 3","author":"D. J.Power","year":"2000","journal-title":"Americas Conference on Information Systems"},{"issue":"4","key":"ijdsst.2014040103-26","first-page":"291","article-title":"Building Web-based decision support systems.","volume":"11","author":"D. J.Power","year":"2002","journal-title":"Studies in Informatics and Control"},{"key":"ijdsst.2014040103-27","author":"M. E.Thomadakis","year":"1994","journal-title":"Implementation and Evaluation of Primal and Dual Simplex Methods with Different Pivot-Selection Techniques in the LPBench Environment A Research Report"},{"key":"ijdsst.2014040103-28","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120718"},{"key":"ijdsst.2014040103-29","doi-asserted-by":"publisher","DOI":"10.1111\/1475-3995.00276"},{"key":"ijdsst.2014040103-30","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(91)90083-J"},{"key":"ijdsst.2014040103-31","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/crmp\/048\/07","article-title":"What is the worst case behavior of the simplex algorithm.","volume":"48","author":"N.Zadeh","year":"1980","journal-title":"Polyhedral Computation"}],"container-title":["International Journal of Decision Support System Technology"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=123994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:36:18Z","timestamp":1654130178000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijdsst.2014040103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,4,1]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdsst.2014040103","relation":{},"ISSN":["1941-6296","1941-630X"],"issn-type":[{"value":"1941-6296","type":"print"},{"value":"1941-630X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,1]]}}}