gacreationlinearfeasible — Create rows admitted to the original linear and bound constraints.
Create rows admitted to the original linear and bound constraints.
Syntax
Population = creationFcn(nvars,problem,options)Inputs
nvars- Type
Any- Required
- Yes
- Default
- —
- Description
- Positive exact genome length.
problem- Type
Any- Required
- Yes
- Default
- —
- Description
- R2026a operator problem context with FitnessFcn and selected constraint roles.
options- Type
Any- Required
- Yes
- Default
- —
- Description
- Genetic options; only creation controls are active.
Returns
Population- Type
Any- Description
- PopulationSize-by-nvars host double initial population.
Errors
RunMat:ga:InvalidArgument- When
- A public argument, active option, operator result or callback state violates its representation, geometry or numerical contract.
- Message
ga: invalid argument
Standalone creation
Population=creationFcn(nvars,problem,options) returns PopulationSize-by-nvars host doubles without calling problem.FitnessFcn. The R2026a operator context uses FitnessFcn (fitnessfcn is a legacy alias), Aineq,Bineq,Aeq,Beq,lb,ub,nonlcon,intcon; nvars is the explicit genome-length argument and options is separate. A complete InitialPopulationMatrix is retained; a partial prefix is preserved while missing rows are filled. PopulationSize,PopulationType,InitialPopulationMatrix and ConstraintTolerance are active; InitialPopulationRange is also active except for linear-feasible creation.
gacreationuniform samples the adjusted finite initial range, including exact bitstring draws when PopulationType='bitstring'. It does not enforce linear or integer membership; the invoking ga performs its later admission. Bounds shape the sampling interval rather than authorizing invalid supplied rows. gacreationlinearfeasible uses the retained original linear/bound model and verified feasible witnesses; it ignores InitialPopulationRange. gacreationuniformint uses uniform representable-integer creation followed by original domain admission. gacreationsobol uses the pinned Gray-code/Joe-Kuo sequence and original linear/bound/integer admission. Custom PopulationType requires a user-defined creator.
gacreationnonlinearfeasible also accepts unique SolverOpts,UseParallel,NumStartPts name/value pairs. SolverOpts uses the supported fmincon options with default sqp/off, without a user objective: the feasibility objective is the mathematical constant zero and only real constraint callbacks are counted. Default starts equals the number of missing rows. Additional starts cycle missing rows and keep the best observed constraint candidate per row; this is not a feasibility guarantee. UseParallel='on' requires real selected-callable workers, never a serial substitute. Parent GA timing is checked at wave boundaries rather than converted into a new worker physical deadline.
Only needed creation controls and original geometry are prepared; fitness scores, observer/hybrid fields, unused callbacks and inactive nonlinear constraints are not recursively gathered. Named parameter errors retain their GA/fmincon owner identifiers. Native numeric/single/control extensions use the selected compatibility policy; authenticated automatic residency may materialize, but no explicit-GPU GA fallback is added. Finite host-memory policies refuse before random or constrained work. Original cancellation and provider errors are not converted to infeasible points. A standalone feasible creator that cannot complete a verified linear/integer population returns an error rather than a falsely feasible matrix.
Example
Use the predefined genetic operator
o=optimoptions('ga','PopulationSize',2,'InitialPopulationMatrix',[-3;3]); p=struct('FitnessFcn',@(x)x(1)^2,'nvars',1,'Aeq',1,'Beq',2,'lb',0,'ub',3); X=gacreationlinearfeasible(1,p,o);Using gacreationlinearfeasible with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how gacreationlinearfeasible changes the result.
Run a small gacreationlinearfeasible example, explain the result, then change one input and compare the output.
Related Math functions
Optim
acceptancesa · annealingboltz · annealingfast · coneprog · crossoverarithmetic · crossoverheuristic · crossoverintermediate · crossoverlaplace · crossoverscattered · crossoversinglepoint · crossovertwopoint · eqnproblem · EquationProblem.solve · EquationProblem.subsasgn · EquationProblem.subsref · evaluate · fgoalattain · fitscalingprop · fitscalingrank · fitscalingshiftlinear · fitscalingtop · fminbnd · fmincon · fminimax · fminsearch · fminunc · fseminf · fsolve · fzero · ga · gacreationnonlinearfeasible · gacreationsobol · gacreationuniform · gacreationuniformint · gaplotbestf · gaplotbestindiv · gaplotdistance · gaplotexpectation · gaplotgenealogy · gaplotmaxconstr · gaplotrange · gaplotscorediversity · gaplotscores · gaplotselection · gaplotstopping · integerConstraint · integral · intlinprog · linprog · lsqcurvefit · lsqlin · LsqlinWarmStart.subsasgn · LsqlinWarmStart.subsref · lsqnonlin · lsqnonneg · mutationadaptfeasible · mutationgaussian · mutationpositivebasis · mutationpower · mutationuniform · optimexpr · optimget · OptimizationConstraint.evaluate · OptimizationConstraint.subsasgn · OptimizationConstraint.subsref · OptimizationExitflag.double · OptimizationExitflag.eq · OptimizationExitflag.ne · OptimizationExitflag.string · OptimizationExpression.acos · OptimizationExpression.acosh · OptimizationExpression.acot · OptimizationExpression.acoth · OptimizationExpression.acsc · OptimizationExpression.acsch · OptimizationExpression.asec · OptimizationExpression.asech · OptimizationExpression.asin · OptimizationExpression.asinh · OptimizationExpression.atan · OptimizationExpression.atanh · OptimizationExpression.cat · OptimizationExpression.cos · OptimizationExpression.cosh · OptimizationExpression.cot · OptimizationExpression.coth · OptimizationExpression.csc · OptimizationExpression.csch · OptimizationExpression.ctranspose · OptimizationExpression.cumprod · OptimizationExpression.cumsum · OptimizationExpression.diag · OptimizationExpression.diff · OptimizationExpression.dot · OptimizationExpression.eq · OptimizationExpression.evaluate · OptimizationExpression.exp · OptimizationExpression.ge · OptimizationExpression.horzcat · OptimizationExpression.ldivide · OptimizationExpression.le · OptimizationExpression.log · OptimizationExpression.mean · OptimizationExpression.minus · OptimizationExpression.mldivide · OptimizationExpression.mpower · OptimizationExpression.mrdivide · OptimizationExpression.mtimes · OptimizationExpression.norm · OptimizationExpression.plus · OptimizationExpression.power · OptimizationExpression.prod · OptimizationExpression.rdivide · OptimizationExpression.reshape · OptimizationExpression.sec · OptimizationExpression.sech · OptimizationExpression.sin · OptimizationExpression.sinh · OptimizationExpression.sqrt · OptimizationExpression.subsasgn · OptimizationExpression.subsref · OptimizationExpression.sum · OptimizationExpression.tan · OptimizationExpression.tanh · OptimizationExpression.times · OptimizationExpression.trace · OptimizationExpression.transpose · OptimizationExpression.uminus · OptimizationExpression.uplus · OptimizationExpression.vertcat · OptimizationExpression.zeros · OptimizationExpression.zerosLike · OptimizationProblem.solve · OptimizationProblem.subsasgn · OptimizationProblem.subsref · OptimizationVariable.subsasgn · OptimizationVariable.subsref · optimoptions · optimplotconstrviolation · optimplotfirstorderopt · optimplotfunccount · optimplotfval · optimplotfvalconstr · optimplotmilp · optimplotstepsize · optimplotx · optimproblem · optimset · optimvar · optimwarmstart · particleswarm · patternsearch · psplotbestf · psplotbestx · psplotfuncount · psplotmaxconstr · psplotmeshsize · pswcreationuniform · pswplotbestf · quad · quadprog · QuadprogWarmStart.subsasgn · QuadprogWarmStart.subsref · saplotbestf · saplotbestx · saplotf · saplotstopping · saplottemperature · saplotx · savemilpsolutions · secondordercone · selectionremainder · selectionroulette · selectionstochunif · selectiontournament · selectionuniform · simulannealbnd · solve · surrogateopt · surrogateoptplot · temperatureboltz · temperatureexp · temperaturefast
Elementwise
abs · angle · besselj · bsxfun · complex · conj · double · eps · erf · erfcinv · exp · expm1 · flintmax · gamma · gammaln · heaviside · hypot · imag · int16 · int32 · int64 · int8 · intmax · intmin · ldivide · log · log10 · log1p · log2 · minus · nextpow2 · plus · pow2 · power · rdivide · real · realmax · realmin · realsqrt · rescale · sign · single · sqrt · times · typecast · uint16 · uint32 · uint64 · uint8
Trigonometry
acos · acosd · acosh · acotd · acscd · asecd · asin · asind · asinh · atan · atan2 · atan2d · atand · atanh · cos · cosd · cosh · cospi · deg2rad · pol2cart · rad2deg · sin · sind · sinh · sinpi · tan · tand · tanh
Reduction
all · any · bounds · cummax · cummin · cumprod · cumsum · cumtrapz · diff · gradient · max · maxk · mean · median · min · mink · movmax · movmean · movmedian · movmin · movprod · movstd · movsum · movvar · nnz · prod · rms · std · sum · trapz · var
Structure
bandwidth · isdiag · ishermitian · issymmetric · istril · istriu · symrcm
Signal
blackman · butter · buttord · cheb2ord · conv · conv2 · deconv · downsample · envelope · filter · filtfilt · fir1 · freqz · gauspuls · hamming · hann · hilbert · periodogram · pulstran · pwelch · rectpuls · resample · sawtooth · sinc · spectrogram · square · tripuls · unwrap · upsample · zplane
Factor
chol · decomposition · decomposition.ctranspose · decomposition.mldivide · decomposition.mrdivide · decomposition.mtimes · decomposition.rdivide · decomposition.subsref · decomposition.times · decomposition.uminus · decomposition.uplus · eig · eigs · gmres · ichol · ilu · lu · ordeig · ordqz · ordschur · pcg · qr · qz · rsf2csf · schur · svd
Ops
cross · ctranspose · dot · mldivide · mpower · mrdivide · mtimes · pagemtimes · pagetranspose · trace · transpose
Interpolation
griddedInterpolant · griddedInterpolant.subsref · interp1 · interp1q · interp2 · pchip · ppval · spline
Integer Division
Source you can read
Every RunMat function's source is public. Read exactly how gacreationlinearfeasible is executed, line by line, in Rust.
- View the source for gacreationlinearfeasible in Rust on GitHub
- Learn how the RunMat runtime works
- Found a bug? Open an issue with a minimal reproduction.
About RunMat
RunMat is a runtime that executes MATLAB-syntax code fast on any GPU. The runtime is free for individuals, including freelancers; students and faculty at an academic institution, for teaching or research there; contributors to an open-source project, for work on that project; organizations with 250 or fewer people and US$10M or less in annual revenue; and anyone, for non-production use. See runmat.com/license.
- RunMat automatically optimizes your math for GPU execution on Apple, Nvidia, and AMD hardware. No code changes needed. Simulations that took hours now take minutes.
- Start running code in seconds. RunMat runs in the browser, on the desktop, or from the CLI. No license server, no IT ticket.