Skip to main content
SpringerLink
Log in

A Lexicographic Method for Multiple Objective Binary Linear Programming

  • Conference paper
Toward Interactive and Intelligent Decision Support Systems

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 285))

Abstract

The problem we are going to study in this paper is the following:

$$ \min z = {C_x}S.t.Ax \leqslant b{x_3} = 0or1 $$
((P))

where A is an m × n matrix, C is k × n and the solution to (P) is a solution that the decision maker agrees.

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

Access this chapter

Log in via an institution
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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Balas, E. (1965). “An additive algorithm for solving linear programs with zero-one variables”, Ops, Res. 13(4), 517–546.

    Article  Google Scholar 

  • Bitran, G. (1977). “Linear multiple objective programs with zero-one variables”, Math. Programming 13, 121–139.

    Article  Google Scholar 

  • Gonzalez, J.J., G.R. Reeves and L.S. Franz (1984). “An interactive procedure for solving multiple objective integer linear programming problems”. Paper presented at the Vith International Conference on MCDM (Cleveland, June)

    Google Scholar 

  • Kiziltan, G. and E. Yacaoglu (1983). “An algorithm for multiobjective zero-one linear programming”. Mn. Sc. 29(12), 1444–1453.

    Article  Google Scholar 

  • Pasternak, H. and U. Passy (1973), “Bicriterion mathematical programs with boolean variables”, in J.L. Cochrane and M. Zeleny (eds.), “Multiple Criteria Decision Making”, University of South Carolina Press, 327–348

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. Estadística e I.O., Facultad de Informática U.P.M., 28031, Madrid, Spain

    A. J. Rueda

Authors
  1. A. J. Rueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Institute of Systems Research, Nippon-Italy Kyoto Kaikan, 4 Ushinomiya-cho, Yoshida, Sakyo, Kyoto 606, Japan

    Yoshikazu Sawaragi

  2. Department of Aeronautical Engineering, Kyoto University, Yoshida-honmachi, Sakyo, Kyoto 606, Japan

    Koichi Inoue

  3. Department of Applied Mathematics, Konan University, 8-9-1 Okamoto, Higashinada, Kobe 658, Japan

    Hirotaka Nakayama

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rueda, A.J. (1987). A Lexicographic Method for Multiple Objective Binary Linear Programming. In: Sawaragi, Y., Inoue, K., Nakayama, H. (eds) Toward Interactive and Intelligent Decision Support Systems. Lecture Notes in Economics and Mathematical Systems, vol 285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46607-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46607-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17718-0

  • Online ISBN: 978-3-642-46607-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation