庫存狀況
折扣
「香港二樓書店」讓您 愛上二樓●愛上書
我的購物車 加入會員 會員中心 常見問題 首頁
「香港二樓書店」邁向第一華人書店
登入 客戶評價 whatsapp 常見問題 加入會員 會員專區 現貨書籍 現貨書籍 購物流程 運費計算 我的購物車 聯絡我們 返回首頁
香港二樓書店 > 今日好書推介
二樓書籍分類
 
Calculus:Applications in Constrained Optimization

Calculus:Applications in Constrained Optimization
放入購物車
沒有庫存
訂購需時10-14天
ISBN 9786267768112
作者 Kwok-Wing Tsoi,Ya-Ju Tsai
出版社 國立臺灣大學出版中心
出版日 2025年8月11日
原價 167.00  元
特價 HK$ 150.3  
訂購


詳
細
資
料
ISBN:9786267768112</li><li>規格:平裝 / 204頁 / 19 x 26 x 1.1 cm / 普通級 / 單色印刷 / 初版</li><li>出版地:台灣

分
類
自然科普 > 數學 > 微積分

內
容
簡
介

<div class="bd">
<div class="content" style="height:auto;">
  Calculus: Applications in Constrained Optimization provides an accessible yet mathematically rigorous introduction to constrained optimization, designed for undergraduate students who have some experiences with multivariable calculus. Based on a successful course at National Taiwan University (NTU) ── Calculus 4: Applications in Economics and Management, this book connects foundational calculus with contemporary techniques of optimization used in economics, management, and data science.<br>
<br>
  Classical tools such as Lagrange multipliers and second derivative tests are extended into a general framework that covers both equality and inequality constraints. Readers will also learn to identify degenerate cases and apply second-order conditions in multivariable settings. Key concepts from linear algebra are introduced and integrated throughout.<br>
<br>
  Each chapter concludes with a carefully structured set of exercises:<br>
  ● Type (A) questions test basic understanding;<br>
  ● Type (B) questions reinforce key examples;<br>
  ● Type (C) questions challenge students to synthesise ideas across topics.<br>
<br>
  Whether used as a course text or for self-study, this book provides a concise, structured, and student-friendly guide to the essential ideas and methods of constrained optimization.
</div><div class="type02_gradient" style="display:none;"></div>
</div></div><div class="mod_b type02_m057 clearfix">
<a name="AuthorP00a400020009">&nbsp;</a>

目
錄

<div class="bd">
<div class="content more_off" id="M201105_0_getProdTextInfo_P00a400020009_h2">
Preface<br>
Acknowledgment<br>
Introduction<br>
<br>
<strong>1 Linear Algebra (I): Vocabulary</strong><br>
1.1 Vector space Rn and its properties<br>
1.2 Subspaces of Rn?<br>
1.3 Linear independence<br>
1.4 Basis and dimension<br>
1.5 Inner product of Rn?<br>
1.6 Gram-Schmidt process<br>
1.7 Exercises for Chapter 1<br>
<br>
<strong>2 Linear Algebra (II): Ranks</strong><br>
2.1 Review on matrices<br>
2.2 Solving equations by Gaussian eliminations<br>
2.3 Applications of Gaussian eliminations<br>
2.4 Rank<br>
2.5 Determinant<br>
2.6 Inverse<br>
2.7 Exercises for Chapter 2<br>
<br>
<strong>3 Linear Algebra (III): Definiteness</strong><br>
3.1 Some special matrices<br>
3.2 Motivation: Complete the squares<br>
3.3 Eigenvalues and eigenvectors<br>
3.4 Diagonalization of symmetric matrices<br>
3.5 Definiteness<br>
3.6 Sylvesters criterion<br>
3.7 Connection with quadratic forms<br>
3.8 Second derivative test and generalization<br>
3.9 Proof of Sylvesters criterion<br>
3.10 Exercises for Chapter 3<br>
<br>
<strong>4 Constrained Optimization (I)</strong><br>
4.1 Optimization: Equality constraints<br>
4.2 Non-degenerate constraint qualifications (NDCQ)<br>
4.3 Worked example: Equality constraints<br>
4.4 Optimization: Inequality constraints<br>
4.5 NDCQ for inequality constrained problems<br>
4.6 Proof of complementary slackness<br>
4.7 Proof of non-negativity of multipliers<br>
4.8 Worked example: Inequality constraints<br>
4.9 Worked examples: Linear programming on R2<br>
4.10 Exercises for Chapter 4<br>
<br>
<strong>5 Constrained Optimization (II)</strong><br>
5.1 Optimization: Mixed constraints<br>
5.2 Worked examples: Mixed constraints<br>
5.3 Optimization: Minimization problems<br>
5.4 Worked example: Minimization problems<br>
5.5 Optimization: Kuhn-Tuckers formulation<br>
5.6 Proof of Kuhn-Tuckers FOC<br>
5.7 NDCQ in Kuhn-Tuckers formulation<br>
5.8 Worked examples : Kuhn-Tuckers formulation<br>
5.9 Exercises for Chapter 5<br>
<br>
<strong>6 Envelope Theorems</strong><br>
6.1 Motivation: Linear budget constraint problem<br>
6.2 Envelope Theorem for equality constraints<br>
6.3 Worked example: Envelope Theorem<br>
6.4 Applications: Shadow prices<br>
6.5 Envelope Theorem for unconstrained problems<br>
6.6 Envelope Theorem for inequality constraints<br>
6.7 Applications in Economics<br>
6.8 Proofs of Envelope Theorems<br>
6.9 Exercises for Chapter 6<br>
<br>
<strong>7 Second Order Conditions</strong><br>
7.1 Motivation : Bordered Hessian matrices<br>
7.2 Bordered Hessian matrices<br>
7.3 Second order conditions: Statement<br>
7.4 Worked examples: Second order conditions<br>
7.5 Second derivative test for unconstrained problems<br>
7.6 Sketch of the proofs of SOC<br>
7.7 Exercises for Chapter 7<br>
<br>
Appendix. Di!erential Calculus<br>
A. Partial derivatives<br>
B. Chain rule for multivariable functions<br>
C. Elementary results of optimization in multivariable<br>
<br>
Answers to Selected Exercises<br>
Bibliography<br>
Index
</div>

序
<div class="bd">
<div class="content more_off" id="M201105_0_getProdTextInfo_P00a400020009_h3">
<strong>Preface</strong><br>
<br>
  Constrained optimization is a critical and contemporary subject across many disciplines. For example, many principles in classical economical theory are developed based on optimization theory to allocate scarce resources optimally. More recently, theory in optimization has been developed rapidly to catch up with the recent trend of Artificial Intelligence and Machine Learning. The increasing demand for knowledge in optimization led the Department of Mathematics at National Taiwan University to offer an 32-hour elective course on constrained optimization (titled ‘Calculus 4 – Applications in Economics and Management’) in the spring of 2019. The course is intended for students who have just finished courses in classical multivariable (differential) calculus.<br>
<br>
  The aforementioned course aims to extend and refine the elementary forms of the second derivative test for functions of two variables and the method of Lagrange multipliers for problems with equality constraints, as introduced in students’ earlier courses. To give a little more detail, these ideas were further developed to handle optimization problems involving both equality and inequality constraints, to identify degenerate points arising from such constraints, to derive Envelope Theorems that capture the sensitivity of the optimal value with respect to variations in the constraints and to formulate second-order conditions for constrained optimization problems in spaces of arbitrary dimension. The course has been well-received by both students and faculty members.<br>
<br>
  To achieve this goal, we will require a substantial background from linear algebra which is the formal language and theory of vectors and matrices. These concepts will be introduced in the beginning. Indeed, optimization theory is one of the many instances in mathematics where (linear) algebra and calculus intersect and enrich each other. The tools of both disciplines work in harmony to deepen our understanding of constrained optimization problems.<br>
<br>
  Although much literature and textbooks already exist on the subject, most are either too advanced or, at the other extreme, lack sufficient mathematical rigor. This book aims to introduce the basics of optimization theory in an intuitive manner that is accessible to undergraduate students who have acquired a standard course in multivariable differential calculus while maintaining some level of mathematical rigor. The authors believe that understanding both applications and mathematical foundations of optimization theory is crucial for preparing students of this generation, correctly, for more advanced courses and future challenges.
</div>


書
評

其 他 著 作