New algorithms for linear programming

The problem of solving a linear programming is converted into that of solving an unconstrained maximization problem in which the objective function is concave. Two algorithms are proposed. These two algorithms have very simple structure and can be implemented easily. For any given precision, the algorithms will terminate in a finite number of steps.