Methods and applications of error-free computation
Methods and applications of error-free computation
A new polynomial-time algorithm for linear programming
Combinatorica
A variation on Karmarkar's algorithm for solving linear programming problems
Mathematical Programming: Series A and B
Operations research: an introduction, 4th ed.
Operations research: an introduction, 4th ed.
Solving linear programming problems exactly
Applied Mathematics and Computation
| Hi-index | 0.00 |
A physically concise polynomial-time iterative algorithm due to Barnes - a variation of Karmarkar projective transformation algorithm - is presented in Matlab for linear programs Min ct x subject to Ax = b, x ≥ 0. The concerned monotonic convergence of the solution vector and the consequent detection of basic variables are stated. The boundedness of the solution, multiple solutions, and no solution (inconsistency) cases are discussed. The possibility of applying Aitken's δ2 -process to accelerate convergence of the solution vector has been studied taking advantage of monotonic convergence. The effect of degeneracy of the primal linear program and/or its dual on the uniqueness of the optimal solution is mentioned. The foregoing algorithm is implemented in another way based on detection of basic variables and then solving the resulting linear system involving only the basic variables mathematically non-iteratively. The second way of implementation also includes optimality test and is coded in Matlab. It results in less number of iterations and usually more accurate optimal solution. Numerical experiments are carried out on these algorithms considering several typical linear programs and the Matlab implementation of these algorithms is found to be useful for solving many real-world problems.