Abstract
In this paper, I carry out an extension of the MICA method (modified interactive chebyshev algorithm) for non-convex multiobjective programming. This method is based on the Tchebychev method and in the reference point approach. At each iteration, the decision maker (DM) can provide aspiration levels (desirable values for the objective functions) and also, if the DM wishes, reservation levels (level under which the objective function is not considered acceptable). On the basis of this preferential information, a region of the nondominated objective set is defined. In the convex case, considering the aspiration vector as a reference point in an achievement scalarizing function and taking a set of weight vectors, the efficient solutions generated satisfy the reservation levels. In this work, I analyze the non-convex case. The main result of MICA is verified and demonstrated for the non-convex bi-objective case. The MICA method is not verified in general for multiobjective problems with three or more objective functions, which is demonstrated with a counterexample.


References
Buchanan, J.T.: A naïve approach for solving MCDM problems: the GUESS method. J. Oper. Res. Soc. 48, 202–206 (1997)
Deb, K., Chaudhuri, S., Miettinen, K.: Towards estimating nadir objective vector using evolutionary approaches. In: Keijzer, M., et al. (eds.) Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference, Vol. 1, pp. 643–650. The Association of Computing Machinery, New York (2006)
Deb, K., Miettinen, K., Chaudhuri, S.: Towards an estimation of nadir objective vector using a hybrid of evolutionary and local search approaches. IEEE Trans. Evol. Comput. 14(6), 821–841 (2010)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Congress on Evolutionary Computation (CEC-2002), pp. 825–830 (2002)
Ehrgott, M., Tenfelde-Podehl, D.: Computation of ideal and nadir values and implications for their use in MCDM methods. Eur. J. Oper. Res. 151(1), 119–131 (2003)
Hwang, C.L., Masud, A.S.M.: Multiple Objective Decision Making: Methods and Applications: A State-of-the-Art Survey. Lecture Notes in Economics and Mathmatical Systems, Vol. 164. Springer Verlag, Berlin (1979)
Jaszkiewicz, A., Słowinski, R.: The light beam search approach: an overview of methodology and applications. Eur. J. Oper. Res. 113(2), 300–314 (1999)
Korhonen, P., Laakso, J.: A visual interactive method for solving the multiple criteria problem. Eur. J. Oper. Res. 24(2), 277–287 (1986)
Luque, M., Miettinen, K., Ruiz, A.B., Ruiz, F.: A two-slope achievement scalarizing function for interactive multiobjective optimization. Comput. Oper. Res. 39(7), 1673–1681 (2012)
Luque, M., Ruiz, F., Steuer, R.E.: Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming. Eur. J. Oper. Res. 204(3), 557–564 (2010)
Luque, M., Yang, J.B., Wong, B.Y.H.: PROJECT method for multiobjective optimization based on the gradient projection and reference point. IEEE Trans. Syst. Man Cybern. A Syst. Hum. 39(4), 864–879 (2009)
Michalowski, W., Szapiro, T.: A bi-reference procedure for interactive multiple objective programming. Oper. Res. 40, 247–258 (1992)
Miettinen, K., Mäkelä, M.M.: Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation. J. Oper. Res. Soc. 50(9), 949–959 (1999)
Miettinen, K., Mäkelä, M.M.: Synchronous approach in interactive multiobjective optimization. Eur. J. Oper. Res. 170(7–8), 909–922 (2006)
Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer, Boston (1999)
Morse, Joel N.: Reducing the size of the nondominated set: pruning by clustering. Comput. Oper. Res. 7(1–2), 55–66 (1980)
Nakayama, H., Sawaragi, Y.: Satisficing trade-off method for multiobjective programming. In: Grauer, M., Wierzbicki, A.P. (eds.) Lecture Notes in Economics and Mathematical Systems, vol. xx, pp. 114–122. Springer- Verlag, Berlin (1984)
Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation and Application. John Wiley, New York (1986)
Steuer, R.E., Choo, E.U.: An interactive weighted Tchebycheff procedure for multiple objective programming. Math. Program. 26(1), 326–344 (1983)
Wierzbicki, A.P.: The use of reference objectives in multiobjective optimization. In: Fandel, G., Gal, T. (eds.) Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 468–486. Springer-Verlag, Berlin (1980)
Wierzbicki, A.P.: On the completeness and constructiveness of parametric characterizations to vector optimization problems. Oper. Res. Spectr. 8(2), 73–87 (1982)
Acknowledgments
This research was partly supported by the Spanish Ministry of Innovation and Science (MTM2010-14992) and by the Andalusian Regional Ministry of Innovation, Science and Enterprises (PAI group SEJ-532).
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
In this appendix, I prove Theorem 2 (stated in Sect. 4):
Proof of Theorem 2
Given that \((\bar{\mathbf{x}}, \bar{\mathbf{z}})\) is an optimal solution of problem (4), the following relation holds:
For each \(i \in \{1,2\}\) and \(r \in \{1,2\}\), taking into account the definitions of \(\varvec{\lambda }^{hr}\) in (9), and \(\delta \), we have:
Therefore, inequality (11) implies that
and thus
Without loss of generality, it can be assumed that \(\lambda _{1}^{h1} \le \lambda _{1}^{h2}\), which in turn implies that \(\lambda _{2}^{h1} \ge \lambda _{2}^{h2}\) (given that \(\lambda _{1}^{h1} + \lambda _{2}^{h1} = \lambda _{1}^{h2} + \lambda _{2}^{h2} =1\)). Therefore, taking into account expression (9), we have:
Therefore, relation (12) implies:
If, on the one hand, \(r \in J^{hr}\), then relations (9) and (13) imply that:
If, on the other hand, \(r \in I^{hr}\), then relations (9) and (13) imply that:
and this completes the proof. \(\square \)
Rights and permissions
About this article
Cite this article
Luque, M. Modified interactive chebyshev algorithm (MICA) for non-convex multiobjective programming. Optim Lett 9, 173–187 (2015). https://doi.org/10.1007/s11590-014-0743-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0743-9