Author:
Kim Nguyen Thi Bach,Thuy Le Quang
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Armand, P.: Finding all Maximal Efficient Faces in Multiobjective Linear Programming. Mathematical Programming 61, 357–375 (1993)
2. Benson, H.P.: An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem. Journal of Global Optimization 13, 1–24 (1998)
3. Benson, H.P., Sun, E.: Outcome Space Partition of the Weight Set in Multiobjective Linear Programming 105(1), 17–36 (2000)
4. Jahn, J.: Vector Optimization: Theory, Applications and Extensions. Springer, Berlin (2004)
5. Kim, N.T.B., Luc, D.T.: Normal Cone to a Polyhedral Convex Set and Generating Efficient Faces in Linear Multiobjective Programming. Acta Mathematica Vietnamica 25(1), 101–124 (2000)