A Computer Program for Solving LP Problems by 2-Basic Variables Replacement at Each Simplex Iteration
نویسندگان
چکیده
In this paper, we develop a computer technique to implement the existing 2-basic variable replacement method of Paranjape for solving linear programming (LP) problems. To our knowledge there is no such computer oriented program which implemented Paranjape’s method. Our computer oriented program is a faster method for solving linear programs. A number of numerical examples are illustrated to demonstrate our algorithm.
منابع مشابه
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Parity games form an intriguing family of infinitary payoff games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of mean and discounted payoff games, which in turn are very natural subclasses of turn-based stochastic payoff games. From a theoretical point of view, solving these games is one...
متن کاملPerformance Analysis of the Simplex Method on OpenCL Hardware Accelerators
This work proposes an energy-efficient hardware accelerated Linear Programming (LP) solver. The system is based on the Simplex Algorithm for solving LP problems and is operable on Field Programmable Gate Arrays (FPGAs), Graphic Processing Units (GPUs), and Multi-Core Computer Processors (CPUs). The system is targeted towards the dense problems in radiotherapy applications as they represent a ch...
متن کاملA Strongly Polynomial Simplex Method for Totally Unimodular LP
Kitahara and Mizuno get new bounds for the number of distinct solutions generated by the simplex method for linear programming (LP). In this paper, we combine results of Kitahara and Mizuno and Tardos’s strongly polynomial algorithm, and propose an algorithm for solving a standard form LP problem. The algorithm solves polynomial number of artificial LP problems by the simplex method with Dantzi...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA parallel implementation of an exterior point algorithm for linear programming problems
The simplex method is perhaps the most widely used method for solving linear programming (LP) problems. The computation time of simplex type algorithms depends on the basis inverse that occurs in each iteration. Parallelizing simplex type algorithms is one of the most challenging problems. The aim of this paper is to present a parallel implementation of the primal exterior point simplex algorit...
متن کامل