ConstrainedSolution<T>

Models & Types · AiDotNet.Solvers.Constrained

The result of solving a ConstrainedProblem.

How It Works

The multipliers are as much of the answer as the point itself: they are the prices of the constraints, and they are what the KKT conditions are stated over. A caller that only reads Solution is discarding half of what the solver computed.

Constructors

Constructor Summary
ConstrainedSolution(LinearProgramStatus status, Vector<T> solution, T objectiveValue, T constraintViolation, int iterations, Vector<T> equalityMultipliers, Vector<T> inequalityMultipliers) Creates a constrained-problem solution.

Properties

Property Summary
LinearProgramStatus Status { get; } Gets the outcome of the solve.
T ConstraintViolation { get; } Gets the largest amount by which any constraint is violated at Solution.
T ObjectiveValue { get; } Gets the objective value at Solution.
Vector<T> EqualityMultipliers { get; } Gets the multipliers of the equality constraints, or null when there were none.
Vector<T> InequalityMultipliers { get; } Gets the multipliers of the inequality constraints, or null when there were none.
Vector<T> Solution { get; } Gets the best point found.
int Iterations { get; } Gets the number of outer iterations performed.