Amazon cover image
Image from Amazon.com

Optimization theory : a concise introduction / Jiongmin Yong.

By: Material type: TextTextLanguage: English Publication details: Singapore ; New Jersey : World Scientific, c2018Description: x, 223 pages : illustrations ; 24 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9789813237643 (hardcover : alk. paper)
Subject(s): LOC classification:
  • QA402.5 Y8 2018
Online resources:
Contents:
Mathematical preparations -- Optimization problems and existence of optimal solutions -- Necessary and sufficient conditions of optimal solutions -- Problems with convexity and quasi-convexity conditions -- Linear programming.
Summary: "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"-- Provided by publisher.
List(s) this item appears in: Print Books 2022
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Materials specified Status Notes Date due Barcode
Books Books Ladislao N. Diwa Memorial Library Reserve Section Non-fiction RUS QA402.5 Y8 2018 (Browse shelf(Opens below)) Room use only 78246 00079192

Includes bibliographical references (page 217) and index.

Mathematical preparations -- Optimization problems and existence of optimal solutions -- Necessary and sufficient conditions of optimal solutions -- Problems with convexity and quasi-convexity conditions -- Linear programming.

"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"-- Provided by publisher.

Fund 164 CD Books International, Inc. Purchased 11/18/2020 78246 pnr PHP 5,428.80 2020-10-371A 2020-1-0324

Copyright © 2023. Cavite State University | Koha 23.05