{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:20:51Z","timestamp":1648509651233},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1007\/bf02591751","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:42:12Z","timestamp":1175168532000},"page":"229-234","source":"Crossref","is-referenced-by-count":6,"title":["Generalized theorems for permanent basic and nonbasic variables"],"prefix":"10.1007","volume":"31","author":[{"given":"M. C.","family":"Cheng","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02591751_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01584243","volume":"21","author":"L. Brosius","year":"1981","unstructured":"L. Brosius, \u201cComment on a paper by M.C. Cheng\u201d,Mathematical Programming 21(1981) 229\u2013232.","journal-title":"Mathematical Programming"},{"key":"BF02591751_CR2","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/BF01581644","volume":"19","author":"M.C. Cheng","year":"1980","unstructured":"M.C. Cheng, \u201cNew criteria for the simplex algorithm\u201d,Mathematical Programming 19(1980) 230\u2013236.","journal-title":"Mathematical Programming"},{"key":"BF02591751_CR3","first-page":"6","volume-title":"Proceeding of the Mathematical Seminar: Singapore 1980","author":"M.C. Cheng","year":"1981","unstructured":"M.C. Cheng, \u201cRecent development in the simplex algorithm\u201d, in: K.N. Cheng and C.T. Chong, eds.,Proceeding of the Mathematical Seminar: Singapore 1980 (Singapore Mathematical Society and Mathematics Department, N.U.S., Singapore, 1981) pp. 6\u201319."},{"key":"BF02591751_CR4","first-page":"279","volume":"12","author":"U. Eckhardt","year":"1971","unstructured":"U. Eckhardt, \u201cRedundante Ungleichungen bei linearen Ungleichungssystemen\u201d,Unternehmensforschung 12(1971) 279\u2013286.","journal-title":"Unternehmensforschung"},{"key":"BF02591751_CR5","series-title":"Discussion Paper","volume-title":"Redundancy in systems of linear inequalities revisited","author":"T. Gal","year":"1978","unstructured":"T. Gal, \u201cRedundancy in systems of linear inequalities revisited\u201d, Discussion Paper no. 19, Fern-Universit\u00e4t (Hagen, 1978)."},{"key":"BF02591751_CR6","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45535-3","volume-title":"Redundancy in mathematical programming: A state-of-the-art survey","author":"M.H. Karwan","year":"1983","unstructured":"M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts, Redundancy in mathematical programming: A state-of-the-art survey, Lecture Notes in Economics and Mathematical Systems, Vol. 206 (Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983)."},{"key":"BF02591751_CR7","first-page":"132","volume-title":"Linear programming","author":"R.W. Llewellyn","year":"1964","unstructured":"R.W. Llewellyn, Linear programming (Holt, Rinehart & Whinston, New York, 1964) pp. 132\u2013138."},{"key":"BF02591751_CR8","first-page":"197","volume":"23","author":"J. Telgen","year":"1979","unstructured":"J. Telgen, \u201cOn R.W. Llewellyn\u2019s rules to identify redundant constraints: A detailed critique and some generalizations\u201d,Zeitschrift f\u00fcr Operations Research 23(1979) 197\u2013206.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"BF02591751_CR9","series-title":"Mathematical Centre Tracts","volume-title":"Redundancy and linear programs","author":"J. Telgen","year":"1981","unstructured":"J. Telgen, Redundancy and linear programs, Mathematical Centre Tracts 137 (Mathematisch Centrum, Amsterdam, 1981)."},{"key":"BF02591751_CR10","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/mnsc.12.7.588","volume":"12","author":"G.L. Thompson","year":"1966","unstructured":"G.L. Thompson, F.M. Tonge and S. Zionts, \u201cTechniques for removing non-binding constraints and extraneous variables from linear programming\u201d,Management Science 12(1966) 588\u2013608.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591751.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591751\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:49Z","timestamp":1558381069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF02591751"],"URL":"https:\/\/doi.org\/10.1007\/bf02591751","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}