Linear multiple objective programs with zero–one variables

D.E. Bell and J.F. Shapiro, “A finitely convergent duality theory for zero–one integer programming”, MIT Operations Research Center Report OR 043-75 (May 1975).

G.R. Bitran, “Admissible points and vector optimization: a unified approach”, unpublished Ph.D. thesis, Operations Research Center, MIT (Cambridge, MA, 1975).

J.P. Evans and R.E. Steuer, “A revised simplex method for linear multiple objective programs”,Mathematical Programming 5 (1973) 54–72.

R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).

A.M. Geoffrion, “Proper efficiency and the theory of vector maximization”,Journal of Mathematical Analysis and Applications 22 (1968) 618–630.

J.S.H. Kornbluth, “Duality, indifference and sensitivity analysis in multiple objective programming”,Operations Research Quarterly 25 (1974) 599–614.

J. Philip, “Algorithms for the vector maximization problem”,Mathematical Programming 2 (1972) 207–229.

J.F. Shapiro, “Multiple criteria public investment decision making by mixed integer programming”, in:Proceedings of the conference on multicriterion decision making Jouy En Josas, May 1975, to appear.

P.L. Yu and M. Zeleny, “The set of all nondominated solutions in linear cases and a multicriteria simplex method”,Journal of Mathematical Analysis and Applications 49 (1975) 430–468.