The Discrete Minimax Problem and Algorithms

  • Boris N. Pshenichnyj
Part of the Springer Series in Computational Mathematics book series (SSCM, volume 22)


The discrete minimax problem, which is often met in practice, involves minimizing the maximum of a finite number of functions. Formally, if I = {1,…, m} is a finite set of indices and for each iI a function f i (x) is given, then the problem consists of minimizing the function as x varies throughout the space IR n .


Dual Problem Linearization Method Auxiliary Problem Goal Function Linearization Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Boris N. Pshenichnyj
    • 1
  1. 1.Institute of Cybernetics of the Academy of the Ukrainian SSRKiev - 207Ukraina, CIS

Personalised recommendations