• DocumentCode
    635823
  • Title

    Necessary efficiency is partitioned into possible and necessary optimalities

  • Author

    Inuiguchi, Masahiro

  • Author_Institution
    Grad. Sch. of Eng. Sci., Osaka Univ., Toyonaka, Japan
  • fYear
    2013
  • fDate
    24-28 June 2013
  • Firstpage
    209
  • Lastpage
    214
  • Abstract
    To multiple objective linear programming problems with interval objective functions, the necessarily efficient solution has been proposed as one of very reasonable solution concepts. While the relation of efficient solutions to the conventional multiple objective linear programming problem and optimal solutions to the related single objective problems is well established, the relation of the necessarily efficient solutions with possibly and necessarily optimal solutions to the related single objective problems with uncertain coefficients of the objective function has not yet been studied extensively. In this paper, we investigate the relation. We first show the insufficiency of the conventional scalarization methods for the problem with interval coefficients of objective functions. We clarify the relation of the necessarily efficient solutions with possibly and necessarily optimal solutions by the investigation of properties of necessarily efficient solutions.
  • Keywords
    linear programming; interval objective functions; multiple objective linear programming problems; necessary efficiency; necessary optimalities; optimal solutions; possible optimalities; single objective problems; uncertain coefficients; Ear; Educational institutions; Electronic mail; Linear matrix inequalities; Linear programming; Programming; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), 2013 Joint
  • Conference_Location
    Edmonton, AB
  • Type

    conf

  • DOI
    10.1109/IFSA-NAFIPS.2013.6608401
  • Filename
    6608401