Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (International Series in O,Used

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (International Series in O,Used

SKU: SONG1402071736 Out of Stock
Sale price$98.68 Regular price$140.97
Sold out Save $42.29
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, highlevel algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Related Products

You may also like

Frequently Asked Questions

  • Q: What is the main focus of 'Potential Function Methods for Approximately Solving Linear Programming Problems'? A: The book focuses on breaking new ground in linear programming theory, exploring approximation algorithms for classes of linear programming problems.
  • Q: Who is the author of this book? A: The author is Daniel Bienstock, a recognized expert in optimization research.
  • Q: What topics are covered in this book? A: The book covers linear and integer programming, numerical analysis, and computational architectures that aid in algorithm design.
  • Q: What is the condition of the book being sold? A: The book is listed as 'New', ensuring it is in pristine condition.
  • Q: How many pages does the book contain? A: The book contains a total of 130 pages.
  • Q: What type of binding does this book have? A: The book is bound in hardcover, providing durability and a professional appearance.
  • Q: When was this book published? A: The book was published on August 31, 2002.
  • Q: What is the significance of the research discussed in the book? A: The research represents a new body of work in optimization, focusing on developing effective approximation algorithms with strong theoretical foundations.
  • Q: Is this book suitable for beginners in linear programming? A: While the book provides valuable insights, it is recommended for readers with some foundational knowledge in linear programming and optimization theory.
  • Q: Does this book include practical examples of algorithms? A: Yes, the book examines various algorithms, starting from early examples to the latest theoretical and computational advancements.