Skip to main content
Article thumbnail
Location of Repository

Constraint-based optimization with the minimax decision criterion

By Craig Boutilier, Relu Patrascu, Pascal Poupart and Dale Schuurmans

Abstract

Abstract. In many situations, a set of hard constraints encodes the feasible con-figurations of some system or product over which users have preferences. We consider the problem of computing a best feasible solution when the user's util-ities are partially known. Assuming bounds on utilities, efficient mixed integer linear programs are devised to compute the solution with minimax regret whileexploiting generalized additive structure in a user's utility function

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.3249
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://cs.ualberta.ca/~dale/pa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.