返回Google圖書搜尋

On the Feasibility of a Generalized Linear Program

Hu HuiStanford University. Systems Optimization Laboratory

出版	Stanford University, Department of Operations Research, Systems Optimization Laboratory, 1989
URL	http://books.google.com.hk/books?id=PfQEAAAAIAAJ&hl=&source=gbs_api

註釋Abstract: "The first algorithm for solving generalized linear programs was given by George B. Dantzig. His algorithm assumes that a basic feasible solution of the generalized linear program to be solved exists and is given. If the initial basic feasible solution is non-degenerate, then his algorithm is guaranteed to converge. The purpose of this paper is to show how to find an initial basic feasible (possibly degenerate) solution of a generalized linear program by applying the same algorithm to a 'phase-one' problem without requiring that the initial basic feasible solution to the latter be non-degenerate."