merged

Comparison between Karmarkar’s Method and Simplex Method
in Linear Programming.
Nurul Syafieqal Amira Binti Mohd Sidi
Supervisor: Dr. Nur Fadhilah Binti Ibrahim
Bachelor of Science (Computational Mathematics)
School of Informatics and Applied Mathematics
Linear Programming is mathematical technique that has been used in modelling to
achieve maximum profit or minimum cost in many problems that happen around us. A
business field is one of the example. Every company’s goal is to obtain profit in sales of
their product. To achieve the goal, we have to minimize the raw material of a product
while getting the maximum profit. In this research, Karmarkar’s Method and Simplex
Method had been used to find the most efficient and accurate optimal solution to solve
this kind of problem. The result has shown that, Karmarkar’s method is suitable to be
used for large linear programming while Simplex Method is suitable for simple problem.
995 | UMT UNDERGRADUATE RESEARCH DAY 2018