AI engineering glossary · Calculus optimisation
What is feasible region?
Feasible region: The set of all points that satisfy every constraint of an optimisation problem. The best feasible point is the answer. For linear constraints it is a polygon or polyhedron, and for convex problems it is a convex set.
Feasible region: an example
With x >= 0, y >= 0 and x + y <= 4, the feasible region is the triangle with corners (0, 0), (4, 0) and (0, 4).
Related terms
More Calculus optimisation terms
- Finite difference
- First-order condition
- Flat minimum
- Forward-mode automatic differentiation
- Function
- Fundamental theorem of calculus
- Gauss-Newton method
- Genetic algorithm
Where you learn it
Feasible region is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.