RunMat
  • Pricing
RunMat
GitHub
GitHub
Sign inTry in browser
DesktopRuntimePhysicsCADAdministrationAgent

Get RunMat updates

New releases, guides and examples.

Product+
  • Runtime
  • GPU
  • Parallel
  • Compile
  • Interop and MEX
  • Simulation
  • MCAD
  • ECAD
  • Enterprise
  • AI integrations
  • Pricing
  • Download
Math+
  • Signal processing
  • Linear algebra
  • Statistics
  • Curve fitting
  • Differential equations
  • Control systems
  • Optimization
  • Finance
  • Data and tables
  • Plotting
Physics+
  • Simulation overview
  • Structural
  • Thermal
  • Electromagnetic
  • Joule heating
  • Thermal stress
  • Acoustics
  • Fluid flow
  • Conjugate heat transfer
  • Fluid–structure
  • What is FEA
Industries+
  • Aerospace
  • Automotive and transportation
  • Defense
  • Electronics and semiconductors
  • Energy
  • Industrial machinery
  • Life sciences
  • Quantitative finance
Learn+
  • Guides
  • Docs
  • Function reference
  • Language reference
  • Migration guide
  • Changelog
  • MATLAB Online
  • MATLAB AI agent
  • For students
Compare+
  • RunMat vs MATLAB
  • RunMat vs Ansys
  • RunMat vs SOLIDWORKS
  • RunMat vs Altium
  • RunMat vs Cadence
  • RunMat vs COMSOL
  • RunMat vs Python
  • RunMat vs Julia
  • RunMat vs Physics AI
  • RunMat vs Octave
  • Benchmarks
  • MATLAB alternatives
  • All comparisons
Company+
  • About
  • Blog
  • Contact
  • Source code↗
  • License
  • Privacy
  • Terms

Product

  • Runtime
  • GPU
  • Parallel
  • Compile
  • Interop and MEX
  • Simulation
  • MCAD
  • ECAD
  • Enterprise
  • AI integrations
  • Pricing
  • Download

Math

  • Signal processing
  • Linear algebra
  • Statistics
  • Curve fitting
  • Differential equations
  • Control systems
  • Optimization
  • Finance
  • Data and tables
  • Plotting

Physics

  • Simulation overview
  • Structural
  • Thermal
  • Electromagnetic
  • Joule heating
  • Thermal stress
  • Acoustics
  • Fluid flow
  • Conjugate heat transfer
  • Fluid–structure
  • What is FEA

Industries

  • Aerospace
  • Automotive and transportation
  • Defense
  • Electronics and semiconductors
  • Energy
  • Industrial machinery
  • Life sciences
  • Quantitative finance

Learn

  • Guides
  • Docs
  • Function reference
  • Language reference
  • Migration guide
  • Changelog
  • MATLAB Online
  • MATLAB AI agent
  • For students

Compare

  • RunMat vs MATLAB
  • RunMat vs Ansys
  • RunMat vs SOLIDWORKS
  • RunMat vs Altium
  • RunMat vs Cadence
  • RunMat vs COMSOL
  • RunMat vs Python
  • RunMat vs Julia
  • RunMat vs Physics AI
  • RunMat vs Octave
  • Benchmarks
  • MATLAB alternatives
  • All comparisons

Company

  • About
  • Blog
  • Contact
  • Source code↗
  • License
  • Privacy
  • Terms
GitHubXLinkedIn

© Dystr, Inc. · RunMat v0.7.1, Nov 17, 2026

RunMat® is a registered trademark of Dystr, Inc. MATLAB® is a registered trademark of The MathWorks, Inc. RunMat is not affiliated with, endorsed by, or sponsored by The MathWorks, Inc.

/
See all docs
Builtin Reference
    • 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
    • gacreationlinearfeasible
    • 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

intlinprog — Minimize a linear objective with integer-index and linear constraints using certified branch-and-bound.

intlinprog solves min f(:)'*x subject to linear equalities, inequalities, variable bounds and integer-valued selected coordinates. Numerical sparse LP relaxations propose points and duals; exact original-model checks alone authorize incumbents, pruning and terminal certificates.

Syntax

[x,fval,exitflag,output] = intlinprog(f,intcon,A,b,Aeq,beq,lb,ub,x0,options)
[x,fval,exitflag,output] = intlinprog(problem)

Inputs

f
Type
NumericArray
Required
Yes
Default
—
Description
Finite real objective array, flattened column-major; [] selects feasibility.
intcon
Type
Any
Required
Yes
Default
—
Description
Positive variable-index array or scalar IntegerConstraint; [] selects a linear relaxation.
A
Type
NumericArray
Required
Yes
Default
—
Description
Finite real dense or sparse inequality coefficient matrix.
b
Type
Any
Required
Yes
Default
—
Description
Full upper-bound vector or two-element range cell {bl,bu}.
Aeq
Type
NumericArray
Required
No
Default
—
Description
Finite real dense or sparse equality coefficient matrix.
beq
Type
NumericArray
Required
No
Default
—
Description
Finite full equality right-side vector.
lb
Type
NumericArray
Required
No
Default
—
Description
Variable lower bounds, flattened; omitted trailing bounds are -Inf.
ub
Type
NumericArray
Required
No
Default
—
Description
Variable upper bounds, flattened; omitted trailing bounds are Inf.
x0
Type
NumericArray
Required
No
Default
—
Description
Finite initial-point array; used as an actual fixed-integer repair proposal.
options
Type
Any
Required
No
Default
—
Description
Consumed intlinprog scalar options struct or [].
problem
Type
Any
Required
Yes
Default
—
Description
Scalar problem with f,intcon,solver='intlinprog',options and optional constraint/bound/x0 fields.
NameTypeRequiredDefaultDescription
fNumericArrayYes—Finite real objective array, flattened column-major; [] selects feasibility.
intconAnyYes—Positive variable-index array or scalar IntegerConstraint; [] selects a linear relaxation.
ANumericArrayYes—Finite real dense or sparse inequality coefficient matrix.
bAnyYes—Full upper-bound vector or two-element range cell {bl,bu}.
AeqNumericArrayNo—Finite real dense or sparse equality coefficient matrix.
beqNumericArrayNo—Finite full equality right-side vector.
lbNumericArrayNo—Variable lower bounds, flattened; omitted trailing bounds are -Inf.
ubNumericArrayNo—Variable upper bounds, flattened; omitted trailing bounds are Inf.
x0NumericArrayNo—Finite initial-point array; used as an actual fixed-integer repair proposal.
optionsAnyNo—Consumed intlinprog scalar options struct or [].
problemAnyYes—Scalar problem with f,intcon,solver='intlinprog',options and optional constraint/bound/x0 fields.

Returns

x
Type
NumericArray
Description
Verified publishable binary64 decision column or [].
fval
Type
NumericArray
Description
Original objective evaluated at the actual returned x, or [].
exitflag
Type
NumericScalar
Description
Certified gap/terminal result or truthful early/numerical stop.
output
Type
Any
Description
Gap, counters, actual point violation, message and explicitly distinguished proof bounds.
NameTypeDescription
xNumericArrayVerified publishable binary64 decision column or [].
fvalNumericArrayOriginal objective evaluated at the actual returned x, or [].
exitflagNumericScalarCertified gap/terminal result or truthful early/numerical stop.
outputAnyGap, counters, actual point violation, message and explicitly distinguished proof bounds.

Returned values from intlinprog depend on how many outputs the caller requests.

Errors

RunMat:intlinprog:InvalidArgument
When
Unsupported input/output arity.
Message
intlinprog: invalid argument
RunMat:intlinprog:InvalidInput
When
Invalid numeric geometry, variable indices, option or unsupported public form.
Message
intlinprog: invalid input
IdentifierWhenMessage
RunMat:intlinprog:InvalidArgumentUnsupported input/output arity.intlinprog: invalid argument
RunMat:intlinprog:InvalidInputInvalid numeric geometry, variable indices, option or unsupported public form.intlinprog: invalid input

