Feasible
A structured description of whether a problem's input lattice can supply a requested number of distinct feasible input points — for example a solver population or a space-filling design. Produced by ProblemDefinition.feasiblePointCapacity, it lets a caller decide programmatically (e.g. cap a population, flag a benchmark cell, drive a UI) rather than parse a log message.
latticeSize is the number of distinct points on the input grid (see ProblemDefinition.inputLatticeSize), or null when that is effectively unbounded (a continuous input, or a grid too large to count). It is an upper bound on the number of distinct input-feasible points: linear and functional constraints can only reduce it. Consequently sufficient == true means the grid is large enough for the request but constraints may still reduce the feasible set below it, whereas sufficient == false means the request cannot be met on grid size alone.
Parameters
the number of distinct feasible points requested; must be positive
the input-grid size, or null when effectively unbounded; must be non-negative
Properties
True when the input grid has at least requestedCount distinct points — i.e. the request is not impossible on grid size alone (always true when the lattice is unbounded). Note that linear and functional constraints can still reduce the feasible set below requestedCount.