The simplest polynomial times algorithm for linear programming. - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

The simplest polynomial times algorithm for linear programming.

Résumé

This paper introduces a simple and straightforward algorithm for linear programming. Only self concordant theory and basic linear algebra are required to prove the convergence and the polynomial times complexity.
Fichier principal
Vignette du fichier
simplest_polynomial_algorithm.pdf (286.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00722920 , version 1 (06-08-2012)
hal-00722920 , version 2 (04-09-2013)
hal-00722920 , version 3 (04-09-2013)
hal-00722920 , version 4 (11-09-2013)
hal-00722920 , version 5 (01-12-2013)
hal-00722920 , version 6 (26-12-2013)
hal-00722920 , version 7 (20-06-2015)
hal-00722920 , version 8 (12-09-2018)
hal-00722920 , version 9 (17-01-2019)
hal-00722920 , version 10 (07-02-2019)
hal-00722920 , version 11 (15-03-2019)
hal-00722920 , version 12 (25-03-2019)
hal-00722920 , version 13 (12-04-2019)
hal-00722920 , version 14 (28-04-2019)
hal-00722920 , version 15 (12-05-2019)
hal-00722920 , version 16 (05-07-2019)
hal-00722920 , version 17 (23-07-2019)
hal-00722920 , version 18 (16-08-2019)
hal-00722920 , version 19 (02-09-2019)
hal-00722920 , version 20 (07-10-2019)
hal-00722920 , version 21 (19-11-2019)
hal-00722920 , version 22 (20-11-2019)
hal-00722920 , version 23 (20-12-2019)
hal-00722920 , version 24 (11-01-2020)
hal-00722920 , version 25 (20-01-2020)
hal-00722920 , version 26 (02-02-2020)
hal-00722920 , version 27 (11-02-2020)
hal-00722920 , version 28 (26-03-2020)
hal-00722920 , version 29 (17-07-2020)
hal-00722920 , version 30 (05-08-2020)
hal-00722920 , version 31 (12-10-2020)
hal-00722920 , version 32 (14-12-2020)
hal-00722920 , version 33 (02-02-2021)
hal-00722920 , version 34 (03-05-2021)
hal-00722920 , version 35 (07-07-2021)
hal-00722920 , version 36 (19-12-2021)
hal-00722920 , version 37 (17-02-2022)
hal-00722920 , version 38 (16-01-2023)

Identifiants

  • HAL Id : hal-00722920 , version 30

Citer

Adrien Chan-Hon-Tong. The simplest polynomial times algorithm for linear programming.. 2020. ⟨hal-00722920v30⟩
888 Consultations
1099 Téléchargements

Partager

Gmail Facebook X LinkedIn More