Danskin J M (20 results)

Condition: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: New. In English.

Condition: New. pp. 140.

Condition: New. pp. 312.

Paperback. Condition: Brand New. reprint edition. 140 pages. 9.25x6.10x0.40 inches. In Stock.

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is and optimally counter. They are fundamental in parti cular to military weapons-selection problems involving large systems such as Minuteman or Polaris, where the systems in the mix are so large that they cannot be concealed from an opponent. One must then expect the opponent to determine on an optlmal mixture of, in the case men tioned above, anti-Minuteman and anti-submarine effort. The author's first introduction to a problem of Max-Min type occurred at The RAND Corporation about 1951. One side allocates anti-missile defenses to various cities. The other side observes this allocation and then allocates missiles to those cities. If F(x, y) denotes the total residual value of the cities after the attack, with x denoting the defender's strategy and y the attacker's, the problem is then to find Max MinF(x, y) = Max [MinF(x, y)] .…

Condition: New. pp. 432.

Condition: New. Series: Translations of Mathematical Monographs Reprint. Num Pages: 250 pages. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 340. . 1964. Reprint. paperback. . . . . Books ship from the US and Ireland.

Condition: New. Series: Translations of Mathematical Monographs Reprint. Num Pages: 96 pages. BIC Classification: PD. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Weight in Grams: 157. . 1967. Paperback. . . . . Books ship from the US and Ireland.…

Condition: New. Series: Translations of Mathematical Monographs Reprint. Num Pages: 96 pages. BIC Classification: PD. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Weight in Grams: 157. . 1967. Paperback. . . . .

Condition: New. Series: Translations of Mathematical Monographs Reprint. Num Pages: 250 pages. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 340. . 1964. Reprint. paperback. . . . .

Gebundene Ausgabe. Condition: Sehr gut. 292 Seiten; 1979. Gelber Leinenbuchdeckel leicht berieben/bestosse, Ränder und Rücken leicht ausgebleichtn. Innenteil tadellos - u n g e l e s e n - keine Risse, Knicke, Anmerkungen. ! Im Vorsatz Name weiß überpinselt. Altersbedingt leicht nachgedunkelt! Versand aus München V734 Sprache: Deutsch Gewicht in Gramm: 750. …

Condition: new. Questo è un articolo print on demand.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is and optimally counter. They are fundamental in parti cular to military weapons-selection problems involving large systems such as Minuteman or Polaris, where the systems in the mix are so large that they cannot be concealed from an opponent. One must then expect the opponent to determine on an optlmal mixture of, in the case men tioned above, anti-Minuteman and anti-submarine effort. The author's first introduction to a problem of Max-Min type occurred at The RAND Corporation about 1951. One side allocates anti-missile defenses to various cities. The other side observes this allocation and then allocates missiles to those cities. If F(x, y) denotes the total residual value of the cities after the attack, with x denoting the defender's strategy and y the attacker's, the problem is then to find Max MinF(x, y) = Max [MinF(x, y)] . 140 pp. Englisch.…

Condition: New. Print on Demand pp. 140 6 Figures, 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. Print on Demand pp. 312 36 Figures, 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 140.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is and optimally counter. They are fundamental in parti cular to military weapons-selection problems involving large systems such as Minuteman or Polaris, where the systems in the mix are so large that they cannot be concealed from an opponent. One must then expect the opponent to determine on an optlmal mixture of, in the case men tioned above, anti-Minuteman and anti-submarine effort. The author's first introduction to a problem of Max-Min type occurred at The RAND Corporation about 1951. One side allocates anti-missile defenses to various cities. The other side observes this allocation and then allocates missiles to those cities. If F(x, y) denotes the total residual value of the cities after the attack, with x denoting the defender's strategy and y the attacker's, the problem is then to find Max MinF(x, y) = Max [MinF(x, y)] .Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 140 pp. Englisch.…

Condition: New. Print on Demand pp. 432 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.