The Primal affine scaling algorithm
| dc.contributor.author | Wijerathne, R. G. A. K. | |
| dc.contributor.author | Daundasekera, W. B. | |
| dc.date.accessioned | 2025-11-10T05:47:42Z | |
| dc.date.available | 2025-11-10T05:47:42Z | |
| dc.date.issued | 2005-11-10 | |
| dc.description.abstract | Interior point algorithms are in general used to solve linear programming problems. In this research project we discuss such an interior point algorithm known as Primal Affine Scaling Algorithm CPASA).Unlike the well known simplex algorithm, this particular algorithm search thorough the feasible region to find the optimal solution to the linear programming problem (LPP). The PASA is coded using JAVA object oriented programming language and the algorithm is tested on linear programming problems, where the solution is feasible, infeasible or unbounded. Finally, we analyze the optimal paths taken by the PASA and the simplex algorithm and discuss the advantages and disadvantages of these two algorithms. | |
| dc.identifier.citation | Peradeniya University Research Session (PURSE) -2005, University of Peradeniya, P. 128 | |
| dc.identifier.issn | 1391- 4111 | |
| dc.identifier.uri | https://ir.lib.pdn.ac.lk/handle/20.500.14444/6368 | |
| dc.language.iso | en_US | |
| dc.publisher | University of Peradeniya, Sri Lanka | |
| dc.subject | Mathematics | |
| dc.subject | Primal affine scaling | |
| dc.subject | Algorithm | |
| dc.title | The Primal affine scaling algorithm | |
| dc.type | Article |