# Feasible

### From Glossary

A point is feasible if it satisfies all
constraints. The *feasible region* (or *feasibility
region*) is the set of all feasible points. A mathematical
program is feasible if its feasible region is not empty.

The term feasible doesn't imbue other properties such as convexity or connectedness. For example, a feasible region to a nonlinear program could be , which is the disjoint union .

[edit]

Convex set |

If any two points are in the set, so is their line segment, i.e.

for any . See Myths and Counter Examples in Mathematical Programming.