Home > Mathematics and Science Textbooks > Mathematics > Probability and statistics > AMPL: a Modeling Language for Mathematical Programming
23%
AMPL: a Modeling Language for Mathematical Programming

AMPL: a Modeling Language for Mathematical Programming

5       |  2 Reviews 
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

AMPL is a language for large-scale optimization and mathematical programming problems in production, distribution, blending, scheduling, and many other applications. Combining familiar algebraic notation and a powerful interactive command environment, AMPL makes it easy to create models, use a wide variety of solvers, and examine solutions. Though flexible and convenient for rapid prototyping and development of models, AMPL also offers the speed and generality needed for repeated large-scale production runs. This book, written by the creators of AMPL, is a complete guide for modelers at all levels of experience. It begins with a tutorial on widely used linear programming models, and presents all of AMPL's features for linear programming with extensive examples. Additional chapters cover network, nonlinear, piecewise-linear, and integer programming; database and spreadsheet interactions; and command scripts. Most chapters include exercises. Download free versions of AMPL and several solvers from www.ampl.com for experimentation, evaluation, and education. The Web site also lists vendors of the commercial version of AMPL and numerous solvers.

Table of Contents:
1. PRODUCTION MODELS: MAXIMIZING PROFITS. A two-variable linear program. The two-variable linear program in AMPL. A linear programming model. The linear programming model in AMPL. Adding lower bounds to the model. Adding resource constraints to the model. AMPL interfaces. 2. DIET AND OTHER INPUT MODELS: MINIMIZING COSTS. A linear program for the diet problem. An AMPL model for the diet problem. Using the AMPL diet model. Generalizations to blending, economics, and scheduling. 3. TRANSPORTATION AND ASSIGNMENT MODELS. A linear program for the transportation problem. An AMPL model for the transportation problem. Other interpretations of the transportation model. 4. BUILDING LARGER MODELS. A multicommodity transportation model. A multiperiod production model. A model of production and transportation. 5. SIMPLE SETS AND INDEXING. Unordered sets. Sets of numbers. Set operations. Set membership operations and functions. Indexing expressions. Ordered sets. 6. COMPOUND SETS AND INDEXING. Sets of ordered pairs. Subsets and slices of ordered pairs. Sets of longer tuples. Operations on sets of tuples. Indexed collections of sets. 7. PARAMETERS AND EXPRESSIONS. Parameter declarations. Arithmetic expressions. Logical and conditional expressions. Restrictions on parameters. Computed parameters. Randomly generated parameters. Logical parameters. Symbolic parameters. 8. LINEAR PROGRAMS: VARIABLES, OBJECTIVES AND CONSTRAINTS. Variables. Linear expressions. Objectives. Constraints. 9. SPECIFYING DATA. Formatted data: the data command. Data in lists. Data in tables. Other features of data statements. Reading unformatted data: the read command. 10. DATABASE ACCESS. General principles of data correspondence. Examples of table-handling statements. Reading data from relational tables. Writing data to relational tables. Reading and writing the same table. Indexed collections of tables and columns. Standard and built-in table handlers. 11. MODELING COMMANDS. General principles of commands and options. Setting up and solving models and data. Modifying data. Modifying models. 12. DISPLAY COMMANDS. Browsing through results: the display command. Formatting options for display. Numeric options for display. Other output commands: print and printf. Related solution values. Other display features for models and instances. General facilities for manipulating output. 13. COMMAND SCRIPTS. Running scripts: include and commands. Iterating over a set: the for statement. Iterating subject to a condition: the repeat statement. Testing a condition: the if-then-else statement. Terminating a loop: break and continue. Stepping through a script. Manipulating character strings. 14. INTERACTIONS WITH SOLVERS. Presolve. Retrieving results from solvers. Exchanging information with solvers via suffixes. Alternating between models. Named problems. 15. NETWORK LINEAR PROGRAMS. Minimum-cost transshipment models. Other network models. Declaring network models by node and arc. Rules for node and arc declarations. Solving network linear programs. 16. COLUMNWISE FORMULATIONS. An input-output model. A scheduling model. Rules for columnwise formulations. 17. PIECEWISE-LINEAR PROGRAMS. Cost terms. Common two-piece and three-piece terms. Other piecewise-linear functions. Guidelines for piecewise-linear optimization. 18. NONLINEAR PROGRAMS. Sources of nonlinearity. Nonlinear variables. Nonlinear expressions. Pitfalls of nonlinear programming. 19. COMPLEMENTARITY PROBLEMS. Sources of complementarity. Forms of complementarity constraints. Working with complementarity constraints. 20. INTEGER LINEAR PROGRAMS. Integer variables. Zero-one variables and logical conditions. Practical considerations in integer programming. APPENDIX A: AMPL REFERENCE MANUAL. INDEX.


