An efficient modification of the primal-dual two paths simplex algorithm

  • Authors:

  • K. Dosios;K. Paparrizos;N. Samaras;A. Sifaleras

  • Affiliations:

  • Dept. of Applied Informatics, University of Macedonia, 156 Egnatia Street, Zip code 540 06, Thessaloniki, Greece;Dept. of Applied Informatics, University of Macedonia, 156 Egnatia Street, Zip code 540 06, Thessaloniki, Greece;Dept. of Applied Informatics, University of Macedonia, 156 Egnatia Street, Zip code 540 06, Thessaloniki, Greece;Dept. of Applied Informatics, University of Macedonia, 156 Egnatia Street, Zip code 540 06, Thessaloniki, Greece

  • Venue:
  • ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Linear programming deals with the problem of minimizing or maximizing a linear function in the presence of linear constraints. The popularity of linear programming can be attributed to many factors such as the ability to model large problems, and the ability to solve large problems in a reasonable amount of time. Lots of real world problems can be formulated as linear programs. The explosion in computational power of hardware has made it possible to solve large-scale linear problems in personal computers.