Skip to main content

Part of the book series: Advanced Information and Knowledge Processing ((AI&KP))

Abstract

This chapter discussed the formulation of multiple criteria programming. In linear discriminate analysis, data separation can be achieved by two opposite objectives. The first objective separates the observations by minimizing the sum of the deviations (MSD) among the observations. The second maximizes the minimum distances (MMD) of observations from the critical value. According to the concept of Pareto optimality, we can seek the best tradeoff of the two measurements by Multiple Criteria Linear Programming (MCLP) model, which is similar to the Support Vector Machine model, addresses more control parameters than the Support Vector Machine, and provides more flexibility for better separation of data under the framework of the mathematical programming. Then MCLP models for multiple classes and unbalanced training set are constructed separately. Furthermore, in order to ensure the existence of solution, we add regularization terms in the objective function of MCLP, and constructed regularized MCLP (RMCLP) model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Freed, N., Glover, F.: Evaluating alternative linear programming models to solve the two-group discriminant problem. Decis. Sci. 17, 151–162 (1986)

    Article  Google Scholar 

  2. Kou, G., Shi, Y.: Linux based multiple linear programming classification program: version 1.0. College of Information Science and Technology, University of Nebraska-Omaha, Omaha, NE 68182, USA, 2002

    Google Scholar 

  3. Peng, Y., Shi, Y., Xu, W.: Classification for three-group of credit cardholders’ behavior via a multiple criteria approach. Adv. Model. Optim. 4, 39–56 (2002)

    MathSciNet  MATH  Google Scholar 

  4. Shi, Y., Peng, Y., Xu, W., Tang, X.: Data mining via multiple criteria linear programming: applications in credit card portfolio management. Int. J. Inf. Technol. Decis. Mak. 1, 131–151 (2002)

    Article  Google Scholar 

  5. Shi, Y., Wise, M., Luo, M., Lin, Y.: Data mining in credit card portfolio management: a multiple criteria decision making approach. In: Koksalan, M., Zionts, S. (eds.) Multiple Criteria Decision Making in the New Millennium, pp. 427–436. Springer, Berlin (2001)

    Google Scholar 

  6. Shi, Y., Yu, P.L.: Goal setting and compromise solutions. In: Karpak, B., Zionts, S. (eds.) Multiple Criteria Decision Making and Risk Analysis and Applications, pp. 165–203. Springer, Berlin (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong Shi .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Shi, Y., Tian, Y., Kou, G., Peng, Y., Li, J. (2011). Multiple Criteria Linear Programming. In: Optimization Based Data Mining: Theory and Applications. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-0-85729-504-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-504-0_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-503-3

  • Online ISBN: 978-0-85729-504-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics