runmat 0.5.2-dev.1 → 0.5.2-dev.2

package/dist/generated/builtins/linprog.d.ts

@@ -0,0 +1,4 @@
+import type { BuiltinDoc } from "../../builtins.js";
+declare const builtinDoc: BuiltinDoc;
+export default builtinDoc;
+//# sourceMappingURL=linprog.d.ts.map

package/dist/generated/builtins/linprog.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linprog.d.ts","sourceRoot":"","sources":["../../../src/generated/builtins/linprog.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,QAAA,MAAM,UAAU,EAAE,UAqGjB,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins/linprog.js

@@ -0,0 +1,106 @@
+// @generated by scripts/generate-builtins.cjs
+// Do not edit by hand.
+const builtinDoc = {
+    "title": "linprog",
+    "category": "math/optim",
+    "keywords": [
+        "linprog",
+        "linear programming",
+        "optimization",
+        "linear constraints",
+        "bounds"
+    ],
+    "summary": "Solve linear programming minimization problems with inequality constraints, equality constraints, and bounds.",
+    "references": [],
+    "gpu_support": {
+        "elementwise": false,
+        "reduction": false,
+        "precisions": [],
+        "broadcasting": "none",
+        "notes": "The solver runs on the host. GPU-resident numeric inputs are gathered before solving."
+    },
+    "fusion": {
+        "elementwise": false,
+        "reduction": false,
+        "max_inputs": 7,
+        "constants": "inline"
+    },
+    "requires_feature": null,
+    "tested": {
+        "unit": "builtins::math::optim::linprog::tests",
+        "integration": null
+    },
+    "description": "`linprog` minimizes `f' * x` subject to `A*x <= b`, `Aeq*x == beq`, and `lb <= x <= ub`. Supported forms are `x = linprog(f,A,b)`, `x = linprog(f,A,b,Aeq,beq)`, `x = linprog(f,A,b,Aeq,beq,lb,ub)`, and the two-, three-, and four-output variants.",
+    "behaviors": [
+        "`f`, `b`, `beq`, `lb`, and `ub` must be numeric vectors with compatible lengths.",
+        "`A` and `Aeq` must be numeric matrices with one column per element of `f`.",
+        "`[]` may be passed for omitted optional `Aeq`, `beq`, `lb`, or `ub` arguments.",
+        "`exitflag` is `1` when an optimum is found, `-2` when no feasible point is found, and `-3` when the objective is unbounded below.",
+        "The fourth output is a struct with `iterations`, `algorithm`, `constrviolation`, and `message` fields.",
+        "Advanced MATLAB options, algorithms, problem structs, and lambda outputs are intentionally unsupported in this initial implementation."
+    ],
+    "examples": [
+        {
+            "description": "Solve a bounded linear program",
+            "input": "f = [-1; -2];\nA = [1 1];\nb = 4;\n[x, fval, exitflag] = linprog(f, A, b, [], [], [0; 0], [])",
+            "output": "x =\n     0\n     4\nfval =\n    -8\nexitflag =\n     1"
+        },
+        {
+            "description": "Use equality constraints and lower bounds",
+            "input": "f = [1; 2];\nA = [];\nb = [];\nAeq = [1 1];\nbeq = 3;\n[x, fval] = linprog(f, A, b, Aeq, beq, [1; 0], [])",
+            "output": "x =\n     3\n     0\nfval =\n     3"
+        },
+        {
+            "description": "Use a finite lower bound on one variable",
+            "input": "f = [1; 0];\n[x, fval, exitflag] = linprog(f, [], [], [], [], [2; -Inf], [])",
+            "output": "x =\n     2\n     0\nfval =\n     2\nexitflag =\n     1"
+        },
+        {
+            "description": "Optimize along an equality face",
+            "input": "f = [-1; 0; 0];\nA = [1 0 0];\nb = 1;\nAeq = [0 0 1];\nbeq = 0;\n[x, fval, exitflag] = linprog(f, A, b, Aeq, beq, [], [])",
+            "output": "x =\n     1\n     0\n     0\nfval =\n    -1\nexitflag =\n     1"
+        },
+        {
+            "description": "Inspect infeasible status",
+            "input": "[x, fval, exitflag, output] = linprog(1, [], [], [], [], 2, 1);\nexitflag",
+            "output": "exitflag =\n    -2"
+        }
+    ],
+    "faqs": [
+        {
+            "question": "Does linprog support optimoptions or MATLAB problem structs?",
+            "answer": "No. This implementation supports the common positional numeric call forms only."
+        },
+        {
+            "question": "Does linprog run on the GPU?",
+            "answer": "No. It gathers GPU-resident inputs and runs the active-set solve on the host."
+        }
+    ],
+    "links": [
+        {
+            "label": "fminbnd",
+            "url": "./fminbnd"
+        },
+        {
+            "label": "fsolve",
+            "url": "./fsolve"
+        },
+        {
+            "label": "optimset",
+            "url": "./optimset"
+        }
+    ],
+    "source": {
+        "label": "`crates/runmat-runtime/src/builtins/math/optim/linprog.rs`",
+        "url": "https://github.com/runmat-org/runmat/blob/main/crates/runmat-runtime/src/builtins/math/optim/linprog.rs"
+    },
+    "key": "linprog",
+    "slug": "linprog",
+    "aliases": [],
+    "categoryPath": [
+        "math",
+        "optim"
+    ]
+};
+export default builtinDoc;
+//# sourceMappingURL=linprog.js.map

