Name
Mazhura Victoria Mihailovna
Scholastic degree
—
Academic rank
—
Honorary rank
—
Organization, job position
Kuban State Agrarian University
Web site url
—
—
Articles count: 2
The article presents the decision of the task of the
linear programming. The basic methods of decision
of this type of tasks are considered in the article.
Every method has been characterized. Modern
practice shows that this type of tasks and methods of
his decision are widespread. The problem of decision
of this type of tasks remains very actual and
presently, although development of methods of
decision of tasks of optimization got most
development in the middle of the twentieth century.
This question is important for not only major and
shallow concerns and organizations, in industrial
situations, but, as well, for all the members of social
and economical relations. The example of decision of
task of the linear programming is examined in the
article; actuality of the studied problem is grounded.
Description of each of the applied methods of
decision was presented. In connection with wide
development of information technologies, a lot of
attention has been paid to the decision of task by
means of computer calculations. The brought task
and the charts illustrate all the importance of the
studied problem evidently, on the example of small
workshop possessing limited resources. On the basis
of the obtained data, we have drawn a conclusion
The presented article is devoted to solving problems
using the simplex method with artificial basis.
Simplex method with artificial basis is used when
quite difficult to find initial support program of the
initial problem of linear programming, written in
canonical form. The presented method is used in the
presence of solutions to the system of restrictions and
conditions, equations, inequalities and conditions, as
well as a transformation table method. The
calculation of the system is carried out by introducing
artificial variables Ri with the sign of which depends
on the type of the optimum, to remove from the basis
of these variables are introduced in the last objective
function with negative coefficients M that are
"mulct" for putting artificial variables. Simplex table,
which is made in the process of decision, using the
method of artificial basis, called extended. It differs
from the conventional in that it comprises two lines
of the objective function. In minimization problems -
with positive M. Hence, from the original one we
have already obtained the new M -problem. If in the
optimal solution M-problem has no artificial
variables, this decision will be the optimal solution of
the original problem. But, if in the optimal solution
M-tasks at least one dummy variable is different from
zero, the system of constraints of this problem and
have inconsistent problem is unsolvable