Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Ordinal Optimization: Soft Optimization for Hard Problems

Ordinal Optimization: Soft Optimization for Hard Problems

Ho, Yu-Chi
Zhao, Qian-Chuan
Jia, Qing-Shan

Hardcover

General ComputersGeneral Mathematics

ISBN10: 0387372326
ISBN13: 9780387372327
Publisher: Springer Nature
Published: Sep 12 2007
Pages: 317
Weight: 1.72
Height: 1.01 Width: 7.04 Depth: 9.42
Language: English

The purpose of this book is to address the difficulties of the optimization of complex systems via simulation models or other computation-intensive models involving possible stochastic effects and discrete choices. This is the first book to focus solely on ordinal optimization methodology and its applications. The book establishes distinct advantages of the softer ordinal approach for search-based type problems, analyzes its general properties, and shows the many orders of magnitude improvement in computational efficiency that is possible. The methodology of ordinal optimization has been under continuous development since 1992, resulting in a complete methodology and many success stories roughly paralleling those of cardinal optimization.

Also in

General Mathematics

View All