Conservative linear programming with mixed multiple objectives
In 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.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:5:y:1977:i:2:p:193-205. 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: (Dana Niculescu)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.