Universiti Teknologi Malaysia Institutional Repository

Pendekatan perbandingan cerun untuk pengaturcaraan linear

Majid, Mohd. Yunus and Maarof, Faridah (1990) Pendekatan perbandingan cerun untuk pengaturcaraan linear. Jurnal Teknologi Maklumat, 2 (2). 41-46. ISSN 0128-3790

[img] PDF - Published Version
187kB

Abstract

Linear programming is not a new field in mathematical problem solving. Until today, various methods and approaches have been invented for solving linear programming problems. One of the methods normally used is the revised simplex . For complex problems, solved manually using revised simplex , it requires time and understanding of matrices in addition to its complexity in calculation. At the same time, due to number of iterations that has to be done, the probability of error is high. Consequently, a new method for solving linear programming problems called the Comparison of slopes was designed. Generally, this method makes comparison of the slopes of the constraints and the objective function. As a start, the scope of this study only encompasses problems of two variables.

Item Type:Article
Subjects:Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:32707
Deposited By: Fazli Masari
Deposited On:20 Jun 2013 08:34
Last Modified:01 Nov 2017 12:17

Repository Staff Only: item control page