Topic 1: Introduction to Supply Chain and Optimisation

05115130 Supply Chain Modelling and Optimisation

Lecturer: Sam Wiwatanapataphee

School of EECMS, Curtin University

4 Jun 2026

Goals today

  1. Unit information

  1. Introduction to Supply Chain
  • What is Supply Chain?
  • Supply Chain Network Flows
  • Roles of Logistics in Supply Chain
  • Supply Chain Management (SCM)
  • Push-Pull Strategies in SCM
  • Case Studies
  • Supply Chain Network Design
  1. Review of Optimisation Problems
  • Unconstrained Optimisation
  • Constrained Optimisation
  • Mixed Constrained Optimisation

Materials

Assessments

  1. 20% Assignment
  • Available: 6 June (5 PM), Due: 13 June (5:10 PM)
  • Submit a hard copy in class or submit it digitally via WeChat (ID: cubdwi)
  • If submit via WeChat, please tell me your name (in English) and student ID, and wait for confirmation.
  1. 80% Final Exam (Duration: 2 hours)
  • Formulas are given

Core Readings

Unit Contents

I. Logistics Network Design

  • Single-Echelon Single-Commodity (SESC) Location Models;
  • Two-Echelon Multi-Commodity (TEMC) Location Models;
  • Network Design under Uncertainty

II. Demand Forecasting

  • Time Series Regression Models;
  • Time Series Decomposition

III. Inventory Models

  • Deterministic: Single Commodity, Discount & Multicommodity;
  • Stochastic: Single-Period & Multi-Period Models

1. Introduction to Supply Chain

1.1 What is Supply Chain (SC)?

A SC is a network of individuals and companies involved in the production & distribution of goods or services, from raw material suppliers to manufacturers, …, to the end customers.

1.2 Supply Chain Network Flows

Logistics is the process of coordinating the efficient flow of goods, services, and related information. It involves planning, implementing, and controlling the movement and sometimes warehousing of goods throughout the supply chain. Logistics is a critical component that holds the supply chain together.

1.3 Roles of Logistics in Supply Chain

Transportation management

Planning, organising, and executing movement of goods from one place to another.

Warehousing & inventory management

Managing inventory levels, storing, and retrieving products

Order fulfillment

Handling customer orders from initial receipt to delivery. (Customer services)

Packaging

Designing, producing, and delivering packaging materials and supplies to warehouses

Reverse logistics

Returning goods to their original manufacturer after they have been used.

Static Facilities in Supply Chain

Facility Roles in the SC Operations
Plant/Factory Supplier/Manufacturer Produces or manufactures goods
Warehouse Distributor Stores and holds inventory; often receives shipments from suppliers
Distribution Centre Distributor/Wholesaler Receives, processes, and sends out orders to customers
Fulfillment Centre Distributor Reorders and prepares products for shipping to customers
Cross Dock Distributor Direct transfer of goods from vehicles to vehicles
Locker Distributor Stores non-perishable materials temporarily while being moved between facilities (e.g., inventory, shipping)
Service Outlet Retailer/Service Provider Provides value-added services to customers (e.g., repair, maintenance, consulting)
Parking Lot Dispatcher Supports the movement of personnel and vehicles within the facility
Collection Centre Collector Collects and stores waste materials or hazardous goods temporarily until disposal
Disposal Centre Disposer Handles the removal and destruction of unwanted or hazardous materials

1.4 Supply Chain Management (SCM)

The process of integrating, planning, sourcing, manufacturing, and delivering products from raw materials to end customers, while measuring and evaluating key performance indicators (KPIs) to ensure customer satisfaction and profitability.

SCM Pyramid

This performance management framework is often represented by the SCM Pyramid, which illustrates the hierarchy of SC objectives and performance metrics.

  1. Strategy (Long-term, Top)
  2. Planning (Medium-term, Middle)
  3. Operations (Short-term, Base)

