Interior point methods are a type of algorithm that are used in
solving both linear and nonlinear convex optimization
problems that contain inequalities as constraints. The LP
Interior-Point method relies on having a linear programming
model with the objective function and all constraints being
continuous and twice continuously differentiable. In...