Generalized theorems for permanent basic and nonbasic variables-Reference-Cited by-同舟云学术

Generalized theorems for permanent basic and nonbasic variables

Published:1985-06 Issue:2 Volume:31 Page:229-234
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Cheng M. C.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02591751.pdf

Reference10 articles.

1. L. Brosius, “Comment on a paper by M.C. Cheng”,Mathematical Programming 21(1981) 229–232.

2. M.C. Cheng, “New criteria for the simplex algorithm”,Mathematical Programming 19(1980) 230–236.

3. M.C. Cheng, “Recent development in the simplex algorithm”, 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–19.

4. U. Eckhardt, “Redundante Ungleichungen bei linearen Ungleichungssystemen”,Unternehmensforschung 12(1971) 279–286.

5. Discussion Paper;T. Gal,1978

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Admission control strategies for tandem Markovian loss systems;Queueing Systems;2018-01-13

2. Eliminating Permanently Dominated Opportunities in Multiple-Criteria and Multiple-Constraint Level Linear Programming;Journal of Mathematical Analysis and Applications;1994-05

3. New evidence on the efficiency of the steepest-edge simplex algorithm;Computers & Industrial Engineering;1993-07

4. Computational Efficiency and Linear Problems of General Structure;Multiobjective Optimization: Behavioral and Computational Considerations;1992

5. Computational efficiency and interactive molp algorithms: An implementation of the simolp procedure;Computers & Operations Research;1990-01