Previous |  Up |  Next

Article

References:
[1] M. Balinski: An algorithm for finding all vertices of a convex polyhedral set. SIAM Journal, 9 (1) (1961), 72-88. MR 0142057
[2] R. T. Rockafellar: Convex analysis. Princeton, 1970. (Russian translation Moskva, 1973.) MR 0274683 | Zbl 0193.18401
[3] F. Šik: A linear problem of the interval calculus. Ekonom.-matem. obzor, 16 (1980), 37-46. MR 0571740
[4] W. Oettli W. Prager: Compatibility of approximate solution of linear equations with given error bounds for coefficients and right hand sides. Numerische Math., 6 (1964), 405 - 409. MR 0168106
[5] J. Rohn: Soustavy lineárních rovnic s intervalově zadanými koeficienty. (Systems of linear equations with inexact data). Ekonom.-matem. obzor, 12 (1976), 311 - 315. MR 0448832
[6] D. J. Hartfiel: Concerning the solution set of $Ax = b$ where $P \leq A \leq Q$ and $p \leq b \leq q$. Numerische Mathem., 35 (1980), 355-359. MR 0592162 | Zbl 0446.65017
[7] T. H. Mathesis S. David Rubin: A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Oper. Res. 5 (1980) no. 2, 167-185. MR 0571811
Partner of
EuDML logo