Calling forms and data

Use intlinprog(f,intcon,A,b), add complete Aeq,beq and lb,ub pairs, then optional x0 and options. Use [] for absent pairs. The scalar problem form requires f, intcon, solver='intlinprog' and options; optional fields are Aineq, bineq, Aeq, beq, lb, ub and x0. Extra problem fields are not interpreted.

f, intcon, lb, ub and x0 flatten in column-major order. f=[] selects a zero feasibility objective; the variable count then comes from constraint geometry, bounds and x0, not a guessed dimension cap. intcon contains positive variable indices; repetitions are harmless and [] requests an ordinary linear relaxation. A and Aeq are finite real dense or sparse matrices. b and beq are full row or column vectors. A two-element b cell {bl,bu} means bl<=A*x<=bu, with infinite absent sides. Conflicting row or ordinary variable bounds establish infeasibility, not a fabricated finite relaxation; semi-domain bounds describe only the active alternative. Omitted trailing variable bounds are unbounded.

Double is the ordinary class for f, intcon, Aeq, lb, ub and x0. A, b and beq also accept ordinary Single. Single in the former roles, and native-integer numeric inputs or controls, are separately declared RunMat extensions. Floating-boundary integer data must be exactly representable as binary64; structural node/point counts retain exact addressable values. All outputs are host double, not an integer-class or device result. Logical, complex, arbitrary object and callable numeric data reject; the typed IntegerConstraint intcon form is admitted separately.

Only authenticated automatic numeric residency may gather through the original invocation. Explicit gpuArray intent and unauthenticated intent refuse before transfer; there is no explicit GPU solver overload. All selected data/control datatype and residency gates run before the first provider transfer. Numeric geometry and payload checks follow their actual decoding owners; unused fields and callback captures are not recursively gathered.

Consumed options

Use optimoptions('intlinprog',...) or a scalar options struct. AbsoluteGapTolerance is finite and nonnegative (default 1e-6); RelativeGapTolerance lies in [0,1] (default 1e-4). The global exact gap U-L stops when it is at most the absolute tolerance or at most RelativeGapTolerance*abs(U). U=L=0 has relative gap zero; a nonzero gap with U=0 is infinite. Missing finite lower certificates never become zero gaps.

ConstraintTolerance lies in [1e-10,1e-3] and defaults to 1e-6. It controls LP proposal accuracy and the final actual binary64 point publication check; it does not replace exact feasibility, dual-cone or pruning proofs. MaxNodes is a positive exact addressable count (default 1e7) of LP node relaxations started, not backend iterations. MaxFeasiblePoints is a positive exact addressable count or Inf (default Inf) of certified feasible candidate discoveries; rechecking the retained incumbent is not a new discovery. Independent fixed-integer repair LPs do not count as branch nodes.

MaxTime is nonnegative, optionally Inf, and defaults to 7200 seconds. It uses the original admitted monotonic Clock, including declared deterministic clocks. Cooperative kernel checkpoints perform a normal typed time stop; numerical finalization and original cancellation ownership are preserved. Factorization, rational arithmetic and synchronous constructors are not hard-preemptible, so MaxTime is not a hard wall-clock deadline. A denied or missing selected Clock refuses rather than using an ambient clock or fake elapsed value.

ObjectiveCutOff accepts finite values or Inf (default Inf). Only points with objective at most the cutoff are admitted. A node is removed by the cutoff only when its exact lower certificate is strictly greater; the original lower certificate is retained for diagnostics. Display is iter by default, or off/none/final, and writes through the original invocation's console/diary owner. Empty numeric option values select defaults. Unknown and unsupported nonempty options reject; no Algorithm value aliases another algorithm.