package/dist/generated/builtins/linprog.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linprog.js","sourceRoot":"","sources":["../../../src/generated/builtins/linprog.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,uBAAuB;AAIvB,MAAM,UAAU,GAAe;IAC7B,OAAO,EAAE,SAAS;IAClB,UAAU,EAAE,YAAY;IACxB,UAAU,EAAE;QACV,SAAS;QACT,oBAAoB;QACpB,cAAc;QACd,oBAAoB;QACpB,QAAQ;KACT;IACD,SAAS,EAAE,+GAA+G;IAC1H,YAAY,EAAE,EAAE;IAChB,aAAa,EAAE;QACb,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,EAAE;QAChB,cAAc,EAAE,MAAM;QACtB,OAAO,EAAE,uFAAuF;KACjG;IACD,QAAQ,EAAE;QACR,aAAa,EAAE,KAAK;QACpB,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,QAAQ;KACtB;IACD,kBAAkB,EAAE,IAAI;IACxB,QAAQ,EAAE;QACR,MAAM,EAAE,uCAAuC;QAC/C,aAAa,EAAE,IAAI;KACpB;IACD,aAAa,EAAE,sPAAsP;IACrQ,WAAW,EAAE;QACX,kFAAkF;QAClF,4EAA4E;QAC5E,gFAAgF;QAChF,mIAAmI;QACnI,wGAAwG;QACxG,wIAAwI;KACzI;IACD,UAAU,EAAE;QACV;YACE,aAAa,EAAE,gCAAgC;YAC/C,OAAO,EAAE,+FAA+F;YACxG,QAAQ,EAAE,yDAAyD;SACpE;QACD;YACE,aAAa,EAAE,2CAA2C;YAC1D,OAAO,EAAE,2GAA2G;YACpH,QAAQ,EAAE,qCAAqC;SAChD;QACD;YACE,aAAa,EAAE,0CAA0C;YACzD,OAAO,EAAE,8EAA8E;YACvF,QAAQ,EAAE,yDAAyD;SACpE;QACD;YACE,aAAa,EAAE,iCAAiC;YAChD,OAAO,EAAE,2HAA2H;YACpI,QAAQ,EAAE,iEAAiE;SAC5E;QACD;YACE,aAAa,EAAE,2BAA2B;YAC1C,OAAO,EAAE,2EAA2E;YACpF,QAAQ,EAAE,oBAAoB;SAC/B;KACF;IACD,MAAM,EAAE;QACN;YACE,UAAU,EAAE,8DAA8D;YAC1E,QAAQ,EAAE,iFAAiF;SAC5F;QACD;YACE,UAAU,EAAE,8BAA8B;YAC1C,QAAQ,EAAE,+EAA+E;SAC1F;KACF;IACD,OAAO,EAAE;QACP;YACE,OAAO,EAAE,SAAS;YAClB,KAAK,EAAE,WAAW;SACnB;QACD;YACE,OAAO,EAAE,QAAQ;YACjB,KAAK,EAAE,UAAU;SAClB;QACD;YACE,OAAO,EAAE,UAAU;YACnB,KAAK,EAAE,YAAY;SACpB;KACF;IACD,QAAQ,EAAE;QACR,OAAO,EAAE,4DAA4D;QACrE,KAAK,EAAE,yGAAyG;KACjH;IACD,KAAK,EAAE,SAAS;IAChB,MAAM,EAAE,SAAS;IACjB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE;QACd,MAAM;QACN,OAAO;KACR;CACF,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/generated/builtins-manifest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"builtins-manifest.d.ts","sourceRoot":"","sources":["../../src/generated/builtins-manifest.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAE7E,eAAO,MAAM,eAAe,EAAE,oBAAoB,EA02QjD,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAwa9D,CAAC;AAEF,eAAO,MAAM,4BAA4B,sEAC0C,CAAC"}
+{"version":3,"file":"builtins-manifest.d.ts","sourceRoot":"","sources":["../../src/generated/builtins-manifest.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAE7E,eAAO,MAAM,eAAe,EAAE,oBAAoB,EA83QjD,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAya9D,CAAC;AAEF,eAAO,MAAM,4BAA4B,sEAC0C,CAAC"}

package/dist/generated/builtins-manifest.js

@@ -4277,6 +4277,26 @@ export const builtinManifest = [
         "summary": "Return largest-dimension length in MATLAB and RunMat.",
         "exampleCount": 5
     },
+    {
+        "key": "linprog",
+        "title": "linprog",
+        "slug": "linprog",
+        "aliases": [],
+        "category": "math/optim",
+        "categoryPath": [
+            "math",
+            "optim"
+        ],
+        "keywords": [
+            "linprog",
+            "linear programming",
+            "optimization",
+            "linear constraints",
+            "bounds"
+        ],
+        "summary": "Solve linear programming minimization problems with inequality constraints, equality constraints, and bounds.",
+        "exampleCount": 5
+    },
     {
         "key": "linsolve",
         "title": "linsolve",
@@ -8767,6 +8787,7 @@ export const builtinDocLoaders = {
     "le": () => import("./builtins/le.js").then((mod) => mod.default),
     "legend": () => import("./builtins/legend.js").then((mod) => mod.default),
     "length": () => import("./builtins/length.js").then((mod) => mod.default),
+    "linprog": () => import("./builtins/linprog.js").then((mod) => mod.default),
     "linsolve": () => import("./builtins/linsolve.js").then((mod) => mod.default),
     "linspace": () => import("./builtins/linspace.js").then((mod) => mod.default),
     "load": () => import("./builtins/load.js").then((mod) => mod.default),