1.4.1 Strategy (Long-term)


  • Aligns with competitive strategy
  • Efficiency vs. Responsiveness
  • Network design
  • Make-or-buy decisions
  • Sustainability & risk management

Example IKEA focuses on cost efficiency and flat-pack design to reduce logistic costs.

1.4.2 Planning (Medium-term)


- Demand forecasting - Aggregate & capacity planning - Inventory planning - Sales & Operations Planning (S&OP) - Distribution & procurement planning

Example Kmart uses demand forecasts to plan inventory before holiday seasons

1.4.3 Operation (Short-term)


  • Order management
  • Production scheduling
  • Inventory & warehouse operations
  • Transportation & logistics
  • Quality & reverse logistics

Example McDonald’s manages daily food deliveries to ensure freshness

1.5 Push vs. Pull Strategy in SC Management

Supply chains can be managed using push, pull, or a hybrid (push–pull) strategy, depending on how demand information is used.

1.5.1 Push Strategy

A push strategy is driven by demand forecasts. Products are produced and distributed in advance, before actual customer orders are received.

Key Characteristics

  • Based on forecasted demand
  • Production starts before customer orders
  • Suitable for stable and predictable demand
  • Focuses on high capacity utilization and low cost

Advantages

  • Economies of scale
  • Lower production costs
  • Efficient for mass production

Disadvantages

  • Risk of overproduction
  • High inventory holding costs
  • Less responsive to demand changes

Example

  • Consumer packaged goods (e.g., canned food, detergents)
  • Traditional manufacturing with long lead times

1.5.2 Pull Strategy

A pull strategy is driven by actual customer demand. Products are produced only after an order is received.

Key Characteristics

  • Based on real customer orders
  • Production starts after demand is known
  • Suitable for uncertain or customized demand
  • Focuses on responsiveness and flexibility

Advantages

  • Lower inventory levels
  • Reduced risk of excess stock
  • High customer satisfaction

Disadvantages

  • Higher unit costs
  • Requires fast response and flexible systems
  • Possible delays if capacity is limited

Example

  • Custom-made products
  • Dell’s build-to-order computers
  • Fast fashion (partially pull-based)

1.5.3 Push–Pull Strategy (Hybrid)

  • Upstream activities (suppliers, manufacturing) use push
  • Downstream activities (final assembly, distribution) use pull

Example : Apple

Push

  • Component sourcing based on forecasts
  • Large-scale manufacturing

Push-Pull Boundary

  • Final assembly & regional distribution

Pull Boundary

  • Customer demand via online & retail stores

Example : Toyota

  • Push for parts production, pull for assembly using Just-In-Time.

Push (Forecast-driven upstream):

  • Suppliers → Parts Production

Push-Pull Boundary

  • Assembly Plants (Just-In-Time)

Pull (Demand-driven downstream)

  • Distribution → Dealers → Customers

Flow Diagram

  • Suppliers → Parts → Assembly Plants → Distribution → Dealers → Customers PUSH         PUSH      BOUNDARY            PULL              PULL          PULL

1.6 Case Studies

Manufacturing Case: Toyota

High inventory cost & production inefficiencies

Implement Just-In-Time (JIT) and lean supply chain strategy

Reduced inventory, faster production cycles, lower costs


Toyota SCM Timeline

  • Plant location
  • Supplier selection
  • Technology investment
  • Production volume planning
  • Capacity & workforce planning
  • Line scheduling
  • Quality checks
  • On-time delivery

Retail Case: Kmart

Demand variability and stockouts across stores

Advanced demand forecasting & centralized planning

High product availability with low inventory costs


Healthcare Case: Hospital Supply Chain

Shortages of critical medical supplies

Strategic supplier partnerships & safety stock planning

Improved patient care and reduced emergency shortages

1.7 Supply Chain Network Design

