Equality
1' w = 1
The weights must sum to one. This encodes full investment.
A portfolio optimizer does not choose from every possible portfolio. It chooses the best portfolio from the portfolios you allow.
After this lesson, you should be able to translate common portfolio rules into constraints and predict whether they keep the problem solver-friendly.
From Lesson 0001, a simple formulation was:
maximize mu' w - gamma * w' Sigma w
subject to 1' w = 1
w >= 0
The objective says what is best. The constraints say what is allowed. The set of all allowed portfolios is the feasible set.
Constraints come in two basic forms. Equalities must match exactly; inequalities define upper or lower limits.
1' w = 1
The weights must sum to one. This encodes full investment.
0 <= w_i <= 0.10
Each asset weight must stay between zero and ten percent.
In convex portfolio optimization, affine equalities and affine inequalities are usually easy for solvers. Many useful constraints are just careful combinations of these.
These are not just mathematical decorations; they encode mandate, liquidity, risk, and implementation rules.
w >= 0: no shorting.
l <= w <= u: no name gets too small or too large.
||w||_1 <= L: gross exposure is capped.
||w - w0||_1 <= tau: trading from current holdings is limited.
l <= F' w <= u: sector, style, or risk exposure is controlled.
count(w_i != 0) <= k: useful, but usually nonconvex.
In this two-asset example, the portfolio is always fully invested because asset B gets whatever asset A does not. The remaining question is whether bounds and turnover rules allow the chosen weight.
Current portfolio is 60% A / 40% B. Rules: A between 20% and 70%; B no more than 65%; turnover below the selected cap.
If the feasible set is empty, no optimizer can rescue the model. If the feasible set is too loose, the solution may be mathematically optimal but economically useless.
Many portfolio constraints preserve convexity: budget, long-only, bounds, leverage caps, turnover caps, and linear factor exposure limits. Some constraints break convexity: exact cardinality limits, minimum trade sizes, and fixed transaction costs often require mixed-integer optimization or approximations.
1' w = 1 usually mean in portfolio optimization?Use the MOSEK Portfolio Optimization Cookbook for concrete portfolio constraint variants, especially constraints, transaction costs, and cardinality-related modeling. Use Boyd and Vandenberghe's Convex Optimization for the general theory of affine constraints and convex feasible sets.
Keep the constraint reference open while reading. The local Optimization Bootcamp PDF is useful for the broader constrained-optimization vocabulary.