Basic Lemmas in polynomial-time infeasible-interio-point methods for linear programs.
スポンサーリンク
概要
著者
関連論文
- A convex property of monotone complementarity problems.
- Basic Lemmas in polynomial-time infeasible-interio-point methods for linear programs.
- Computational prospects on copositive programming (モデリングと最適化の理論--RIMS研究集会報告集)