IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

An Interactive Programming Method for Solving the Multiple Criteria Problem

Listed author(s):
  • Stanley Zionts

    (European Institute for Advanced Studies in Management and School of Management, State University of New York at Buffalo)

  • Jyrki Wallenius

    (European Institute for Advanced Studies in Management and the Helsinki School of Economics and Business Administration)

In this paper a man-machine interactive mathematical programming method is presented for solving the multiple criteria problem involving a single decision maker. It is assumed that all decision-relevant criteria or objective functions are concave functions to be maximized, and that the constraint set is convex. The overall utility function is assumed to be unknown explicitly to the decision maker, but is assumed to be implicitly a linear function, and more generally a concave function of the objective functions. To solve a problem involving multiple objectives the decision maker is requested to provide answers to yes and no questions regarding certain trade offs that he likes or dislikes. Convergence of the method is proved; a numerical example is presented. Tests of the method as well as an extension of the method for solving integer linear programming problems are also described.

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.

File URL:
Download Restriction: no

Article provided by INFORMS in its journal Management Science.

Volume (Year): 22 (1976)
Issue (Month): 6 (February)
Pages: 652-663

in new window

Handle: RePEc:inm:ormnsc:v:22:y:1976:i:6:p:652-663
Contact details of provider: Postal:
7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

Phone: +1-443-757-3500
Fax: 443-757-3515
Web page:

More information through EDIRC

No references listed on IDEAS
You can help add them by filling out this form.

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:22:y:1976:i:6:p:652-663. 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: (Mirko Janc)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.