Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2012, Article ID 591612, 12 pages
Research Article

Homotopy Method for a General Multiobjective Programming Problem under Generalized Quasinormal Cone Condition

1Department of Mathematics, Beihua University, Jilin 132013, China
2Department of Mathematics, Jilin University, Changchun 130001, China
3Institute of Applied Mathematics, Changchun University of Technology, Changchun 130012, China

Received 14 February 2012; Accepted 24 July 2012

Academic Editor: Irena Rachůnková

Copyright © 2012 X. Zhao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. Pareto, Course Economic Politique, Rouge, Lausanne, Switzerland, 1896.
  2. J. Von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, Princeton, NJ, USA, 1944.
  3. T. C. Koopmans, Activity Analysis of Production and Allocation, Wiley, New York, NY, USA, 1951.
  4. R. B. Kellogg, T. Y. Li, and J. Yorke, “A constructive proof the Brouwer fixed-point theorem and computational results,” SIAM Journal on Numerical Analysis, vol. 18, no. 4, pp. 473–483, 1976. View at Google Scholar · View at Scopus
  5. S. Smale, “A convergent process of price adjustment and global newton methods,” Journal of Mathematical Economics, vol. 3, no. 2, pp. 107–120, 1976. View at Google Scholar · View at Scopus
  6. S. N. Chow, P. J. Mallet, and J. A. York, “Finding zero of maps: homotopy methods that are constructive with probability one,” Mathematics of Computation, vol. 32, pp. 887–899, 1978. View at Google Scholar
  7. M. S. Gowda, “On the extended linear complementarity problem,” Mathematical Programming Series B, vol. 72, no. 1, pp. 33–50, 1996. View at Google Scholar · View at Scopus
  8. F. Facchinei and J. S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer, New York, NY, USA, 2003.
  9. Y. F. Shang and B. Yu, “A constraint shifting homotopy method for convex multi-objective programming,” Journal of Computational and Applied Mathematics, vol. 236, pp. 640–646, 2011. View at Google Scholar
  10. G. P. McCormick, “Projective SUMT method for convex programming,” Mathematics of Operations Research, vol. 14, no. 2, pp. 203–223, 1989. View at Google Scholar · View at Scopus
  11. R. D. C. Monteroro and I. Adler, “An extension of karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence,” Mathematics of Operations Research, vol. 15, pp. 408–422, 1990. View at Google Scholar
  12. Z. Lin, B. Yu, and G. Feng, “A combined homotopy interior point method for convex nonlinear programming,” Applied Mathematics and Computation, vol. 84, no. 2-3, pp. 193–211, 1997. View at Google Scholar · View at Scopus
  13. Z. H. Lin, D. L. Zhu, and Z. P. Sheng, “Finding a minimal efficient solution of a convex multiobjective program,” Journal of Optimization Theory and Applications, vol. 118, no. 3, pp. 587–600, 2003. View at Publisher · View at Google Scholar · View at Scopus
  14. W. Song and G. M. Yao, “Homotopy method for a general multiobjective programming problem,” Journal of Optimization Theory and Applications, vol. 138, no. 1, pp. 139–153, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. X. Zhao, S. G. Zhang, and Q. H. Liu, “Homotopy interior-point method for a general multiobjectuve programming problem,” Journal of Applied Mathematics, vol. 2012, Article ID 497345, 12 pages, 2012. View at Publisher · View at Google Scholar
  16. Z. S. Zhang, Introduction to Differential Topology, Beijing University Press, Beijing, China, 2002.
  17. G. L. Naber, Topological Methods in Euclidean Space, Cambridge University Press, London, USA, 1980.