OutputFcn and PlotFcn accept function handles, cells of callbacks, or the respective predefined savemilpsolutions/optimplotmilp name. [] disables a group. Custom callbacks receive (x,optimValues,state) at init, newly publishable incumbent improvements, node-progress events and done. x is nonempty only for a new improving feasible point; init/progress/done never replay the incumbent as a new solution. Both callback groups run in declared order and their logical stop flags combine by OR, including later callbacks after an earlier true flag. A stop returns exitflag -1 with the actual retained incumbent and certified bound; callback errors/cancellation propagate without replay and do not trigger a done call.

optimValues contains dualbound, fval, numfeaspoints, numnodes, relativegap and time. dualbound comes from the global exact lower certificate, including an unfinished active leaf; an unbounded or unknown lower certificate is -Inf. fval is the objective at the published best point. numfeaspoints counts improving discoveries, separate from the output/MaxFeasiblePoints total-candidate counter. numnodes is the branch-relaxation count, or [] for a purely continuous problem. time uses the selected monotonic clock from init.

relativegap projects the exact proof-bound gap without clamping, and is [] before an incumbent or for a purely continuous problem. Floating callback bounds and gaps are diagnostic projections; pruning uses the separate exact proof quantities. A gap need not equal arithmetic recomputed from rounded published-point fval. Empty callback defaults avoid callback argument/history allocation.

savemilpsolutions records event columns and corresponding objectives in the selected base workspace; optimplotmilp updates real primal/dual line payloads. Solver PlotFcn layouts retain exact figure/axes authority and assign a target per callback. Original workspace/UI permissions, lifecycle, resources and cancellation remain authoritative. Unpublishable witnesses never become feasible callback points; the numerical/publication stop retains their exact proof and reports the original -9 frontier. The plot UI does not provide MATLAB-specific optimization Pause/Stop widgets or claim identical window layout.

intcon also accepts a scalar IntegerConstraint value from integerConstraint. Its Integer, SemiContinuous and SemiInteger properties are disjoint positive Double index vectors and are revalidated at invocation. A semicontinuous coordinate belongs to {0} union [lb,ub]; a semi-integer coordinate belongs to {0} union the integers in [lb,ub]. Both supplied semi bounds must be strictly positive and at most 1e5. Positive active lower bounds do not exclude zero. If the active interval is empty, only the zero alternative remains. Convex hull relaxations never replace these original union domains: forbidden-gap branching and exact membership checks govern incumbents, cutoff, proof gaps and publication. Semicontinuous-only problems retain mixed-domain counters and callback gaps. Other undisclosed algorithms, problem-based optimization objects and complete R2026a API parity are not implied.

Outputs and proof authority

[x,fval,exitflag,output] returns a binary64 decision column and the original objective evaluated at that actual returned x. Exact integer coordinates must survive publication unchanged, every semi coordinate must still belong to its original zero-or-interval domain, and the maximum equality/inequality/convex-bound violation must satisfy ConstraintTolerance. Failure at this representation boundary returns exitflag -9 and empty x/fval, not a claimed feasible or optimal rounded point.

exitflag 1 means an exact proven gap meets the requested tolerances or the branch domains are closed around an incumbent. exitflag 2 is a premature stop with a publishable feasible incumbent; 0 has none. -2 certifies no feasible point in the searched domain, including ObjectiveCutOff when supplied. -3 requires an actual exact integer-feasible point and a verified rational recession ray with a positive integer-lattice scale. Every bounded semi coordinate must have exactly zero recession direction. An unbounded LP relaxation alone instead supplies its actual feasible fractional witness for branching, or remains an unresolved numerical stop. Uncertified nodes remain unresolved and produce truthful numerical/limit stops rather than false infeasibility or success.

output contains relativegap, absolutegap, numfeaspoints, numnodes, constrviolation and message. With intcon=[], the first four fields are []. RunMat additionally reports lowerbound (the proven original global lower bound, or -Inf when none is finite) and certifiedobjective (the exact feasible rational incumbent objective converted for display, or Inf when unavailable). Gap decisions use those exact rational proof quantities, not the rounded reported fields or returned binary64 fval. constrviolation is recomputed at the actual binary64 x; it is NaN when no candidate is available. Underflowed positive gap displays stay positive rather than becoming a fake exact zero.

