Numerical Inclusion of Optimum Point for Linear Programming
スポンサーリンク
概要
- 論文の詳細を見る
This paper concerns with the following linear programming problem: \[ \mbox{Maximize } c^tx, \mbox{ subject to } Ax \leqq b \mbox{ and } x\geqq 0, \] where $A \in \F^{m\times n}$, $b \in \F^m$ and $c, x \in \F^n$. Here, $\F$ is a set of floating point numbers. The aim of this paper is to propose a numerical method of including an optimum point of this linear programming problem provided that a good approximation of an optimum point is given. The proposed method is base on Kantorovichs theorem and the continuous Newton method. Kantorovichs theorem is used for proving the existence of a solution for complimentarity equation and the continuous Newton method is used to prove feasibility of that solution. Numerical examples show that a computational cost to include optimum point is about 4 times than that for getting an approximate optimum solution.
論文 | ランダム
- コンテンツ流通制御を考慮したウェブコンテンツ共有システムの実現(ユビキタス時代のインターネット/分散システムの構築・運用技術)(コンテンツ流通・伝送技術)
- 36.石炭チャー水蒸気ガス化における炭素構造の変化と反応性の相関
- IS-026 Massive debris in the intrahepatic bile ducts in choledochal cyst : Possible cause of postoperative stone formation
- 16.石炭高温利用プロセスにおける微量金属の放出挙動
- P2P型ウェブコンテンツ共有における相関性を考慮したキャッシングシステムの実現