Linear and Nonlinear Programming
by Nash, Stephen G.Edition: 1st
Format: Hardcover
Pub. Date: 1996-01-01
Publisher(s): MCG (Manual)
Other versions by this Author
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $146.16
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This text presents linear and nonlinear programming in an integrated setting and serves as a complete and unified introduction to applications, theory, and algorithms.
Author Biography
Industrial engineering students.
Table of Contents
I Basics1 Optimization Models2 Fundamentals of Optimization3 Representation of Linear ConstraintsII Linear Programming4 Geometry of Linear Programming5 The Simplex MethodIII Introduction6 Duality and Sensitivity7 Enhancements of the Simplex Method8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
2 Fundamentals of Optimization3 Representation of Linear ConstraintsII Linear Programming4 Geometry of Linear Programming5 The Simplex MethodIII Introduction6 Duality and Sensitivity7 Enhancements of the Simplex Method8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
II Linear Programming4 Geometry of Linear Programming5 The Simplex MethodIII Introduction6 Duality and Sensitivity7 Enhancements of the Simplex Method8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
5 The Simplex MethodIII Introduction6 Duality and Sensitivity7 Enhancements of the Simplex Method8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
6 Duality and Sensitivity7 Enhancements of the Simplex Method8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
IV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
Appendixes
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.