Classes
struct	CutCoefficient
	Stores one nonzero coefficient of a generated linear inequality. More...
class	CutGenerationReport
	Complete cutting-plane traceability report for one solver-backed solve. More...
class	CutIterationReport
	Traceability report for one cutting-plane iteration. More...
class	CutRecord
	Trace record for one generated cutting-plane constraint. More...
class	CuttingPlaneConvergenceReport
	Summarizes root-bound evolution and separation effort for one exact cut-and-solve execution. More...
class	CuttingPlaneExecutionReport
	Combines solver-selection provenance, cutting-plane traceability and root convergence statistics. More...
class	CuttingPlaneIterationStatistics
	Numerical convergence statistics for one root cutting-plane iteration. More...
class	LsCutDefinition
	Solver-independent definition of one ULS (l,S) inequality. More...
class	LsCuttingPlaneOptions
	Configures root LP (l,S) separation before the final exact MILP solve. More...

Enumerations
enum	CutDisposition { Generated = 0 , Added = 1 , Duplicate = 2 , BelowTolerance = 3 , Invalid = 4 , SolverRejected = 5 , NotSelected = 6 }
	Describes what happened to a generated cut after separation. More...
enum	CutFamily { Unknown = 0 , Ls = 1 }
	Identifies a family of valid inequalities generated by a separator. More...
enum	CutSelectionPolicy { AllViolated = 0 , MostViolatedPerL = 1 , TopByViolation = 2 , TopByEfficacy = 3 }
	Selects which eligible violated cuts are inserted at one root-separation iteration. More...
enum	CutSeparationMethod { Unknown = 0 , WagnerWhitin = 1 , General = 2 }
	Identifies the separation procedure that generated a cut. More...
enum	LinearConstraintSense { LessOrEqual = 0 , Equal = 1 , GreaterOrEqual = 2 }
	Identifies the sense of a generated linear inequality. More...

Enumeration Type Documentation

◆ CutDisposition

Describes what happened to a generated cut after separation.

Enumerator
Generated	The cut has been generated but no disposition was recorded.
Added	The cut was added to the mathematical model.
Duplicate	An equivalent cut was already present.
BelowTolerance	The violation was below the configured insertion tolerance.
Invalid	The cut was rejected by an implementation-level validity check.
SolverRejected	The solver adapter refused or failed to add the constraint.
NotSelected	The cut was eligible and violated but was deliberately not selected by the configured cut-pool policy.

Definition at line 6 of file CutDisposition.cs.

Identifies a family of valid inequalities generated by a separator.

Enumerator
Unknown	No family has been specified.
Ls	The uncapacitated lot-sizing (l,S) inequality family.

Definition at line 4 of file CutFamily.cs.

Selects which eligible violated cuts are inserted at one root-separation iteration.

Enumerator
AllViolated	Add every unique violated cut.
MostViolatedPerL	Add only the most violated candidate for each value of l.
TopByViolation	Add the globally most violated candidates, limited by MaximumCutsPerIteration.
TopByEfficacy	Add the globally highest-efficacy candidates, limited by MaximumCutsPerIteration.

Definition at line 7 of file CutSelectionPolicy.cs.

Identifies the separation procedure that generated a cut.

Enumerator
Unknown	No separation procedure has been specified.
WagnerWhitin	Wagner-Whitin-structure separation for (l,S) inequalities.
General	General separation for (l,S) inequalities.

Definition at line 4 of file CutSeparationMethod.cs.

Identifies the sense of a generated linear inequality.

Definition at line 4 of file LinearConstraintSense.cs.

	ULSAlgorithms 1.1.0-g3e5595996d High-performance exact and heuristic algorithms for uncapacitated lot sizing