A solving method of two economical problems using linear programming in integer numbers
EuroEconomica
View Archive InfoField | Value | |
Title |
A solving method of two economical problems using linear programming in integer numbers
|
|
Creator |
Ioan, Catalin Angelo; Danubius University of Galati
|
|
Subject |
Simplex; assignation; minimization
— |
|
Description |
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.
|
|
Publisher |
Danubius University of Galati, Romania
|
|
Contributor |
—
|
|
Date |
2010-04-27
|
|
Type |
Peer-reviewed Article
|
|
Format |
application/pdf
|
|
Identifier |
http://journals.univ-danubius.ro/index.php/euroeconomica/article/view/289
|
|
Source |
EuroEconomica; Vol 21, No 2 (2008)
|
|
Language |
en
|
|
Rights |
The author fully assumes the content originality and the holograph signature makes him responsible in case of trial.
|
|