Abstract
Résumé Après un bref aperçu permettant de situer notre travail, nous proposons une nouvelle voie pour aborder la programmation linéaire en proposant un algorithme élaboré à partir d'une idée simple qui permet d'obtenir une solution aussi approchée que voulu par translation dichotomique d'un hyperplan de l'espace des solutions. Abstract After a short course in order to situate our work, we propose a new way to study linear programming and we give a proposal of algorithm to solve linear programming from a basic idea which allow to obtain an approached solution with desired accuracy. For this we use some dichotomic translations of an hyperplan in the solutions hyperspace.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.