Minmax regret solutions for minimax optimization problems with uncertainty

Author: Averbakh I.1

Source: Operations Research Letters, Volume 27, Number 2, September 2000 , pp. 57-65(9)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Keywords: Optimization under uncertainty; Polynomial algorithms; Minmax regret optimization

Language: English

Document Type: Short communication

DOI: 10.1016/S0167-6377(00)00025-0

Affiliations: 1: Mathematics Department, MS-9063, Western Washington University, Bellingham, 98225, Washington, USA

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A