Optimization Formula


At its core, an optimization problem is about finding the best possible outcome given certain conditions. The general mathematical formulation is:

minf(x),where xΩRn

Let’s go step by step to understand what each part means.

1. What does x represent?

If there are multiple variables in our problem (e.g., multiple things to decide at once), then x is a vector:

x=(x1,x2,...,xn)

For example, if you are deciding how much money to invest in 3 different assets, your decision variable could be:

x=(x1,x2,x3)="Amount invested in stocks, bonds, and real estate"

2. What is Rn?

💡 Analogy:
Think of R1 as a number line (1D). If you have R2, it’s a plane (2D, like a graph with x and y axes). When you move to R3, you’re in a 3D space. More dimensions? Just extend the idea!

For example:


3. What is f(x)?

For example:

If we minimize f(x), we are looking for the best decision that results in the lowest cost, error, or risk.


4. What is Ω? (Feasible Region)

This is a crucial part, and the previous explanation was too vague. Let’s refine it:

Examples of Ω in Real Life

Example 1: Packing a Suitcase (Constrained Optimization)

Mathematically, if x1,x2,x3 represent the weights of different items, then:

Ω={(x1,x2,x3)x1+x2+x320}

So, Ω is the set of all possible combinations of weights that don’t exceed 20kg. It's not the same as R3 because we have a weight constraint!.


Example 2: Investment Portfolio

Ω={(x1,x2,x3)x1+x2+x3100000,x1,x2,x30}

(We also restrict that investments must be non-negative, meaning you can't invest a negative amount!)