QuadraticProgramSolution<T>
Models & Types · AiDotNet.Solvers.QuadraticProgramming
The result of solving a QuadraticProgram.
How It Works
The status shares the LinearProgramStatus vocabulary, because the possible
outcomes are the same: an optimum, contradictory constraints, an objective that runs away, or a
search stopped by its iteration budget.
Constructors
| Constructor | Summary |
|---|---|
QuadraticProgramSolution(LinearProgramStatus status, Vector<T> solution, T objectiveValue, int iterations, Vector<T> inequalityMultipliers, Vector<T> equalityMultipliers) |
Creates a quadratic program solution. |
Properties
| Property | Summary |
|---|---|
LinearProgramStatus Status { get; } |
Gets the outcome of the solve. |
T ObjectiveValue { get; } |
Gets the objective value ½·xᵀQx + cᵀx at Solution. |
Vector<T> EqualityMultipliers { get; } |
Gets the Lagrange multiplier of each equality constraint, or null when there were none. |
Vector<T> InequalityMultipliers { get; } |
Gets the Lagrange multiplier of each inequality constraint, or null when the problem had none. |
Vector<T> Solution { get; } |
Gets the decision variables at the returned point, or null when the problem was infeasible or unbounded. |
int Iterations { get; } |
Gets the number of active-set iterations performed. |