The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.

　
英 美
  • 內點(diǎn)法是一種求解線(xiàn)性規劃問(wèn)題的多項式時(shí)間算法,其顯著(zhù)特征是其迭代次數與系統規模關(guān)系不大。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan