Home › Hardcover Books › Optimization Theory: A Concise Introduction

Optimization Theory: A Concise Introduction

by Yong Jiongmin Publisher: WORLD SCIENTIFIC PUB CO INC

A compact survey of core optimization methods

Regular price $82.28 USD
Regular price $91.43 USD Sale price $82.28 USD
Save 10%

Hardcover New English

In stock · Dispatches in 1–2 business days
Delivery to your door
In stock·Dispatches in 1–2 business days
Standard shipping* from $4.35
Standard shipping transit* 5–8 business days after dispatch

Faster options are available.

Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.

Secure checkout
American Express Apple Pay DiscoverGoogle Pay Mastercard PayPalVisa
30-day eligible returns Returns & refunds policy

AlbakiReads Editorial

A compact survey of core optimization methods

This 223-page introduction organizes optimization theory around three areas: nonlinear programming, convex programming, and linear programming. Its coverage includes Lagrange multipliers, the Karush-Kuhn-Tucker and Fritz John methods, optimization with convex or quasi-convex constraints, and geometric and simplex methods for linear programming. The publisher describes the presentation as self-contained and frames the book as material for a one-semester course, giving the volume a clear role as a concise academic introduction rather than an expansive reference.

Good fit for readers who enjoy

  • Upper-level undergraduate students taking a course in optimization theory
  • First- or second-year graduate students seeking an introduction to classical optimization methods
  • Researchers in interdisciplinary fields who need grounding in optimization concepts

Themes

Optimization theoryNonlinear programmingConvex programmingLinear programming

Based on publisher information and book metadata.

Book overview

Mathematically, most of the interesting optimization problems can be formulated to optimize some objective function, subject to some equality and/or inequality constraints. This book introduces some classical and basic results of optimization theory, including nonlinear programming with Lagrange multiplier method, the Karush-Kuhn-Tucker method, Fritz John's method, problems with convex or quasi-convex constraints, and linear programming with geometric method and simplex method.

A slim book such as this which touches on major aspects of optimization theory will be very much needed for most readers. We present nonlinear programming, convex programming, and linear programming in a self-contained manner. This book is for a one-semester course for upper level undergraduate students or first/second year graduate students. It should also be useful for researchers working on many interdisciplinary areas other than optimization.

Shipping & returnsShipping options, delivery timing, and our return policy.

In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.

For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.

Eligible items can be returned within 30 days in accordance with our return policy.

Customer reviews

M
AlbakiReads
Malaika Taylor

I highly recommend to for anyone looking for inner clarity

T
AlbakiReads
Thomas DiMassa

Great service and fast service

Great shopping experience! The book arrived quickly, was well packaged, and matched the description perfectly. I would definitely shop with you again

O
AlbakiReads
Olivia

Smooth.