FOREWORD

We thank God for the Almighty God for His blessings and mercy so
that we can compile a paper "the primal simplex method with artificial
variables". We thank the LINEAR PROGRAM lecturers for guiding us to
complete this paper. Lastly we thank friends and all those who have helped in
the discussion to complete this paper. We hope this paper can help in
completing the tasks or work we do.

Medan, 02 October 2018

Group 4
 CHAPTER I PRELIMINARY

1. BACKGROUND
Solving linear programming (LP) problems in which some constrains are in (≥)
form, where the right hand side (RHS) is nonnegative or in (=) form, has been difficult since
the biginning of LP. One version of the simplex method, known as the two phase method ,
introduces an artificial objective function, which is the sum of the artificial variables. The
other version ( the big M method) adds penalty terms , which are the sum of artificia
variables with very large positive coefficients. Using the dual simplex method has its own
difficulties. For exampel, when some coefficients in the objective function are not dual
feasible, one must introduce an artificial constraint. Also, handing (=) constraints is very
tedious.
One of the techniques for determining the optimal solution used in linear
programming is the simplex method. Determining the optimal solution using the simplex
method is based on the Gauss Jordan elimination technique. Determining the optimal solution
is done by checking the extreme points one by one starting with a feasible basic (PDF)
completion and if the PDF is not an optimal solution then another better PDF will be searched
by an iterative calculation. So that the determination of the optimal solution with simplex is
done step by step called iteration. The iteration depends only on the previous iteration.
In the present time LP problems that involve many decison variables can be quickly
solved by decison variables can be quickly solved with the help of a computer. If the decision
variable contained is not too much the problem can be solved by an algorithm which is
usually called the simplex table method. So called because the optimal combination of
decision variables is searched using tables.

2. Problems formulation
 How to determine the basic framework for calculating the minimum value of a
simplex table?
 How to design an initial program that only consists of variables "artificial
slack"?
 How do students improve the initial program and subsequent programs until a
minimum program is achieved?

3. Purpose

This paper purpose a new general solution algorithm which is easy to understand and
free from any extraneous surplus/slack variables, artificial variables, artificial objection
functions, or artificial constraints.
 CHAPTER II DISCUSSION

The Primal Simplex Method With Artificial Variable

1. Standar Form
 CHAPTER III CLOSING

1. CONCLUSION
Our goal has been to present an intuitive theoretical unification with the simplex
method, a broad simplification, and an advance in classroom teachig. When the starting
conditions of simplex are satisfied constraints are in ≤ form, with RHS≥ , our algorithm
becomes exactly the same as simplex. However , it provides further simplicity and efficiency,
even for this case . it also serves as a good tutorial, since it can be presented as a natural
generalization of the simplex method.

2. SUGGESTION
The author is aware of the preparation of papers, of course there are still many errors
and shortcomings, because of the limited knowledge and lack of references or references that
have to do with the title of this paper. The author hopes that many wise readers will give
criticism and suggestions that build on the author for the sake of perfect this paper and the
writing of papers in subsequent opportunities. Hopefully this paper is useful for writers in
particular as well as good readers in general.