In this paper, we address bilevel multi-objective programming problems (BMPP) in which the decision maker at each level has multiple objective functions conflicting with each other. Given a BMPP, we show how to construct two artificial multiobjective programming problems such that any point that is efficient for both the two problems is an efficient solution of the BMPP. Some necessary and sufficient conditions for which the obtained result is applicable are provided. A complete procedure of the implementation of an algorithm for generating efficient solutions for the linear case of BMPP is presented. A numerical example is provided to illustrate how the algorithm operates.
 H. Bonnel and J. Morgan, “Semivectorial Bilevel Optimization Problem: Penalty Approach,” Journal of Optimization Theory and Applications, Vol. 131, No. 3, 2006, pp. 365-382. doi:10.1007/s10957-006-9150-4
 D. Kalyanmoy and S. Ankur, “Solving Bilevel MultiObjective Optimization Problems Using Evolutionary Algorithms,” In: Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization, Springer-Verlag Berlin, Heidelberg, 2008, pp. 110-124.
 I. Nishizaki and M. Sakawa, “Stackelberg Solutions to Multiobjective Two-Level Linear Programming Problems,” Journal of Optimization Theory and Applications, Vol. 103, No. 1, 1999, pp. 161-182. doi:10.1023/A:1021729618112
 X. Shi and H. Xia, “Model and Interactive Algorithm of Bi-Level Multi-Objective Decision-Making with Multiple Interconnected Decision Makers,” Journal of Multi-Criteria Decision Analysis, Vol. 10, No. 1, 2001, pp. 27-34. doi:10.1002/mcda.285
 J. G. Ecker, N. S. Hegner and I. A. Kouada, “Generating All Maximal Efficient Faces for Multiple Objective Linear Programs,” Journal of Optimisation Theory and Applications, Vol. 30, No. 3, 1980, pp. 353-381. doi:10.1007/BF00935493