The composite simplex algorithm英文文献.pdfVIP

The Composite Simplex Algorithm Author(s): Philip Wolfe Source: SIAM Review, Vol. 7, No. 1 (Jan., 1965), pp. 42-54 Published by: Society for Industrial and Applied Mathematics Stable URL: /stable/2027213 Accessed: 15/12/2009 21:05 Your use of the JSTOR archive indicates your acceptance of JSTORs Terms and Conditions of Use, available at /page/info/about/policies/terms.jsp. JSTORs Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at /action/showPublisher?publisherCode=siam. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@. Society for Industrial and Applied Mathematics is collaborating with JSTOR to digitize, preserve and extend access to SIAM Review. SIAM REVIEW Vol. 7. No. 1, January, 1965 THE COMPOSITE SIMPLEX ALGORITHM* PHILIP WOLFEt 1. Introduction. The purpose of this paper is the description of a composite simplex algorithm, a particular technique for using the simplex mllethodto ob- tain a feasible solution of a linear prograniming problem, particularly in the case in which a startiilg solution having negative values is at hand. While formlis