This course provides a rigorous foundation in mathematical programming techniques for economic modeling. The focus is on applying mathematical tools from set theory, topology, calculus, and optimization to solve economic problems. By the end of the course, students will be able to analyze unconstrained and constrained optimization problems in microeconomics, macroeconomics, and finance.
📌 Objective: Introduce essential mathematical tools for optimization and economic modeling.
Sets, subsets, and Cartesian products
Open, closed, compact, and convex sets
Relations and functions
Metric spaces and Euclidean topology
Convergence and continuity
Compactness and connectedness
Economic applications: Existence of equilibrium, Weierstrass theorem
Limits, continuity, and differentiability
Partial derivatives and directional derivatives
Taylor’s theorem and approximation
Economic applications: Marginal analysis, production functions
Positive definite, semi-definite, and negative definite matrices
Eigenvalues and their economic interpretation
Economic applications: Second-order conditions for optimization
Convex sets and convex functions
Jensen’s inequality
Economic applications: Risk aversion, cost minimization, utility maximization
📌 Objective: Develop techniques to solve optimization problems without constraints.
Definition of optimization: Maximization vs. Minimization
Economic motivation: Profit maximization, cost minimization, consumer utility maximization
Graphical intuition: Tangency conditions and critical points
Definition of stationary points: ∇𝑓(𝑥) = 0
Interpretation: Economic meaning of marginal conditions
Existence of local extrema
Hessian matrix: Definition and intuition
Positive definite, negative definite, and their economic implications
Second derivative test for local optima
Application to profit maximization and cost minimization
Iterative approach to finding local optima
Convergence properties
Applications in economic modeling
Consumer theory: Maximizing utility subject to budget constraints (Lagrangian method preview)
Production theory: Profit maximization and cost minimization
Dynamic optimization preview: Intertemporal consumption choice
📌 Objective: Solve constrained optimization problems using the Lagrange method.
Why constraints? Economic relevance
Geometric intuition: Tangency conditions
Setting up the Lagrangian: L(x,λ)=f(x)+λg(x)L(x, \lambda) = f(x) + \lambda g(x)L(x,λ)=f(x)+λg(x)
First-order necessary conditions (FOCs): Stationarity, feasibility, and interpretation of multipliers
Economic meaning of Lagrange multipliers: Shadow prices
Hessian bordered by constraints
Positive and negative definiteness conditions
Interpretation of curvature in constrained spaces
Differentiating the value function
Sensitivity analysis of constraints
Economic applications: Taxation, consumer surplus, and producer surplus
Consumer theory: Utility maximization subject to budget constraints
Firm theory: Cost minimization subject to production constraints
General equilibrium: Walrasian equilibrium and constrained optimization
📌 Objective: Introduce the Kuhn-Tucker conditions for non-linear constrained optimization.
When equality constraints are not enough
Economic motivation: Nonlinear pricing, labor supply, and firm production decisions
Definition of the Karush-Kuhn-Tucker (KKT) conditions
Complementary slackness: Economic interpretation
Feasibility and Lagrange multipliers for inequalities
Convexity in optimization problems
Strong duality theorem and its economic significance
Slater’s condition and its implications
Nonlinear pricing: Price discrimination in monopoly
Taxation: Optimal income taxation under constraints
General equilibrium with constraints: Existence and welfare analysis
Simon & Blume (1994) – Mathematics for Economists (Optimization & Economic Applications)
Sundaram (1996) – A First Course in Optimization Theory (Mathematical Foundation of Optimization)
Amir Beck (2022) – Introduction to Nonlinear Optimization: Theory, Algorithms, and Applications with Python and MATLAB (Numerical methods for optimization)
Stephen Boyd & Lieven Vandenberghe (2004) – Convex Optimization (Advanced convex programming and duality)
Nocedal & Wright (2006) – Numerical Optimization (Optimization algorithms and computational methods)