Conservative linear programming with mixed multiple objectives
AbstractIn an ordinary linear program a single objective vector is constructed and one attempts to choose a decision vector to optimize this objective. Often multiple criteria exist or exact estimates for the components of a single objective vector are not entirely clear. For these cases a conservative decision-maker may want to choose an alternative that maximizes the objective value under the worst foreseeable circumstances. Herein we develop a unified framework for applying the maximin criterion to problems with various degrees of uncertainty attached to the objective vector. Three cases are solved via linear programming: (1) Complete Information, (2) Partial Information, and (3) Total Ignorance. It is shown that the functional value of the maximin solution decreases in a convex manner with increasing uncertainty. In addition certain relationships between maximin and efficient solutions are provided. Finally, an extension to integer constrained decision variables is presented.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 5 (1977)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Zhang, Lei).
If references are entirely missing, you can add them using this form.