Skip to main content

1997 | OriginalPaper | Buchkapitel

Satisfaction Optimization Problem

verfasst von : Kiyotaka Shimizu, Yo Ishizuka, Jonathan F. Bard

Erschienen in: Nondifferentiable and Two-Level Mathematical Programming

Verlag: Springer US

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

This chapter deals with an optimization problem involving unknown parameters (uncertainty). We consider a decision problem whose objective function is minimized under the condition that a certain performance function should always be less than or equal to a prescribed permissible level (for every value of the unknown parameters). In the case that the set in which the unknown parameters must lie contains an infinite number of elements, we say that the corresponding optimization problem has an infinite number of inequality constraints and call it an infinitely constrained optimization problem.†

Metadaten
Titel
Satisfaction Optimization Problem
verfasst von
Kiyotaka Shimizu
Yo Ishizuka
Jonathan F. Bard
Copyright-Jahr
1997
Verlag
Springer US
DOI
https://doi.org/10.1007/978-1-4615-6305-1_10

Premium Partner