AN ITERATION METHOD FOR NONLINEAR PROGRAMMING PROBLEMS : II

スポンサーリンク

概要

• 論文の詳細を見る

• This note proposes a simple and practical iteration method for finding a local minimum of a nonlinear programming problem with inequality and equality constraints. The iteration method seeks a point which satisfies the Kuhn-Tucker conditions. It can be shown that the sequence of points generated by the iteration method converges to the local optimal solution.

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

著者

• Noda Tatsuo

  Department Of Applied Mathematics Toyama College Of Technology

• MINE HISASHI

  Department of Applied Mathematics and Physics, Faculty of Engineering Kyoto University

• OHNO KATSUHISA

  Department of Applied Mathematics and Physics, Faculty of Engineering Kyoto University

• Mine Hisashi

  Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University

• Ohno Katsuhisa

  Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University

関連論文

• AN ITERATION METHOD FOR NONLINEAR PROGRAMMING PROBLEMS : II
• AN ITERATION METHOD FOR NONLINEAR PROGRAMMING PROBLEMS
• ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
• The Three-Dimensional Bin Packing Problem and Its Practical Algorithm(Advanced Production Scheduling)
• A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
• AN ASSIGNMENT PROBLEM ON A NETWORK
• MARGINAL CHECKING OF A MARKOVIAN DEGRADATION UNIT WHEN CHECKING INTERVAL IS PROBABILISTIC

スポンサーリンク