Nonlinear Programming Analysis by Mordecai Avriel (15 items)

Pearson College Div. Acceptable. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Dover Publications, 2003-09-16. paperback. Good. 5x1x8. Softcover shows moderate cover wear. Text is unmarked. Ships FAST!

Dover Publications. New. BRAND NEW, GIFT QUALITY! NOT OVERSTOCKS OR MARKED UP REMAINDERS! DIRECT FROM THE PUBLISHER!

Dover Publications, 2003-09-16. paperback. Used: Good. 5.22x1.08x8.66. Buy with confidence. Excellent Customer Service & Return policy.

Dover Publications, 2003-09-16. paperback. New. 5.22x1.08x8.66. Buy with confidence. Excellent Customer Service & Return policy.

0000-00-00. hardcover. Used: Good. xx. Buy with confidence. Excellent Customer Service & Return policy.

Pearson College Div. hardcover. Good. 1.8x09x2.1. Buy with confidence. Excellent Customer Service & Return policy.

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.

Paperback. New.

Paperback. New.

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.

Dover Pubns, 2003. Paperback. New. 528 pages. 8.25x5.00x1.00 inches.

Dover Publications, 2003-09-16. Paperback. New. New. In shrink wrap. Looks like an interesting title!

0000-00-00. hardcover. New. xx. Buy with confidence. Excellent Customer Service & Return policy.

Nonlinear Programming: Analysis and Methods
Mordecai Avriel Pearson / Prentice‑Hall, 1976 ISBN 0136236030 / 9780136236030 Language: English
Book Description
A foundational text in optimization theory, Avriel's Nonlinear Programming: Analysis and Methods provides a comprehensive and rigorous treatment of nonlinear optimization, covering both theoretical foundations and practical algorithms. The book develops the mathematical structure of unconstrained optimization, constrained optimization, Lagrange multipliers, convexity, duality, penalty and barrier methods, and iterative numerical techniques. Long regarded as one of the most complete single‑volume treatments of nonlinear programming, it remains widely cited in operations research, applied mathematics, engineering, and computational optimization. This copy comes from the Hassan Aït‑Kaci technical library, reflecting his broader engagement with mathematical methods underlying computation, constraint systems, and optimization‑based reasoning.