Supply chain network design is the strategic configuration of a supply chain with the following objectives.

  • Minimise total supply chain cost
  • Reduce lead time
  • Improve customer service
  • Optimise inventory and resources
  • Increase coordination across the supply chain
  • Maximise overall supply chain profitability

The following factors affect network design:

  • Demand Forecasting
  • Location of Facilities
  • Inventory Management
  • Network Capacity
  • Supplier & Vendor
  • Management
  • Customer Service Levels
  • Technology & Information Systems
  • Regulatory & Compliance
  • Cost Analysis
  • Risk Management
  • Sustainability & Environmental Impact
  • Competitive Factors
  • Market Dynamics
  • Globalisation

2. Review of Optimisation Problems

Optimisation is the mathematical discipline that deals with maximising and minimising functions under certain conditions or constraints.

  • These functions are called objective functions.
  • There are 2 types of optimisation problems, depending on whether there is constraint on the decision variables \(x\) and \(y.\)

Unconstrained optimisation

\[\min f(x,y) = x^2+2y^2 \]

Constrained optimisation

\[\min f(x,y) = x^2 + 2y^2 \] \[-2<x<5,\, y \ge 1\]

Code
import numpy as np
import matplotlib as mpl
import matplotlib.pyplot as plt

mpl.rcParams['font.size'] = 14 

x = np.linspace(-5, 5, 200)
y = np.linspace(-5, 5, 200)
X, Y = np.meshgrid(x, y)

Z = X**2 + 2*Y**2

fig = plt.figure()
ax=fig.add_subplot(projection='3d')
ax.plot_surface(X, Y, Z)

ax.set_xlabel("X")
ax.set_ylabel("Y")
ax.set_zlabel("Z")
ax.set_title("f(x, y) = x² + 2y²")

plt.show()

Code
x = np.linspace(-2, 5, 200)
y = np.linspace(0, 5, 200)
X, Y = np.meshgrid(x, y)

Z = X**2 + 2*Y**2

fig = plt.figure()
plt.contour(X, Y, Z, levels=50)
plt.xlabel("X")
plt.ylabel("Y")
plt.title("f(x, y) = x² + 2y², x ∈ (-2, 5), y ∈ (0, ∞)")
plt.show()

2.1 Local Maximum and Minimum

First order

