Feasible sets
The feasible set contains exactly the decisions satisfying all stated constraints.
On this page 7 sections
01A decision is feasible when it satisfies every stated constraint#
A decision is feasible when it satisfies every stated constraint. Check their intersection, including the domain and each inequality.
A low objective value cannot compensate for breaking a constraint.
For x≥0, y≥0 and x+y≤8, the point (3,5) uses the entire budget and remains feasible.
, . Choose a feasible point.
Show answer and explanation
At (2, 4), both coordinates are nonnegative and use 6 units.
02Resource restrictions are constraints too#
Resource restrictions are constraints too. Add the usage from each quantity and compare it with the available capacity.
Nonnegativity is a separate requirement; a negative count cannot free up imaginary resources.
Nonnegative use capacity units. Capacity is at most . Choose a feasible point.
Show answer and explanation
Uses 13; x,y≥0.
03The boundary belongs to x+yle8, but not to x+y<8#
The boundary belongs to , but not to . Read the comparison sign before accepting equality.
To repair an invalid candidate, test the replacement against every constraint again.
, . A draft accepts . Choose a valid replacement.
Show answer and explanation
Nonnegative; 7<8 units.
Check every constraint and its boundary symbol; cost alone does not make a point feasible.
- Identify decisions satisfying all stated constraints.
Sources & further reading
- [1]Boyd & Vandenberghe §4.1.1 ↗Boyd & Vandenberghe §4.1.1 · Article