Constrained Optimization definition
Constrained optimization finds the best value of a function among inputs that satisfy stated requirements.
Constrained Optimization in a picture
How it works
The allowed inputs form a feasible set. The optimum can occur on a boundary, at an interior point, or fail to exist if the set or function does not support one. Methods include substitution, graphing linear constraints, or using Lagrange multipliers for appropriate equality constraints.
Worked examples
Maximize x + y subject to 0 ≤ x ≤ 3 and 0 ≤ y ≤ 2.
Take (3, 2), giving the largest allowed value 5.
Can an unconstrained maximizer violate the model requirements?
Yes. If it violates a constraint, it is not a candidate for the constrained problem.
What makes the two-side rectangle example a constrained problem?
The perimeter fixes the allowed pairs of side lengths.
Common mistake
Identify the feasible set before comparing objective values. A point with a better objective is irrelevant if it violates a requirement.
Quick check
Can a constrained optimum occur on the boundary?
Show answer
Yes.
What is the objective in a maximum-area problem?
Show answer
The area as a function of the decision variables.
Sources
Flashcard
Constrained Optimization
Reveal the definition
Constrained optimization finds the best value of a function among inputs that satisfy stated requirements.
Effortless Math. “Constrained Optimization.” Math Dictionary.
