What this method is

Patterson–LaForge IPPA is a fast ULS heuristic in the Part-period family. It constructs a feasible replenishment plan without claiming an optimality proof. Use it only when the documented applicability conditions match the instance.

Core idea

The method scans the planning horizon and constructs replenishment cycles according to its published decision rule. The library then reconstructs production, inventory, setups and cost components through the common heuristic solution builder.

using ULSAlgorithms.Abstractions;
using ULSAlgorithms.Models;
using ULSAlgorithms.Heuristics;

var problem = new UlsProblem(
    demands:             [20.0, 30.0, 25.0, 40.0],
    setupCosts:          [200.0, 200.0, 200.0, 200.0],
    unitProductionCosts: [0.0, 0.0, 0.0, 0.0],
    holdingCosts:        [4.0, 4.0, 4.0, 0.0]);

IUlsSolver solver = new PattersonLaForgeIncrementalPartPeriodSolver();
var result = solver.Solve(problem);

Console.WriteLine(result.Status);
Console.WriteLine(result.ObjectiveValue);

The input example intentionally uses stationary, positive-demand data so it is compatible with restricted methods too. Always check the applicability box for your own instance.

Reference & provenance

Patterson & LaForge (1985), The Incremental Part-Period Algorithm: An Alternative to EOQ, Journal of Purchasing and Materials Management 21(2), 28-33 · DOI 10.1111/j.1745-493X.1985.tb00132.x