IDEAS home Printed from
   My bibliography  Save this paper

Preference programming and inconsistent interval matrices


  • Islam, R
  • Biswal, MP
  • Alam, SS


The problem of derivation of the weights of altematives from pairwise comparison matrices is long standing. In this paper,Lexicographic Goal Programming (LGP) has been used to find out weights from pairwise inconsistent interval judgment matrices. A number of properties and advantages of LGP as a weight determination technique have been explored. An algorithm for identification and modification of inconsistent bounds is also provided. The proposed technique has been illustrated by means of numerical examples.

Suggested Citation

  • Islam, R & Biswal, MP & Alam, SS, 1995. "Preference programming and inconsistent interval matrices," MPRA Paper 10129, University Library of Munich, Germany, revised 1995.
  • Handle: RePEc:pra:mprapa:10129

    Download full text from publisher

    File URL:
    File Function: original version
    Download Restriction: no

    References listed on IDEAS

    1. Takeda, E. & Cogger, K. O. & Yu, P. L., 1987. "Estimating criterion weights using eigenvectors: A comparative study," European Journal of Operational Research, Elsevier, vol. 29(3), pages 360-369, June.
    2. Arbel, Ami & Vargas, Luis G., 1993. "Preference simulation and preference programming: robustness issues in priority derivation," European Journal of Operational Research, Elsevier, vol. 69(2), pages 200-209, September.
    3. Saaty, Thomas L. & Vargas, Luis G., 1987. "Uncertainty and rank order in the analytic hierarchy process," European Journal of Operational Research, Elsevier, vol. 32(1), pages 107-117, October.
    4. Kress, Moshe, 1991. "Approximate articulation of preference and priority derivation -- a comment," European Journal of Operational Research, Elsevier, vol. 52(3), pages 382-383, June.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Analytic hierarchy process; Interval judgment; Preferente programming;

    JEL classification:

    • C0 - Mathematical and Quantitative Methods - - General


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:10129. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter) or (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.