Track Order   | Customer Support   | Request Book   |
International Order
Mathematics Of Optimization at Meripustak

Mathematics Of Optimization

Books from same Author: Miller Steven J.

Books from same Publisher: ORIENT BLACKSWAN

Related Category: Author List / Publisher List

  • Retail Price: ₹ 1795/- [ 0.00% off ]

    Seller Price: ₹ 1795

Sold By: T K Pandey      Click for Bulk Order

Offer 1: Get ₹ 111 extra discount on minimum ₹ 500 [Use Code: Bharat]

Offer 2: Get 0.00 % + Flat ₹ 100 discount on shopping of ₹ 1500 [Use Code: IND100]

Offer 3: Get 0.00 % + Flat ₹ 300 discount on shopping of ₹ 5000 [Use Code: MPSTK300]

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

Free Shipping Available


Click for International Orders
  • Provide Fastest Delivery
  • 100% Original Guaranteed
    • General Information  
    Author(s)Miller Steven J.
    PublisherORIENT BLACKSWAN
    ISBN9781470454685
    BindingPaperback
    LanguageEnglish
    Publish YearJanuary 2017

    Description

    ORIENT BLACKSWAN Mathematics Of Optimization by Miller Steven J.

    Optimization Theory is an active area of research with numerous applications; many of the books are designed for engineering classes and thus have an emphasis on problems from such fields. Covering much of the same material there is less emphasis on coding and detailed applications as the intended audience is more mathematical. There are still several important problems discussed (especially scheduling problems) but there is more emphasis on theory and less on the nuts and bolts of coding. A constant theme of the text is the “why” and the “how” in the subject. Why are we able to do a calculation efficiently? How should we look at a problem? Extensive effort is made to motivate the mathematics and isolate how one can apply ideas/perspectives to a variety of problems. As many of the key algorithms in the subject require too much time or detail to analyze in a first course (such as the run-time of the Simplex Algorithm) there are numerous comparisons to simpler algorithms which students have either seen or can quickly learn (such as the Euclidean algorithm) to motivate the type of results on run-time savings.