A SOLVING METHOD OF TWO ECONOMICAL PROBLEMS USING LINEAR PROGRAMMING IN INTEGER NUMBERS
Catalin Angelo Ioan ()
EuroEconomica, 2008, issue 2(21), 49-53
In this paper we shall give a new solution for the optimal assignation of workers on jobs from the point of view of execution total time minimization using the Simplex algorithm which can solve the problem using computers instead the known Little’s solution. In the second section, we shall give a new solution for the optimal assignation of workers on jobs from the point of view of maximize the number of allocates workers, using the Simplex algorithm which can solve the problem using computers instead the known graphical solution.
Keywords: Simplex; assignation; minimization (search for similar items in EconPapers)
References: Add references at CitEc
Citations Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:dug:journl:y:2008:i:2:p:49-53
Access Statistics for this article
More articles in EuroEconomica from Danubius University of Galati Contact information at EDIRC.
Bibliographic data for series maintained by Florian Nuta ().