\[ \begin{align*} &f'(x^*) = 0,\\ x^* \,&\text{is the critical point} \end{align*} \]


Second order

\[ \begin{align*} f''(x^*)<0, \; &x^* \text{is (local) max.}\\ f''(x^*)>0, \; &x^* \text{is (local) min.}\\ f''(x^*)=0, \; &x^* \text{can be max, min or neither.} \end{align*} \]

Example. Find the local max and min points of \(f(x)=x^3-6x^2+9x\)

\[ \begin{align*} f'(x)=3x^2-12x+9 &= 0 \\ 3(x^2-4x+3) &= 0 \\ 3(x-3)(x-1) &= 0 \\ x^* &= 1, 3 \end{align*} \]

\[ f(1)=4 \rightarrow (1,4), \; f(3)=0 \rightarrow (3,0) \]

\[ \begin{align*} f''(x) &= 6x-12=6(x-2) \\ f''(1) &= -6 < 0 \\ &\rightarrow \textbf{local max at } (1,4) \\ f''(3) &= 6 > 0 \\ &\rightarrow \textbf{local min at } (3,0) \end{align*} \]

Finding critical points of f(x) = x³ - 6x² + 9x
import numpy as np
import matplotlib as mpl
import matplotlib.pyplot as plt

mpl.rcParams['font.size'] = 18 

# Define the function
def f(x):
    return x**3 - 6*x**2 + 9*x

# Generate x values
x = np.linspace(-1, 5, 400)
y = f(x)

x_crit = np.array([1, 3])
y_crit = x_crit**3 - 6*x_crit**2 + 9*x_crit

x_crit, y_crit
(array([1, 3]), array([4, 0]))


Plotting f(x) and its critical points
# Plot
plt.figure(figsize=(6,4))
plt.plot(x, y)
plt.scatter(x_crit, y_crit, s=150, color='red', zorder=3)
plt.xlabel("x")
plt.ylabel("f(x)")
plt.title("f(x) = x³ - 6x² + 9x")
plt.grid(True)

plt.show()

Are these the ultimate maximum and minimum of the function \(f(x)\)?

2.2 Global Maximum and Minimum

Optima can occur in the three places:

  1. The boundary of the domain
  2. A non-differentiable point
  3. A point \(x^∗\) with \(\nabla f(x^*)=0.\)
    (i.e. \(f'(x^*)=0\) for 1D)


Then,

  • A local maximum is a point that \(f(x^*) \geq f(x), \forall x\,\) in some open interval containing \(x^*.\)

  • A local minimum is a point that \(f(x^*) \leq f(x), \forall x\,\) in some open interval containing \(x^*.\)

  • A global maximum is a point that \(f(x^*) \geq f(x), \forall x\,\) in the domain of \(f.\)

  • A global minimum is a point that \(f(x^*) \leq f(x), \forall x\,\) in the domain of \(f.\)

From the second derivatives, we can conclude that

  • When \(f''(x) \geq 0, \forall x,\) i.e., \(f(x)\) is a convex function, then the local minimum \(x^*\) is the global minimum of \(f(x).\)
  • When \(f''(x) \leq 0, \forall x,\) i.e., \(f(x)\) is a concave function, then the local maximum \(x^*\) is the global maximum of \(f(x).\)

Example. Find the local and global maximum and minimum points of the function \(f(x)=x^3+3x^2-2x+1\) for \(x \in [-4,2]\)

\[f'(x)=3x^2+6x-2=0\]

\[ \begin{align*} x &= \frac{-b \pm \sqrt{b^2-4ac}}{2a} \\ &= \frac{-6 \pm \sqrt{6^2-4(3)(-2)}}{2(3)} \\ x_1 &= -1-\sqrt{15}/3, \\ x_2 &= -1+\sqrt{15}/3 \end{align*} \]

\[(x_1,y_1) = (-2.29, 9.30)\] \[(x_2, y_2) = (0.29, 0.70)\]

\[ \begin{align*} f''(x) &= 6x+6 \\ f''(x_1) &= -7.75 <0 \\ &\rightarrow (-2.29, 9.30) \textbf{ is local max} \\ f''(x_2) &= 7.75 >0 \\ &\rightarrow (0.29, 0.70) \textbf{ is local min} \end{align*} \]

Check the boundaries: \[ \begin{align*} f(-4) &= -7 \\ &\rightarrow (-4,-7) \textbf{ is global min}\\ f(2) &= 17 \\ &\rightarrow (2,17) \textbf{ is global max} \end{align*} \]

Code
# Define the function
def f(x):
    return x**3 + 3*x**2 - 2*x + 1

# Generate x values
x = np.linspace(-4, 2, 400)
y = f(x)

# Plot the function
plt.figure()
plt.plot(x, y)
plt.scatter(-4, -7, s=150, color='red', zorder=3)
plt.scatter(2, 17, s=150, color='red', zorder=3)
plt.scatter(-2.29, 9.3, s=150, color='blue', zorder=3)
plt.scatter(0.29, 0.7, s=150, color='blue', zorder=3)
plt.xlabel("x")
plt.ylabel("f(x)")
plt.title("f(x) = x³ + 3x² − 2x + 1")
plt.grid(True)
plt.show()

2.3 Hessian Matrix (2nd Derivative Test)

To find the maximum and minimum values for a function \(f(x)\) of several independent variable \(x\), we

  1. calculate \(\nabla f(x)\) and set it to zero,
  2. solve the equation to get a solution vector \(x^*,\)
  3. calculate \(\nabla^2 f(x)\), and evaluate \(\nabla^2 f(x)\) at \(x^*.\)

For a scalar function of several variables \(f: \mathcal{R}^n \rightarrow \mathcal{R}\,\), we conduct second derivative test by setting up the Hessian matrix given by

\[ \mathbf{H}(x)\equiv\nabla^2 f(\mathbf{x}) = \begin{bmatrix} \dfrac{\partial^2 f}{\partial x_1^2} & \dfrac{\partial^2 f}{\partial x_1 \partial x_2} & \cdots & \dfrac{\partial^2 f}{\partial x_1 \partial x_n} \\[-.5em] \dfrac{\partial^2 f}{\partial x_2 \partial x_1} & \dfrac{\partial^2 f}{\partial^2 x_2} & \cdots & \dfrac{\partial^2 f}{\partial x_2 \partial x_n} \\[-1em] \vdots & \vdots & \ddots & \vdots \\[-.5em] \dfrac{\partial^2 f}{\partial x_n \partial x_1} & \dfrac{\partial^2 f}{\partial x_n \partial x_2} & \cdots & \dfrac{\partial^2 f}{\partial^2 x_n} \end{bmatrix} \]

2.3.1 Quadratic Form Test (Definition-Based)

Suppose that \(x^*\) is a critical point of \(f(x)\), i.e., \(\nabla f(\mathbf{x}^*)=0,\) and \(\mathbf{H(x^*)}\) is symmetric matrix. The expression

\[ Q(\mathbf{x})=\mathbf{x}^T\mathbf{Hx} \]

is a scalar known as the quadratic form associated with \(\mathbf{H}\). Then, we can conclude that

\(Q(\mathbf{x})\) Hessian Type Critical Point Conclusion
\(>0, \forall \mathbf{x}\neq0\) Positive definite Local minimum
\(<0, \forall \mathbf{x}\neq0\) Negative definite Local maximum
\(\geq0, \text{some } 0\) Positive semi-definite Inconclusive – min or saddle
\(\leq0, \text{some } 0\) Negative semi-definite Inconclusive – max or saddle
\(=0, \forall \mathbf{x}\neq0\) Zero matrix Inconclusive – higher-order needed
\(\exists\mathbf{x}: Q>0, \newline \exists\mathbf{y}:Q<0\) Indefinite Saddle point

2.3.2 Eigenvalue Test

For any \(n \times n\) square matrix \(\mathbf{H}\) the eigenvalues \(\lambda\) are the roots of the characteristic polynomial: \[ \det(\mathbf{H}-\lambda\mathbf{I})=0. \] This gives a degree-\(n\) polynomial in \(\lambda.\) The roots of this polynomial are the eigenvalues.

Eigenvalues of H Hessian Type Critical Point Conclusion
All positive Positive definite Local minimum
All negative Negative definite Local maximum
All +, at least one zero Positive semi-definite Inconclusive: min/saddle
All -, at least one zero Negative semi-definite Inconclusive: max/saddle
All zero Zero matrix Inconclusive: higher-order needed
Mixed signs Indefinite Saddle point

Eigenvalue (Review)

For any \(n\times n\) square matrix \(\mathbf{A}\), the eigenvalues \(\lambda\) are the roots of the characteristic polynomial: \(\det(\mathbf{A}-\lambda\mathbf{I})=0.\)

For a symmetric \(2\times 2\) matrix, \(\mathbf{A}=\begin{bmatrix} a&b\\c&d \end{bmatrix}\)

\[ \det(\mathbf{A}-\lambda\mathbf{I}) = \begin{vmatrix} a-\lambda & b \\ c & d-\lambda \end{vmatrix} = (a-\lambda)(d-\lambda)-bc \]

For a symmetric \(3\times 3\) matrix, \(\mathbf{A}=\begin{bmatrix} a&b&c\\d&e&f\\g&h&i \end{bmatrix}\) \[ \begin{align*} \det(\mathbf{A}-\lambda\mathbf{I}) &= \begin{vmatrix} a-\lambda & b & c \\ d & e-\lambda & f \\ g & h & i-\lambda \end{vmatrix} \\ &= (a-\lambda) \begin{vmatrix} e-\lambda & f \\ h & i-\lambda \end{vmatrix} - b \begin{vmatrix} d & f \\ g & i-\lambda \end{vmatrix} + c \begin{vmatrix} d & e-\lambda \\ g & h \end{vmatrix} \end{align*} \]

For matrix size \(n\times n\), \(n>4\), there’s no general formula and numerical methods are needed for calculation.

Example. Find to local maximum and minimum points of \(f(x,y)=x^3-y^3+9xy.\)

  1. Calculate the first order partial derivatives, i.e., gradient of \(f(x,y)\) and set them equal to zero \[ \nabla f(x,y) = \begin{pmatrix} \dfrac{\partial f }{\partial x} \\ \dfrac{\partial f}{\partial y}\end{pmatrix} = \begin{pmatrix} 3x^2+9y \\ -3y^2+9x \end{pmatrix} = 0 \]


  1. Solve for \((x^*,y^*)\)

From \(\partial f/\partial x, \qquad 3x^2+9y=0 \rightarrow y = -\dfrac{x^2}{3}\)

Substitute into \(\partial f/\partial y, \qquad -3\left(-\dfrac{x^2}{3}\right)^2 + 9x = x\left(-\dfrac{x^3}{3}+9\right) = 0 \rightarrow x=0,3\)


Critical points are \((0,0)\) and \((3, -3)\)

  1. Compute the Hessian matrix of \(f(x,y)\) \[ \nabla^2 f(x,y) = \begin{bmatrix} \dfrac{\partial^2 f}{\partial x^2} & \dfrac{\partial^2 f}{\partial x \partial y} \\ \dfrac{\partial^2 f}{\partial y \partial x} & \dfrac{\partial^2 f}{\partial y^2} \end{bmatrix} = \begin{bmatrix} 6x & 9 \\ 9 & -6y\end{bmatrix} \]

  2. Evaluate the Hessian at critical points

At \((0,0): H=\begin{bmatrix}0&9\\9&0\end{bmatrix}\)

\[ \det(H-\lambda I) = \begin{vmatrix}-\lambda&9\\9&-\lambda\end{vmatrix} = \lambda^2-9^2 = (\lambda-9)(\lambda+9)=0 \]

\(\therefore\lambda = -9, 9 \rightarrow\) Mixed signs \(\rightarrow\) Indefinite \(\rightarrow\) Saddle point at \((0,0)\)

At \((3,-3): H=\begin{bmatrix}18&9\\9&18\end{bmatrix}\)

\[ \det(H-\lambda I) = \begin{vmatrix}18-\lambda&9\\9&18-\lambda\end{vmatrix} = (18-\lambda)^2-9^2 = (9-\lambda)(27-\lambda)=0 \]

\(\therefore\lambda = 9, 27 \rightarrow\) Both positive \(\rightarrow\) Positive definite \(\rightarrow\) Local minimum at \((3,-3)\)

Code
import numpy as np
import matplotlib.pyplot as plt

# Define the function
def f(x, y):
    return x**3 - y**3 + 9*x*y

# Create grid
x = np.linspace(-5, 5, 400)
y = np.linspace(-5, 5, 400)
X, Y = np.meshgrid(x, y)
Z = f(X, Y)

# Contour plot
plt.figure()
plt.contour(X, Y, Z, levels=30)
plt.xlabel('x')
plt.ylabel('y')
plt.show()

2.3.3 Hessian Matrix in Action

Suppose a company’s profit function is given by

\[ f(q_1,q_2)=q_1(50-5q_1)+q2(100-10q_2)-(90+20(q_1+q_2)). \]

  1. Find the critical points \(\quad\nabla f(q_1,q_2) = \begin{bmatrix} 50-10q_1-20 \\ 100-20q_2-20 \end{bmatrix} = 0\)

\(q_1=3\) and \(q_2=4\)

  1. Setup Hessian matrix \(\nabla^2 f(q_1,q_2)=\begin{bmatrix} -10 & 0 \\ 0 & -20\end{bmatrix}\)

  2. Determine the eigenvalue(s) of the Hessian matrix

\[ \det(H-\lambda I) = \begin{vmatrix} -10-\lambda & 0 \\ 0 & -20-\lambda \end{vmatrix} = (\lambda+10)(\lambda+20)=0 \]

\(\therefore \lambda=-10,-20 \rightarrow\,\) Negative definite \(\rightarrow\) Local max at \((3,4)\) output level

2.4 Constrained optimisation: Lagrange Multiplier Method

\[ \begin{align*} \max/\min \qquad &f(x_1,x_2,...,x_n) \\ \text{subject to} \qquad &g_i(x_1,x_2,...,x_n)=0,\quad i=1,2,...,m \end{align*} \]

  1. Construct the Lagrange function \[ F=f(x_1,x_2,...,x_n)-\sum_{i=1}^m \lambda_i g_i(x_1,x_2,...,x_m)=f-\lambda g \]

  2. Find all values of \((x_1,x_2,...,x_n)\) such that \[ \begin{cases} \frac{\partial F}{\partial x_i}=0, & (i=1,2,...,n) \\ g_i=0, & (i=1,2,...,m) \quad (\text{obtained from } \frac{\partial F}{\partial \lambda_i}=0) \end{cases} \]

  3. Evaluate \(f(x_1,x_2,...,x_n)\) at all the points that result from step 2.

  • The largest of these values is the max of 𝑓 subject to the constraints;
  • The smallest is the min of 𝑓 subject to the constraints.

Example. Find the extreme values of \(f(x,y)=x^2-2y^2\) on the circle \(x^2+y^2=1\)


In this case, our constraint is \(\quad g(x,y)=x^2+y^2-1=0\)

  1. Construct the Lagrange function \[ F=f-\lambda g=x^2-2y^2-\lambda(x^2+y^2-1) \]

  2. Find all values of \((x_1,x_2,...,x_n)\) \[ \begin{cases} \dfrac{\partial F}{\partial x}=2x-2\lambda x=0, & \rightarrow x(1-\lambda)=0 \,\;\;\qquad (1)\\ \dfrac{\partial F}{\partial y}=-4y-2\lambda y=0, & \rightarrow -y(2+\lambda)=0 \qquad (2)\\ \dfrac{\partial F}{\partial \lambda}=-(x^2+y^2-1)=0, & \hfill (3) \end{cases} \]

From \((1), x=0\) or \(\lambda=1.\)

  • If \(x=0, (3)\) yields \(y=1, -1.\)
  • If \(\lambda=1, (2)\) yields \(y=0,\) and consequently \((3)\) yields \(x=1,-1\).

Hence, \(f\) has possible extreme values at the points \((0, 1), (0, -1), (1, 0), (-1, 0)\)

  1. Evaluating \(f\) at these points gives \[f(0,1)=2,\quad f(0,−1)=2,\quad f(1,0)=1,\quad f(−1,0)=1 \]

\(\therefore \min f = f(\pm 1,0)=1, \quad \max f = f(0, \pm 1)=2\)

2.5 Mixed Constrained Optimisation

A general mixed constrained multi-dimensional problem is

\[ \begin{align*} \text{Min/Max} \quad &f(x),\; x\in\mathcal{R}^n \\ \text{subject to} \quad &h_i(x) = 0, \quad i=1,2,...,m \quad \text{Equality constraints} \\ &g_j(x) \leq 0, \quad j=1,2,...,p \quad \text{Inequality constraints} \end{align*} \]

The Lagrangian function is

\[ \begin{aligned} L(x,\lambda,\mu)&=f(x)+\sum_{i=1}^m\lambda_i h_i(x)+\sum_{j=1}^p\mu_jg_j(x), \quad \text{Minimisation problem} \\ L(x,\lambda,\mu)&={\color{red}-}f(x)+\sum_{i=1}^m\lambda_i h_i(x)+\sum_{j=1}^p\mu_jg_j(x), \quad \text{Maximisation problem} \end{aligned} \]

where \(\lambda_i\) are the multipliers for the equality constraints and \(\mu_i\) for the inequality constraints.

The Karush-Kuhn-Tucker (KKT) conditions are necessary for a point \(x^*\) to be a local minimum (assuming suitable regularity conditions).

2.5.1 The Karush-Kuhn-Tucker (KKT) conditions

  1. Stationarity Compute the first-order partial derivatives of \(L\) with respect to \(x_i, \lambda\) and \(\mu\), and set them equal to zero. Solve for \(x_i, \lambda\) and \(\mu\).

Minimising \(f(x)\):

\(\qquad \nabla_x L(x^*,\lambda^*,\mu^*)=\nabla f(x^*)+\sum_{i=1}^m \lambda_i^*\nabla h_i(x^*)+\sum_{j=1}^p \mu_j^*\nabla g_j(x^*)=0\)

Maximising \(f(x)\):

\(\qquad\nabla_x L(x^*,\lambda^*,\mu^*)={\color{red}-}\nabla f(x^*)+\sum_{i=1}^m \lambda_i^*\nabla h_i(x^*)+\sum_{j=1}^p \mu_j^*\nabla g_j(x^*)=0\)

  1. Primal feasibility \(\; h_i(x^*)=0, \; i=1,...,m, \;\text{and} \;\; g_j(x^*)\leq 0, \; j=1,...,p\)

  2. Dual feasibility \(\quad \mu_j^* \geq 0, \; j=1,...,p\)

  3. Complementary slackness \(\quad \mu_j^* g_j(x^*)=0, \; j=1,...,p\)

Example.

\[ \begin{align*} \text{Minimise} \quad &x^2+y^2 \\ \text{subject to} \quad &h(x,y)=x+y-1=0 \\ &g(x,y)=x-0.5\leq 0 \end{align*} \]

  1. From the Lagrangian \(\quad L=x^2+y^2+\lambda(x+y-1)+\mu(x-0.5)\)

  2. Compute the partial derivatives (stationarity)

\[\begin{align*} \nabla_x L &= 2x+\lambda+\mu =0, \tag{1} \\ \nabla_y L &= 2y+\lambda =0, \tag{2} \\ \nabla_\lambda L &= (x+y-1)=0, \tag{3} \\ \nabla_\mu L &= x-0.5=0, \quad \text{if }\mu>0. \tag{4} \end{align*}\]

Note that if the inequality constraint is inactive (i.e. \(x−0.5<0\)), then \(\mu\) can be zero. However, if it is active (i.e. \(x−0.5=0\)), then \((4)\) must hold.

  1. Solve the system
  • From \((4), x=0.5.\)
  • Substitute \(x=0.5\) into \((3)\) yields \(y=0.5.\)
  • Substitute \(y=0.5\) into \((2)\) yields \(\lambda=-1.\)
  • Substitute \(x=0.5\) and \(\lambda=−1\) into \((1)\) yields \(\mu=0.\)
  1. Verify the KKT conditions
  • Stationarity: Equation \((1)\) and \((2)\) are satisfied with the computed value.

  • Primal feasibility: We have \(x+y=1\) and \(g(x,y)=0.5−0.5=0\)
    (thus \(x−0.5=0\leq0\))

  • Dual feasibility: \(\mu=0\geq 0\)

  • Complementary slackness: \(\mu\,g(x,y)=0\cdot 0 =0\)

\(\therefore\) the candidate optimal point is \((x,y)=(0.5, 0.5)\) with the objective minimum of \(f(0.5, 0.5)=0.5.\)