(A) non-edge-following method for linear programming problems線型計劃法을 위한 非頂變形解法

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 377
  • Download : 0
This thesis presents a non edge-following algorithm for solving linear programming problems. Unlike simplex algorithm, this algorithm requires as its initial solution a dual feasible solution which is not necessarily a basic solution. Convergence condition of this algorithm is investigated. Perturbation method as a resolution of cycling is developed. Results of test runs with 25 randomly generated problems are presented.
Advisors
Ahn, Byong-Hunresearcher안병훈researcher
Description
한국과학기술원 : 경영과학과,
Publisher
한국과학기술원
Issue Date
1982
Identifier
63521/325007 / 000801121
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 경영과학과, 1982.2, [ [ii], 41, [2] p. ]

URI
http://hdl.handle.net/10203/44605
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=63521&flag=dissertation
Appears in Collection
MG-Theses_Master(석사논문)
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