References
- Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
- Schrijver A. Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics. New York: John Wiley & Sons; 1986.
- Ziegler GM. Lectures on polytopes. New York: Springer; 1995.
- Alexandrov AD. Convex polyhedra. Berlin: Springer-Verlag; 2005.
- Yang XQ, Yen ND. Structure and weak sharp minimum of the pareto solution set for piecewise linear multiobjective optimization. J. Optim. Theory Appl. 2010;147:113–124.
- Zheng XY. Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces. Set-Valued Var. Anal. 2009;17:389–408.
- Fang YP, Meng KW, Yang XQ. Piecewise linear multi-criteria programs: the continuous case and its discontinuous generalization. Oper. Res. 2012;60:398–409.
- Motzkin TS, Raiffa H, Thompson GL, Thrall RM. The double de scription method. In: Kuhn HW, Tucker AW. Contributions to the theory of games. Vol. II, number 28 in Annals of Mathematics Studies. Princeton (NJ): Princeton University Press; 1953. p. 51–73.
- Fukuda K, Prodon A. Double description method revisited, combinatorics and computer science. Lecture Notes Comput. Sci. 1996;1120:91–111.
- Balinski ML. An algorithm for finding all vertices of convex polyhedral sets. J. Soc. Indu. Appl. Math. 1961;9:72–88.
- Matheiss TH, Rubin DS. A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Oper. Res. 1980;5:167–185.
- Telgen J. Minimal representation of convex polyhedral sets. J. Optim. Theory Appl. 1982;38: 1–24.
- Telgen J. Identifying redundant constraints and implicit equalities in systems of linear constraints. Manage. Sci. 1983;29:1209–1222.
- Boneh A, Caron RJ, Lemire FW, McDonald JF, Telgen J, Vorst T. Note on prime representations of convex polyhedral sets. J. Optim. Theory Appl. 1989;61:137–142.
- Rockafellar RT, Wets RJB. Variational analysis. New York: Springer; 1998.