Active set method

In mathematical optimization, a problem is defined using an objective function to minimize or maximize, and a set of constraints that define the feasible region, that is, the set of all x to search for the optimal solution. Given a point in the feasible region, a constraint is called active at if and inactive at if Equality constraints are always active. The active set at is made up of those constraints that are active at the current point (, p. 308).

Active set method

In mathematical optimization, a problem is defined using an objective function to minimize or maximize, and a set of constraints that define the feasible region, that is, the set of all x to search for the optimal solution. Given a point in the feasible region, a constraint is called active at if and inactive at if Equality constraints are always active. The active set at is made up of those constraints that are active at the current point (, p. 308).