We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
A PIVOTING RULE THAT REDUCES TOTAL INFEASIBILITY FOR LINEAR PROGRAMMING.
- Authors
Xinjian Lu
- Abstract
This research presents a new pivoting rule for solving linear programming problems. The simplex method involves searching among the basic and primal-feasible solutions without leaving the primal-feasible region. Our pivoting rule focuses on reducing the absolute value of the sum of primal infeasibility and dual infeasibility as much as possible in every pivoting iteration. Entering and leaving variables are selected according to this criterion. The new pivoting rule requires neither primal nor dual feasibility to start the search process, and may very well pivot into a basic solution that is neither primal-feasible nor dual-feasible. This method appears to take fewer iterations to reach the optimal solution than the simplex method for the linear programming problems in our empirical studies. An example is given to illustrate the method. The efficiency and convergence of the new pivoting rule are subjects of future research.
- Subjects
PRODUCTION scheduling; NONLINEAR programming; DYNAMIC programming; FEASIBILITY studies; MATHEMATICAL programming
- Publication
Journal of International Management Studies, 2013, Vol 13, Issue 4, p61
- ISSN
1930-6105
- Publication type
Article
- DOI
10.18374/jims-13-4.7