The deterministic branch-and-bound implementation rebuilds sparse LP factors at each node and repair. It does not claim HiGHS identity, incremental factor updates, cutting planes or equivalent performance. The tree retains parent/bound metadata, one sparse model workspace and original-model exact certificates, not dense identity constraints or a copied matrix per node. x0 is used in an actual fixed-integer repair attempt, never accepted merely by rounding a relaxation.

A selected RuntimeContext and admitted Clock are required; normal CLI/VM/native/browser invocation supplies the context. Original cancellation, provider errors and owned kernel retirement remain intact. Finite host-memory requests refuse before transfers and solver workspace allocation because tree growth, sparse factorization and rational-growth workspace have no complete finite certificate. This host implementation is portable to native and WASM; that declaration is not platform execution evidence.

Examples

Solve a genuine binary capacity problem

f=[-1;-1]; intcon=1:2; A=[2 2]; b=3;
options=optimoptions('intlinprog','Display','off');
[x,fval,flag,output]=intlinprog(f,intcon,A,b,[],[],[0;0],[1;1],[],options)

Use range constraints and an actual initial repair

problem.f=[]; problem.intcon=1; problem.Aineq=1; problem.bineq={1.2,2.2};
problem.lb=0; problem.ub=3; problem.x0=1.5; problem.solver='intlinprog';
problem.options=optimoptions('intlinprog','Display','off');
[x,fval,flag,output]=intlinprog(problem)

Using intlinprog with coding agents

Open a RunMat example with live inputs, then ask the agent to explain how intlinprog changes the result.

Run a small intlinprog 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 · gacreationlinearfeasible · gacreationnonlinearfeasible · gacreationsobol · gacreationuniform · gacreationuniformint · gaplotbestf · gaplotbestindiv · gaplotdistance · gaplotexpectation · gaplotgenealogy · gaplotmaxconstr · gaplotrange · gaplotscorediversity · gaplotscores · gaplotselection · gaplotstopping · integerConstraint · integral · 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

Bitwise

bitand · bitcmp · bitget · bitor · bitset · bitshift · bitxor · swapbytes

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

Rounding

ceil · fix · floor · mod · rem · round

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

Solve

cond · det · inv · linsolve · norm · null · pinv · rank · rcond · rref · vecnorm

Ops

cross · ctranspose · dot · mldivide · mpower · mrdivide · mtimes · pagemtimes · pagetranspose · trace · transpose

Symbolic

digits · int · limit · piecewise · sym · syms · vpa

Discrete

factor · factorial · gcd · isprime · lcm · primes

Fft

fft · fft2 · fftn · fftshift · ifft · ifft2 · ifftn · ifftshift

Interpolation

griddedInterpolant · griddedInterpolant.subsref · interp1 · interp1q · interp2 · pchip · ppval · spline

Integer Division

idivide

Ode

ode15s · ode23 · ode45 · odeset

Poly

poly · polyder · polyfit · polyint · polyval · roots

Source you can read

Every RunMat function's source is public. Read exactly how intlinprog is executed, line by line, in Rust.

  • View the source for intlinprog 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.

Getting started · Benchmarks · Pricing

Download RunMat

Download RunMat for full performance, or use RunMat in your browser for zero setup.

Download RunMatOpen Sandbox
On this page
  • Syntax
  • Inputs
  • Returns
  • Errors
  • Calling forms and data
  • Consumed options
  • Outputs and proof authority
  • Examples
  • Solve a genuine binary capacity problem
  • Use range constraints and an actual initial repair
  • Using intlinprog with coding agents
  • Related Math functions
  • Optim
  • Elementwise
  • Trigonometry
  • Reduction
  • Structure
  • Bitwise
  • Signal
  • Rounding
  • Factor
  • Solve
  • Ops
  • Symbolic
  • Discrete
  • Fft
  • Interpolation
  • Integer Division
  • Ode
  • Poly
  • Source you can read
  • About RunMat