REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING

スポンサーリンク

概要

• 論文の詳細を見る

• We will point out some relations between potential and barrier function methods for linear programming. Then, based on the relations, we will show that the classical logarithmic barrier function method for linear programming can be adjusted so that it generates the optimal solution in O(√<n>L) iterations, where n is the number of variables and L is the data length. The method can be seen as a barrier function version of Ye's "An O(n^3L) potential reduction algorithm for linear programming".

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Tone K

  National Graduate Inst. Policy Studies

• Tone Kaoru

  Graduate School of Policy Science Saitama University

• Tone Kaoru

  Graduate School Of Polecy Science Saitama University

関連論文

• REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING
• AN ε-FREE DEA AND A NEW MEASURE OF EFFICIENCY
• A SIMPLE CHARACTERIZATION OF RETURNS TO SCALE IN DEA

スポンサーリンク