Best Sellers


Product Details
  • ISBN-13: 9780534388096
  • Publisher: Cengage Learning, Inc
  • Publisher Imprint: Brooks/Cole
  • Depth: 32
  • Height: 239 mm
  • No of Pages: 540
  • Series Title: English
  • Sub Title: a Modeling Language for Mathematical Programming
  • Width: 188 mm
  • ISBN-10: 0534388094
  • Publisher Date: 01 Nov 2002
  • Binding: Hardback
  • Edition: Revised edition
  • Language: English
  • Returnable: N
  • Spine Width: 25 mm
  • Weight: 953 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

5       |  2 Reviews 
out of (%) reviewers recommend this product
Top Reviews
Rating Snapshot
Select a row below to filter reviews.
5
4
3
2
1
Average Customer Ratings
5       |  2 Reviews 
00 of 0 Reviews
Sort by :
Active Filters

00 of 0 Reviews
SEARCH RESULTS
1–2 of 2 Reviews
    BoxerLover2 - 5 Days ago
    A Thrilling But Totally Believable Murder Mystery

    Read this in one evening. I had planned to do other things with my day, but it was impossible to put down. Every time I tried, I was drawn back to it in less than 5 minutes. I sobbed my eyes out the entire last 100 pages. Highly recommend!

    BoxerLover2 - 5 Days ago
    A Thrilling But Totally Believable Murder Mystery

    Read this in one evening. I had planned to do other things with my day, but it was impossible to put down. Every time I tried, I was drawn back to it in less than 5 minutes. I sobbed my eyes out the entire last 100 pages. Highly recommend!


Sample text
Photo of
    Media Viewer

    Sample text
    Reviews
    Reader Type:
    BoxerLover2
    00 of 0 review

    Your review was submitted!
    AMPL: a Modeling Language for Mathematical Programming
    Cengage Learning, Inc -
    AMPL: a Modeling Language for Mathematical Programming
    Writing guidlines
    We want to publish your review, so please:
    • keep your review on the product. Review's that defame author's character will be rejected.
    • Keep your review focused on the product.
    • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
    • Refrain from mentioning competitors or the specific price you paid for the product.
    • Do not include any personally identifiable information, such as full names.

    AMPL: a Modeling Language for Mathematical Programming

    Required fields are marked with *

    Review Title*
    Review
      Add Photo Add up to 6 photos
      Would you recommend this product to a friend?
      Tag this Book
      Read more
      Does your review contain spoilers?
      What type of reader best describes you?
      I agree to the terms & conditions
      You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

      CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

      These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


      By submitting any content to Bookswagon, you guarantee that:
      • You are the sole author and owner of the intellectual property rights in the content;
      • All "moral rights" that you may have in such content have been voluntarily waived by you;
      • All content that you post is accurate;
      • You are at least 13 years old;
      • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
      You further agree that you may not submit any content:
      • That is known by you to be false, inaccurate or misleading;
      • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
      • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
      • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
      • For which you were compensated or granted any consideration by any unapproved third party;
      • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
      • That contains any computer viruses, worms or other potentially damaging computer programs or files.
      You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


      For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


      All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

      Accept

      New Arrivals


      Inspired by your browsing history


      Your review has been submitted!

      You've already reviewed this product!
      ASK VIDYA