선형계획문제의 강성다항식 계산단계 기법에 관한 연구 A Study on the Strong Polynomial Time Algorithm for the Linear Programming

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 772
  • Download : 0
We propose a new dual simplex method using a primal interior point. The dropping variable is chosen by utilizing the primal feasible interior point. For a given dual feasible basis, its corresponding primal infeasible basic vector and the interior point are used for obtaining a decreasing primal feasible point The computation time of moving on interior point in our method takes much less than that od Karmarker-type interior methods. Since any polynomial time interior methods can be applied to our method we conjectured that a slight modification of our method can give a polynomial time complexity.
Publisher
대한산업공학회
Issue Date
1993-11
Language
Korean
Citation

대한산업공학회지, v.19, no.4, pp.3 - 11

ISSN
1225-0988
URI
http://hdl.handle.net/10203/65750
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0