Skip to content
Home/ Ordinal Optimization: Soft Optimization for Hard Problems (2007)
Ordinal Optimization: Soft Optimization for Hard Problems (2007)
Save Ask us

Ordinal Optimization: Soft Optimization for Hard Problems (2007)

No customer reviews yet ISBN 9780387372327
Published
Sep 2007
Language
English
$57.47
In stock
Most orders arrive within 3 weeks. Shipping policy
Qty
Sign in to Add to Saved list
Free delivery over $35 · 15-day returns

Condition

Brand New

An unread, unused copy: no writing or highlighting, and no missing or damaged pages. Every book we sell is brand new, including our lowest-priced titles.

About this book

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.

Specifications

PublishedSep 12, 2007
ISBN-100387372326
ISBN-139780387372327
LanguageEnglish

Buying from Saanjhi

  • Ships from the USA. Delivery to US addresses only.
  • Free delivery on orders over $35.
  • 15-day returns. Unless we send the wrong book or it arrives damaged, you pay return shipping and a 15% restocking fee.
  • Secure checkout. We never store card details.

Readers who bought this also bought

More from Discrete Mathematics
See all