Programmatic implementation of the karmarkar’s algorithm for vacation package synthesis process optimization
dc.contributor.author | Ganepola, H | |
dc.contributor.author | Padukka, J | |
dc.contributor.author | Prasad, R | |
dc.contributor.author | Samarakoon, L | |
dc.contributor.author | Wimalawame, K | |
dc.contributor.editor | Nanayakkara, V | |
dc.contributor.editor | Gunasinghe, UP | |
dc.date.accessioned | 2022-11-24T09:33:28Z | |
dc.date.available | 2022-11-24T09:33:28Z | |
dc.date.issued | 2009-07 | |
dc.description.abstract | Vacation Packages are a basic component of the modern travel industry. Putting together a set of vacation packages, which can generate the highest revenue to the tour operator, is a hectic task which will need a lot of man hours. In this paper, we present a linear programming approach which ensures the maximum revenue to the tour operator, where all the contract constraints are satisfied. From LP model formulation to the solving algorithm and its results will be presented in this paper. Karmarkar’s Projective Scaling algorithm, which is the solving algorithm will be explained in the process, with its implementation approach | en_US |
dc.identifier.citation | **** | en_US |
dc.identifier.conference | CS & ES Conference 2009 | en_US |
dc.identifier.department | Department of Computer Science and Engineering | en_US |
dc.identifier.faculty | IT | en_US |
dc.identifier.pgnos | pp. 27-33 | en_US |
dc.identifier.place | Colombo, Sri Lanka | en_US |
dc.identifier.proceeding | Proceedings of the CS & ES Conference 2009 | en_US |
dc.identifier.uri | http://dl.lib.uom.lk/handle/123/19589 | |
dc.identifier.year | 2009 | en_US |
dc.language.iso | en | en_US |
dc.publisher | Computer Science & Engineering Society c/o Department of Computer Science and Engineering, University of Moratuwa. | en_US |
dc.title | Programmatic implementation of the karmarkar’s algorithm for vacation package synthesis process optimization | en_US |
dc.type | Conference-Full-text | en_US |