<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03874965</id>
  <dt>j</dt>
  <an>03874965</an>
  <augroup>
    <au>Ruderman, Ya.L.</au>
  </augroup>
  <ti>On the determination of effective solutions of some minimax problems.</ti>
  <so>Ehkon. Mat. Metody 20, 753-755 (1984).</so>
  <py>1984</py>
  <pu>Nauka, Moskva</pu>
  <lagroup>
    <la>RU</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>decision-making</ut>
    <ut>inconsistent goals</ut>
    <ut>minimax problems</ut>
    <ut>gradual solution improvement</ut>
    <ut>effective solution</ut>
    <ut>convex constrained set</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Many decision-making problems with inconsistent goals may be formalized as minimax problems with Chebyshev's criterion, where a functional equality and inequality system states the constrained set. The author gives a rather general algorithm of gradual solution improvement, which always gives an effective solution to the condition of the convex constrained set. Algorithms offered formerly are particular cases of the one given here, and they may be extended to the whole class of according linear problems.</ab>
    <rv>A.Kondrat'ev</rv>
  </abgroup>
</item>