Abstract
Let f i , j = 1, …, N, be the criterion functions that depend on the decision maker’s variable x∈ R n and opponent’s (or disturbance) variables yi ∈ R mj, j =1, …, N. In the absence of information about the opponent’s strategies a conservative decision maker would assume that he will experience the worst possible outcome at the hands of his opponents. In such a case, the objective functions to be minimized by the decision maker are defined as follows:
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shimizu, K., Ishizuka, Y., Bard, J.F. (1997). Min-Max Type Multi-Objective Programming Problem. In: Nondifferentiable and Two-Level Mathematical Programming. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6305-1_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6305-1_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7895-2
Online ISBN: 978-1-4615-6305-1
eBook Packages: Springer Book Archive