Optimization: Structure and Applications

Overview

The 21 self-contained chapters in this book, include recent developments in several optimization-related topics such as decision theory, linear programming, turnpike theory, duality theory, convex analysis, and queueing theory. This work will be a valuable tool not only to specialists interested in the technical detail and various applications presented, but also to researchers interested in building upon the book’s theoretical results.

Read More ...
See more details below
Paperback (2009)
$172.27
BN.com price
(Save 13%)$199.00 List Price
Other sellers (Paperback)
  • All (7) from $146.83   
  • New (6) from $146.83   
  • Used (1) from $264.41   
Sending request ...

Overview

The 21 self-contained chapters in this book, include recent developments in several optimization-related topics such as decision theory, linear programming, turnpike theory, duality theory, convex analysis, and queueing theory. This work will be a valuable tool not only to specialists interested in the technical detail and various applications presented, but also to researchers interested in building upon the book’s theoretical results.

Read More Show Less

Product Details

Table of Contents

List of Figures.- List of Tables.- Preface.- Editors.- Part I Optimization: Structure.- On the nondifferentiability of cone-monotone functions in Banach spaces.- Duality and a Farkas lemma for integer programs.- Some nonlinear Lagrange and penalty functions for problems with a single constraint.- Convergence of truncates in l1 optimal feedback control.- Asymptotical stability of optimal paths in nonconvex problems.- Pontryagin principle with a PDE - a unified approach.- A turnpike property for discrete-time control systems.- Mond-Weir duality.- Computing in the fundamental matrix of a M/G/1-type Markov chain.- A comparison of probabilistic and invariant subspace methods for the block M/G/1 Markov chain.- Interpolating maps, the modulus map and the Hadamard's inequality.- Part II Optimization: Applications.- Estimating the size of correcting codes using extremal graph problems.- New perspectives on optimal transforms of random vectors.- Optimum capacity assignment in general queueing networks,- Analysis of a simple control policy for stormwater management in two connected dams.- Optimal design of linear consecutive-k-out-of-n systems.- The (k+1)-th component of linear consecutive-k-out-of-n systems.- Optimizing properties of plastics compounds containing wood flour.- Constrained spanning, Steiner trees and the triangle inequality.- Parallel line search.- Alternative mathematical programming models: a case for a coal blending decision process.
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)