Open Access
MATEC Web of Conferences
Volume 44, 2016
2016 International Conference on Electronic, Information and Computer Engineering
Article Number 01038
Number of page(s) 5
Section Computer, Algorithm, Control and Application Engineering
Published online 08 March 2016
  1. Prof. Dr. T. Gal. Homogene mehrparametrische lineare Programmierung[J]. Zeitschrift für Operations Research. 1972 (3)
  2. K. -H. Borgwardt. The Average number of pivot steps required by the Simplex-Method is polynomial[J]. Zeitschriftfür Operations Research. 1982 (1)
  3. Wolfgang Temelt. The parameter space of the general linear programming problem[J]. Soviet Mathematical Journal. 1967 (3)
  4. The ellipsoid method and its consequences in combinatorial optimization[J]. Combinatorica. 1981 (2)
  5. N. Karmarkar. A new polynomial-time algorithm for linear programming[J]. Combinatorica. 1984 (4)
  6. Yamamura K, Tanaka S. Performance evaluation of the LPtest algorithm for finding all solutions of piecewise-linearresistive circuits. International Journal of Circuit Theory and Applications. 2000
  7. H. P. Benson, D. Lee. Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem[J]. Journal of Optimization Theory and Applications. 1996 (1)
  8. F. P. Vasil’ev, M. Yachimovich. Discrepancy method for the lexicographic linear programming problem[J]. Computational Mathematics and Modeling. 1995 (1)
  9. J. Fülöp, L. D. Muu. Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem[J]. Journal of Optimization Theory and Applications. 2000 (1)
  10. Adi Ben-Israel. A ℤ-Simplex Algorithm with partial updates[J]. BIT. 1987 (1)