Pendekatan Komputasi untuk Pemilihan Elemen Pivot dalam Persoalan Relaksasi Program Linier

Abstract

Modification according to election criterion of pivot can increase algorithm, like the one is done by Dantzig in election of pivot based on by strategy in linear programming. In this research, submitted a number of strategies for election of pivot at relaxation linier programming. Result of research is obtained by degradation signifikan in number iteration for with refer to problem. Linear Programming include; covers planning of activities to obtain a optimum result, that is a expressing result reachs of best certain target based on mathematical model between alternative that is possible by using linear function. Simplex method is one of way of finalize linear program. Relaxation linear programming is linear program yielded by eliminating clauses of integer for decision variable. Calculation of simplex method in this research applies computer auxiliaries through Excel Program.