J.Clausen, "On the feasibility of the Edmonds-Fukuda pivoting rule", European Journal of Operation Research, 29 (1987) 378-383.  Home/Search   Document Not in Database   Summary   Related Articles

....can be interpreted as a special implementation of algorithm GA. 4 A generalization of Edmonds Fukuda rule for QP Edmonds Fukuda [12] pivoting rule was originally designed for OM LP, and it was presented for LP by Edmonds in 1982, at the Mathematical Programming Symposium in Bonn. Later Clausen [8] proved that it is a nite simplex method in the linear programming case. For oriented matroids Jensen [14] gave an example that proves that EdmondsFukuda rule is not a simplex method (that is not feasible) on oriented matroids. The Van de Panne Whinston [31] method for QP is considered as a ....

....The number of subsequent steps 2b.1. is at most jF j, so after at most jF j steps index vector I has to be increased lexicographically again. 2 Proposition 4.2. Algorithm (F) is feasible. preserves primal feasibility) Proof: Left to the reader. The same steps and arguments can be used as in [8,9]. 2 Since Algorithm (F) is nite and feasible so it is a nite version of Van de Panne Whinston [31] algorithm, and it can be proved that the primal objective monotonically improves through the procedure. Proposition 4.3. Algorithm (F) is a special implementation of Algorithm (GA) Proof: The ....

J.Clausen, "On the feasibility of the Edmonds-Fukuda pivoting rule", European Journal of Operation Research, 29 (1987) 378-383.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC