The problem of linear programming is a to determine the magnitude value each variable so that objective function or can be optimum, namely by maximizing minimizing. To solve problems, mixed method used, combines two methods at once, elimination and substitution method. eliminates variables adding subtracting equations have same coefficient. While replacement with from another equation.

We propose a simple privacy-preserving reformulation of a linear program with inequality constraints and nonnegativity constraints. By employing two random matrix transformation we construct a secure linear program based on the privately held data without revealing that data. The secure linear program has the same minimum value as the original linear program. Component groups of the solution of...

An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such probl...