Journal of Pure and Applied Mathematics: Advances and Applications[1] P. Armand, Finding all maximal efficient faces in multiobjective
linear programming, Mathematical Programming 61 (1993), 357-375.
[2] J. G. Ecker, N. S. Hegner and I. A. Kouada, Generating all maximal
efficient faces for multiple-objective linear programs, J. Optim.
Theory Appl. 30 (1980), 353-381.
[3] G. C. Feng, Z. H. Lin and B. Yu, Existence of interior pathway to
the Karush-Kuhn-Tucker point of a nonconvex programming problems,
Nonlinear Anal. 32(6) (1998), 761-768.
[4] Z. H. Lin, D. L. Zhu and Z. P. Sheng, Finding a minimal efficient
solution of a convex multiobjective program, J. Optim. Theory Appl.
118 (2003), 587-600.
[5] B. Yu, Q. Xu and G. C. Feng, On the complexity of a combined
homotopy interior method for convex programming, J. Comput. Appl.
Math. 200(1) (2007), 32-46.
