A Solving Method Of Two Economical Problems Using Linear Programming In Integer Numbers
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Danubius University of Galati in its journal Euroeconomica.
Volume (Year): (2008)
Issue (Month): 2(21) (December)
Simplex; assignation; minimization;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Florian Nuta).
If references are entirely missing, you can add them using this form.