@ohtaman/washi 0.5.0 → 0.6.0

package/dist/lib/washi.js

@@ -1,24 +1,24 @@
-import { A as e, C as t, D as n, E as r, M as i, N as a, O as o, S as s, T as c, _ as l, a as u, b as d, c as f, d as p, f as m, g as h, h as g, i as _, j as v, k as y, l as b, m as x, n as S, o as C, p as w, r as T, s as E, t as D, u as O, v as k, w as A, x as j, y as ee } from "./registry-BEfvpZW3.js";
-import { a as M, c as N, i as P, n as F, o as I, r as L, s as R, t as te } from "./loader-DmNC_UNk.js";
-import { createHighsWorker as ne } from "./highs-worker-factory.js";
+import { A as e, C as t, D as n, E as r, M as i, N as a, O as o, S as s, T as c, _ as l, a as u, b as d, c as f, d as p, f as m, g as h, h as g, i as _, j as v, k as y, l as b, m as x, n as S, o as C, p as w, r as T, s as E, t as D, u as O, v as k, w as A, x as j, y as ee } from "./registry-C20sxTwm.js";
+import { a as M, c as N, d as P, f as te, h as ne, i as re, l as ie, m as ae, n as oe, o as F, p as se, r as I, s as L, t as ce, u as le } from "./loader-BZUQNvh4.js";
+import { createHighsWorker as ue } from "./highs-worker-factory.js";
 //#region \0rolldown/runtime.js
-var re = Object.defineProperty, ie = Object.getOwnPropertyDescriptor, ae = Object.getOwnPropertyNames, oe = Object.prototype.hasOwnProperty, se = (e, t) => {
+var de = Object.defineProperty, fe = Object.getOwnPropertyDescriptor, pe = Object.getOwnPropertyNames, me = Object.prototype.hasOwnProperty, he = (e, t) => {
 	let n = {};
-	for (var r in e) re(n, r, {
+	for (var r in e) de(n, r, {
 		get: e[r],
 		enumerable: !0
 	});
-	return t || re(n, Symbol.toStringTag, { value: "Module" }), n;
-}, ce = (e, t, n, r) => {
-	if (t && typeof t == "object" || typeof t == "function") for (var i = ae(t), a = 0, o = i.length, s; a < o; a++) s = i[a], !oe.call(e, s) && s !== n && re(e, s, {
+	return t || de(n, Symbol.toStringTag, { value: "Module" }), n;
+}, ge = (e, t, n, r) => {
+	if (t && typeof t == "object" || typeof t == "function") for (var i = pe(t), a = 0, o = i.length, s; a < o; a++) s = i[a], !me.call(e, s) && s !== n && de(e, s, {
 		get: ((e) => t[e]).bind(null, s),
-		enumerable: !(r = ie(t, s)) || r.enumerable
+		enumerable: !(r = fe(t, s)) || r.enumerable
 	});
 	return e;
-}, z = (e, t, n) => (ce(e, t, "default"), n && ce(n, t, "default"));
+}, R = (e, t, n) => (ge(e, t, "default"), n && ge(n, t, "default"));
 //#endregion
 //#region src/modeler/types.ts
-function le(e) {
+function _e(e) {
 	if (e === void 0) return "Minimize";
 	if (typeof e == "string") {
 		let t = e.toLowerCase();
@@ -29,8 +29,8 @@ function le(e) {
 }
 //#endregion
 //#region src/modeler/parser.ts
-var ue = /^(?:[0-9]+(?:\.[0-9]+)?|\.[0-9]+)(?:[eE][+-]?[0-9]+)?$/;
-function de(e, t) {
+var ve = /^(?:[0-9]+(?:\.[0-9]+)?|\.[0-9]+)(?:[eE][+-]?[0-9]+)?$/;
+function ye(e, t) {
 	let n = [], r = 0, i = e.length;
 	for (; r < i;) {
 		let a = e[r];
@@ -86,7 +86,7 @@ function de(e, t) {
 					for (; r < i && (e[r] === "." || e[r] === "e" || e[r] === "E" || /[0-9]/.test(e[r]));) a += e[r++];
 				}
 			} else for (; r < i && (e[r] === "." || /[0-9]/.test(e[r]));) a += e[r++];
-			if (!ue.test(a)) throw Error(`Invalid numeric literal '${a}' at position ${t} in: "${e}"`);
+			if (!ve.test(a)) throw Error(`Invalid numeric literal '${a}' at position ${t} in: "${e}"`);
 			let o = Number(a);
 			if (!Number.isFinite(o)) throw Error(`Numeric literal '${a}' overflows finite floating-point range in: "${e}"`);
 			if (o === 0 && !/^[0.]+(?:[eE][+-]?\d+)?$/.test(a)) throw Error(`Numeric literal '${a}' underflows to zero at position ${t} in: "${e}"`);
@@ -113,7 +113,7 @@ function de(e, t) {
 	}
 	return n;
 }
-var fe = class {
+var be = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -214,15 +214,15 @@ var fe = class {
 		return t;
 	}
 };
-function B(e, t, n) {
-	let r = new fe(de(e, n), t), i = r.parseExpression(), a = r.getRemainingToken();
+function xe(e, t, n) {
+	let r = new be(ye(e, n), t), i = r.parseExpression(), a = r.getRemainingToken();
 	if (a) throw Error(`Unexpected token '${a.value}' after expression in "${e}"`);
-	return _e(i), i;
+	return Ee(i), i;
 }
-function pe(e, t) {
-	return B(e, t);
+function Se(e, t) {
+	return xe(e, t);
 }
-function me(e, t, n, r) {
+function Ce(e, t, n, r) {
 	let i = e.match(/(<=|>=|==|=<|=>|=)/);
 	if (!i) throw Error(`Constraint must contain a comparison operator (<=, >=, ==, =): "${e}"`);
 	let a = i[0], o = i.index, s = e.substring(0, o).trim(), c = e.substring(o + a.length).trim(), l;
@@ -230,19 +230,19 @@ function me(e, t, n, r) {
 	else if (a === ">=" || a === "=>") l = ">=";
 	else if (a === "==" || a === "=") l = "==";
 	else throw Error(`Unsupported operator "${a}"`);
-	let u = B(s, t, r), d = B(c, t, r);
+	let u = xe(s, t, r), d = xe(c, t, r);
 	if (u instanceof A && u.quadTerms.size > 0 || d instanceof A && d.quadTerms.size > 0) throw Error("Quadratic constraints are not supported (only linear constraints are allowed in MILP/LP/QP)");
 	let f = u instanceof A ? new j(u.linearTerms, u.constant) : u, p = d instanceof A ? new j(d.linearTerms, d.constant) : d, m;
-	if (m = l === "<=" ? f.le(p, n) : l === ">=" ? f.ge(p, n) : f.eq(p, n), _e(m.lhs), !Number.isFinite(m.rhs)) throw Error(`Invalid non-finite right-hand side "${m.rhs}" in constraint.`);
+	if (m = l === "<=" ? f.le(p, n) : l === ">=" ? f.ge(p, n) : f.eq(p, n), Ee(m.lhs), !Number.isFinite(m.rhs)) throw Error(`Invalid non-finite right-hand side "${m.rhs}" in constraint.`);
 	return m;
 }
-function he(e, t, n) {
-	return me(e, t, n);
+function we(e, t, n) {
+	return Ce(e, t, n);
 }
-function ge(e) {
+function Te(e) {
 	return e instanceof b || e instanceof j || e instanceof A ? !0 : typeof e != "object" || !e ? !1 : "terms" in e && e.terms instanceof Map || "quadTerms" in e && e.quadTerms instanceof Map || "id" in e && "name" in e && "lb" in e && "ub" in e && "type" in e && typeof e.mul == "function";
 }
-function _e(e) {
+function Ee(e) {
 	if ("constant" in e && !Number.isFinite(e.constant)) throw Error(`Invalid non-finite constant "${e.constant}" in expression.`);
 	if ("terms" in e && e.terms instanceof Map) {
 		for (let [, t] of e.terms) if (!Number.isFinite(t)) throw Error(`Invalid non-finite coefficient "${t}" in expression.`);
@@ -254,10 +254,10 @@ function _e(e) {
 		for (let [, t] of e.quadTerms) if (!Number.isFinite(t.coeff)) throw Error(`Invalid non-finite quadratic coefficient "${t.coeff}" in expression.`);
 	}
 }
-function ve(e) {
+function De(e) {
 	return e instanceof c || typeof e == "object" && !!e && "sense" in e && "lhs" in e && "rhs" in e;
 }
-function ye(e, t) {
+function Oe(e, t) {
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = e.join(""), a = "__washi_";
 	for (; i.includes(a);) a += "_";
 	let o = "";
@@ -267,9 +267,9 @@ function ye(e, t) {
 			if (!Number.isFinite(e)) throw Error(`Invalid numeric value "${e}" in template expression: interpolated numbers must be finite.`);
 			let t = `${a}num_${i}__`;
 			r.set(t, e), o += `(${t})`;
-		} else if (ve(e)) throw Error("Cannot interpolate a constraint comparison (<=, >=, ==) inside a template expression: expected a finite number, Var, LinExpr, or QuadExpr.");
-		else if (ge(e)) {
-			_e(e);
+		} else if (De(e)) throw Error("Cannot interpolate a constraint comparison (<=, >=, ==) inside a template expression: expected a finite number, Var, LinExpr, or QuadExpr.");
+		else if (Te(e)) {
+			Ee(e);
 			let t = `${a}ph_${i}__`;
 			n.set(t, e), o += ` ${t} `;
 		} else throw Error("Unsupported interpolation value in template expression: expected a finite number, Var, LinExpr, or QuadExpr.");
@@ -280,14 +280,14 @@ function ye(e, t) {
 		numberMap: r
 	};
 }
-function be(e, ...t) {
-	let { fullText: n, resolver: r, numberMap: i } = ye(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? me(n, r, void 0, i) : B(n, r, i);
+function ke(e, ...t) {
+	let { fullText: n, resolver: r, numberMap: i } = Oe(e, t);
+	return /(<=|>=|==|=<|=>|=)/.test(n) ? Ce(n, r, void 0, i) : xe(n, r, i);
 }
 //#endregion
 //#region src/modeler/solvers/highs/worker-client.ts
-var V = null, xe = 0, H = /* @__PURE__ */ new Map();
-function Se(e, t) {
+var z = null, Ae = 0, B = /* @__PURE__ */ new Map();
+function je(e, t) {
 	return e ? {
 		Status: "Interrupted",
 		StatusCode: 17,
@@ -311,8 +311,8 @@ function Se(e, t) {
 		Rows: []
 	};
 }
-function U(e) {
-	let t = H.values().next().value;
+function Me(e) {
+	let t = B.values().next().value;
 	if (t && !t.dispatched) {
 		t.dispatched = !0;
 		try {
@@ -324,30 +324,30 @@ function U(e) {
 				...t.reportProgress ? { reportProgress: !0 } : {}
 			});
 		} catch (n) {
-			H.delete(t.id), t.cleanupAbort?.(), t.reject(n), U(e);
+			B.delete(t.id), t.cleanupAbort?.(), t.reject(n), Me(e);
 		}
 	}
 }
-function Ce() {
-	let e = V;
-	e && (V = null, e.terminate());
-	for (let e of H.values()) e.dispatched = !1;
-	if (H.size > 0) {
-		let e = we();
-		if (e) U(e);
+function Ne() {
+	let e = z;
+	e && (z = null, e.terminate());
+	for (let e of B.values()) e.dispatched = !1;
+	if (B.size > 0) {
+		let e = Pe();
+		if (e) Me(e);
 		else {
 			let e = /* @__PURE__ */ Error("[WaSHI] Failed to recreate HiGHS Worker after interruption.");
-			for (let t of Array.from(H.values())) H.delete(t.id), t.cleanupAbort?.(), t.reject(e);
+			for (let t of Array.from(B.values())) B.delete(t.id), t.cleanupAbort?.(), t.reject(e);
 		}
 	}
 }
-function we() {
+function Pe() {
 	if (typeof window > "u" || typeof Worker > "u") return null;
-	if (!V) try {
-		V = ne();
-		let e = V;
-		V.onmessage = (t) => {
-			let { type: n, id: r, result: i, runTime: a, error: o, progress: s, incumbent: c } = t.data, l = H.get(r);
+	if (!z) try {
+		z = ue();
+		let e = z;
+		z.onmessage = (t) => {
+			let { type: n, id: r, result: i, runTime: a, error: o, progress: s, incumbent: c } = t.data, l = B.get(r);
 			if (l) {
 				if (n === "SOLVE_PROGRESS") {
 					if (s) {
@@ -355,10 +355,10 @@ function we() {
 						try {
 							l.onProgress?.(s);
 						} catch (e) {
-							let t = H.get(r);
+							let t = B.get(r);
 							if (t) {
-								let n = H.keys().next().value;
-								H.delete(r), t.cleanupAbort?.(), n === r && Ce(), t.reject(e);
+								let n = B.keys().next().value;
+								B.delete(r), t.cleanupAbort?.(), n === r && Ne(), t.reject(e);
 							}
 						}
 					}
@@ -368,41 +368,41 @@ function we() {
 					c && (l.lastIncumbent = c);
 					return;
 				}
-				H.delete(r), l.cleanupAbort?.(), n === "SOLVE_SUCCESS" ? l.resolve({
+				B.delete(r), l.cleanupAbort?.(), n === "SOLVE_SUCCESS" ? l.resolve({
 					result: i,
 					runTime: a
-				}) : l.reject(Error(o || "Worker solve failed")), V === e && U(e);
+				}) : l.reject(Error(o || "Worker solve failed")), z === e && Me(e);
 			}
 		};
 		let t = (t) => {
-			if (V === e) {
-				V = null, e.terminate();
-				for (let e of H.values()) e.cleanupAbort?.(), e.reject(t);
-				H.clear();
+			if (z === e) {
+				z = null, e.terminate();
+				for (let e of B.values()) e.cleanupAbort?.(), e.reject(t);
+				B.clear();
 			}
 		};
-		V.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e?.message || ""}`)), V.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
+		z.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e?.message || ""}`)), z.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
 	} catch {
-		V = null;
+		z = null;
 	}
-	return V;
+	return z;
 }
-async function W(e, t = {}) {
+async function V(e, t = {}) {
 	if (t.signal?.aborted) return {
-		result: Se(),
+		result: je(),
 		runTime: 0
 	};
-	let n = await I(t.wasmUrl);
+	let n = await F(t.wasmUrl);
 	if (t.signal?.aborted) return {
-		result: Se(),
+		result: je(),
 		runTime: 0
 	};
-	let r = t.useWorker ?? typeof window < "u" ? we() : null;
+	let r = t.useWorker ?? typeof window < "u" ? Pe() : null;
 	if (!r) return N(e, t);
 	let { signal: i, onProgress: a, ...o } = t, s = {};
 	for (let [e, t] of Object.entries(o)) typeof t != "function" && (s[e] = t);
 	s.wasmUrl = n;
-	let c = !!(a || i), l = `req_${++xe}`, u = performance.now();
+	let c = !!(a || i), l = `req_${++Ae}`, u = performance.now();
 	return new Promise((t, n) => {
 		let o = {
 			id: l,
@@ -416,24 +416,24 @@ async function W(e, t = {}) {
 		};
 		if (i) {
 			let e = () => {
-				let e = H.get(l);
+				let e = B.get(l);
 				if (!e) return;
-				let t = H.keys().next().value;
-				H.delete(l), e.cleanupAbort?.(), t === l && Ce();
+				let t = B.keys().next().value;
+				B.delete(l), e.cleanupAbort?.(), t === l && Ne();
 				let n = (performance.now() - e.startTime) / 1e3;
 				e.resolve({
-					result: Se(e.lastIncumbent, e.lastProgress),
+					result: je(e.lastIncumbent, e.lastProgress),
 					runTime: n
 				});
 			};
 			i.addEventListener("abort", e, { once: !0 }), o.cleanupAbort = () => i.removeEventListener("abort", e);
 		}
-		H.set(l, o), U(r);
+		B.set(l, o), Me(r);
 	});
 }
 //#endregion
 //#region src/modeler/solvers/highs/solver.ts
-function G(e, t) {
+function H(e, t) {
 	if (typeof t == "number") switch (t) {
 		case 0: return "NotSolved";
 		case 1:
@@ -492,8 +492,8 @@ function G(e, t) {
 	let r = n.toLowerCase();
 	return r.includes("infeasible") && r.includes("unbounded") ? "InfeasibleOrUnbounded" : r.includes("infeasible") ? "Infeasible" : r.includes("unbounded") ? "Unbounded" : r.includes("time limit") || r.includes("timelimit") ? "TimeLimit" : r.includes("iteration limit") || r.includes("iterationlimit") ? "IterationLimit" : r.includes("solution limit") || r.includes("solutionlimit") ? "SolutionLimit" : r.includes("memory limit") || r.includes("memorylimit") ? "MemoryLimit" : r.includes("bound on objective") ? "ObjectiveBound" : r.includes("target for objective") ? "ObjectiveTarget" : r.includes("interrupt") ? "Interrupted" : r.includes("error") ? "Error" : r === "optimal" ? "Optimal" : "Unknown";
 }
-function K(e, t, n) {
-	switch (G(e, t)) {
+function U(e, t, n) {
+	switch (H(e, t)) {
 		case "Optimal": return "Optimal";
 		case "Infeasible": return "Infeasible";
 		case "Unbounded": return "Unbounded";
@@ -510,14 +510,14 @@ function K(e, t, n) {
 		default: return "Unknown";
 	}
 }
-var q = class e {
+var W = class e {
 	static capabilities = {
 		supportsMIP: !0,
 		supportsQP: !0,
 		supportsWarmStart: !0
 	};
 	name = "HiGHS";
-	version = "1.15.3";
+	version = "1.15.1";
 	capabilities = e.capabilities;
 	options;
 	constructor(e = {}) {
@@ -529,7 +529,7 @@ var q = class e {
 			...i
 		}, o = e.objective.constant || 0;
 		for (let t of e.variables) d(t);
-		let { lpString: s, nameToVar: c, nameToConstraint: l } = r ? t : C(e), u = Object.create(null), p = !1, m = /* @__PURE__ */ new Set();
+		let { lpString: s, nameToVar: c, nameToConstraint: l } = r ? t : C(e, { relax: a.relax }), u = Object.create(null), p = !1, m = /* @__PURE__ */ new Set();
 		for (let [e, t] of c.entries()) {
 			m.add(t);
 			let n = w(t);
@@ -551,13 +551,13 @@ var q = class e {
 			...o === 0 ? {} : { objectiveOffset: o },
 			initialValues: p ? u : void 0
 		});
-		let { result: g, runTime: _ } = await W(s, h), v = g?.ObjectiveOffsetApplied ? 0 : o, y = G(g?.Status, g?.StatusCode), b = typeof g?.IsMip == "boolean" ? g.IsMip : e.variables.some((e) => e.type === "Integer" || e.type === "Binary"), x;
+		let { result: g, runTime: _ } = await V(s, h), v = g?.ObjectiveOffsetApplied ? 0 : o, y = H(g?.Status, g?.StatusCode), b = a.relax ? !1 : typeof g?.IsMip == "boolean" ? g.IsMip : e.variables.some((e) => e.type === "Integer" || e.type === "Binary"), x;
 		if (typeof g?.HasPrimalSolution == "boolean") x = g.HasPrimalSolution;
 		else {
 			let e = g?.Columns ? Object.values(g.Columns) : [], t = e.length > 0 && e.some((e) => typeof e?.Primal == "number" && Number.isFinite(e.Primal)), n = typeof g?.ObjectiveValue == "number" && Number.isFinite(g.ObjectiveValue);
 			x = y === "Infeasible" || y === "Unbounded" || y === "InfeasibleOrUnbounded" || y === "Error" || y === "NotSolved" ? !1 : y === "Optimal" || y === "Feasible" ? n || t : n && (e.length === 0 || t);
 		}
-		let S = K(g?.Status, g?.StatusCode, x), T = null;
+		let S = U(g?.Status, g?.StatusCode, x), T = null;
 		x && typeof g?.ObjectiveValue == "number" && Number.isFinite(g.ObjectiveValue) && (T = g.ObjectiveValue + v);
 		let D, O, k;
 		if (typeof g?.MipDualBound == "number" && Number.isFinite(g.MipDualBound) ? D = g.MipDualBound + v : !b && y === "Optimal" && T !== null && (D = T), T !== null && D !== void 0 && Number.isFinite(D) && (k = Math.abs(T - D)), v !== 0 && b && T !== null && D !== void 0 && k !== void 0) {
@@ -632,55 +632,69 @@ var q = class e {
 			raw: g
 		};
 	}
-}, J = q;
-function Y() {
-	T("highs", (e) => new q(e)), _((e) => new q(e));
+}, G = W;
+function K() {
+	T("highs", (e) => new W(e)), _((e) => new W(e));
 }
-Y();
+K();
 //#endregion
 //#region src/modeler/solvers/highs/index.ts
-var Te = /* @__PURE__ */ se({
-	HiGHS: () => J,
-	HighsSolver: () => q,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => te,
-	getHighs: () => F,
-	getHighsWasmUrl: () => L,
-	isValidWasmHeader: () => P,
-	mapHighsStatus: () => K,
-	mapHighsTerminationStatus: () => G,
+var Fe = /* @__PURE__ */ he({
+	HIGHS_CONSTANTS: () => ie,
+	HIGHS_STATUS_NAMES: () => le,
+	HiGHS: () => G,
+	Highs: () => P,
+	HighsError: () => te,
+	HighsModel: () => se,
+	HighsSolver: () => W,
+	HighsUnsupportedOptionError: () => ae,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => ce,
+	bindHighsFunctions: () => ne,
+	getHighs: () => oe,
+	getHighsWasmUrl: () => I,
+	isValidWasmHeader: () => re,
+	mapHighsStatus: () => U,
+	mapHighsTerminationStatus: () => H,
 	probeWasmUrl: () => M,
-	registerHighsSolver: () => Y,
-	resolveBrowserWasmUrl: () => I,
-	setHighsWasmUrl: () => R,
-	solveLp: () => W,
+	registerHighsSolver: () => K,
+	resolveBrowserWasmUrl: () => F,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
 	solveLpWithHighs: () => N
 });
-import * as Ee from "./highs-worker-factory.js";
-z(Te, Ee);
-import * as De from "./highs-assets.js";
-z(Te, De);
+import * as Ie from "./highs-worker-factory.js";
+R(Fe, Ie);
+import * as Le from "./highs-assets.js";
+R(Fe, Le);
 //#endregion
 //#region src/modeler/solvers/highs.ts
-var Oe = /* @__PURE__ */ se({
-	HiGHS: () => J,
-	HighsSolver: () => q,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => te,
-	getHighs: () => F,
-	getHighsWasmUrl: () => L,
-	isValidWasmHeader: () => P,
-	mapHighsStatus: () => K,
-	mapHighsTerminationStatus: () => G,
+var Re = /* @__PURE__ */ he({
+	HIGHS_CONSTANTS: () => ie,
+	HIGHS_STATUS_NAMES: () => le,
+	HiGHS: () => G,
+	Highs: () => P,
+	HighsError: () => te,
+	HighsModel: () => se,
+	HighsSolver: () => W,
+	HighsUnsupportedOptionError: () => ae,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => ce,
+	bindHighsFunctions: () => ne,
+	getHighs: () => oe,
+	getHighsWasmUrl: () => I,
+	isValidWasmHeader: () => re,
+	mapHighsStatus: () => U,
+	mapHighsTerminationStatus: () => H,
 	probeWasmUrl: () => M,
-	registerHighsSolver: () => Y,
-	resolveBrowserWasmUrl: () => I,
-	setHighsWasmUrl: () => R,
-	solveLp: () => W,
+	registerHighsSolver: () => K,
+	resolveBrowserWasmUrl: () => F,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
 	solveLpWithHighs: () => N
 });
-z(Oe, Te);
+R(Re, Fe);
 //#endregion
 //#region src/modeler/solvers/mock.ts
-var ke = class {
+var ze = class {
 	name;
 	capabilities;
 	options;
@@ -780,44 +794,51 @@ var ke = class {
 		};
 	}
 };
-function Ae() {
-	T("mock", (e) => new ke(e));
+function Be() {
+	T("mock", (e) => new ze(e));
 }
-Ae();
+Be();
 //#endregion
 //#region src/modeler/solvers/index.ts
-var je = /* @__PURE__ */ se({
-	HiGHS: () => J,
-	HighsSolver: () => q,
-	MockSolver: () => ke,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => te,
-	getHighs: () => F,
-	getHighsWasmUrl: () => L,
+var Ve = /* @__PURE__ */ he({
+	HIGHS_CONSTANTS: () => ie,
+	HIGHS_STATUS_NAMES: () => le,
+	HiGHS: () => G,
+	Highs: () => P,
+	HighsError: () => te,
+	HighsModel: () => se,
+	HighsSolver: () => W,
+	HighsUnsupportedOptionError: () => ae,
+	MockSolver: () => ze,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => ce,
+	bindHighsFunctions: () => ne,
+	getHighs: () => oe,
+	getHighsWasmUrl: () => I,
 	getSolver: () => D,
-	isValidWasmHeader: () => P,
+	isValidWasmHeader: () => re,
 	listAvailableSolvers: () => S,
-	mapHighsStatus: () => K,
-	mapHighsTerminationStatus: () => G,
+	mapHighsStatus: () => U,
+	mapHighsTerminationStatus: () => H,
 	probeWasmUrl: () => M,
-	registerHighsSolver: () => Y,
-	registerMockSolver: () => Ae,
+	registerHighsSolver: () => K,
+	registerMockSolver: () => Be,
 	registerSolver: () => T,
-	resolveBrowserWasmUrl: () => I,
+	resolveBrowserWasmUrl: () => F,
 	setDefaultSolver: () => _,
-	setHighsWasmUrl: () => R,
-	solveLp: () => W,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
 	solveLpWithHighs: () => N
 });
-z(je, Oe);
+R(Ve, Re);
 //#endregion
 //#region src/modeler/solution-validator.ts
-function Me(e, t) {
+function He(e, t) {
 	if (e === void 0) return 1e-6;
 	if (typeof e != "number" || !Number.isFinite(e) || e < 0) throw Error(`Invalid ${t}: expected a finite non-negative number, received ${String(e)}.`);
 	return e;
 }
-function Ne(e, t = {}) {
-	let r = Me(t.feasibilityTolerance, "feasibilityTolerance"), i = Me(t.integralityTolerance, "integralityTolerance"), a = t.evaluateLogicalConstraints === void 0 || !!t.evaluateLogicalConstraints, s = t.values !== void 0 && t.values !== null;
+function Ue(e, t = {}) {
+	let r = He(t.feasibilityTolerance, "feasibilityTolerance"), i = He(t.integralityTolerance, "integralityTolerance"), a = t.evaluateLogicalConstraints === void 0 || !!t.evaluateLogicalConstraints, s = t.values !== void 0 && t.values !== null;
 	if (t.values !== void 0 && (typeof t.values != "object" || t.values === null || Array.isArray(t.values))) throw Error("Invalid values option: expected a plain object mapping variable names to values.");
 	let l = t.values, u = [], d = Object.create(null), f = [], p = [], m = 0, h = (e) => {
 		typeof e == "number" && !Number.isNaN(e) && e > m && (m = e);
@@ -1191,10 +1212,10 @@ function Ne(e, t = {}) {
 }
 //#endregion
 //#region src/modeler/big-m.ts
-function Pe(e, t) {
+function We(e, t) {
 	if (typeof e != "number" || !Number.isFinite(e) || e <= 0) throw Error(`Invalid Big-M value for indicator constraint "${t}": expected a finite positive number, received ${e}.`);
 }
-function Fe(e, t, n) {
+function Ge(e, t, n) {
 	let r = e.constant === void 0 ? 0 : e.constant;
 	if (!Number.isFinite(t) || !Number.isFinite(r)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": constraint contains non-finite constant (${r}) or right-hand side (${t}).`);
 	let i = t - r;
@@ -1205,8 +1226,8 @@ function Fe(e, t, n) {
 	}
 	return i;
 }
-function Ie(e, t, n) {
-	let r = Fe(e, t, n), i = 0;
+function q(e, t, n) {
+	let r = Ge(e, t, n), i = 0;
 	for (let [t, r] of e.terms) {
 		if (r === 0) continue;
 		let e;
@@ -1226,8 +1247,8 @@ function Ie(e, t, n) {
 	if (!Number.isFinite(o) || !Number.isFinite(r + o)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": derived Big-M (${o}) or shifted right-hand side overflows finite floating-point range. Please rescale coefficients/bounds or specify a finite { M } explicitly.`);
 	return o;
 }
-function Le(e, t, n) {
-	let r = Fe(e, t, n), i = 0;
+function J(e, t, n) {
+	let r = Ge(e, t, n), i = 0;
 	for (let [t, r] of e.terms) {
 		if (r === 0) continue;
 		let e;
@@ -1247,10 +1268,10 @@ function Le(e, t, n) {
 	if (!Number.isFinite(o) || !Number.isFinite(r - o)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": derived Big-M (${o}) or shifted right-hand side overflows finite floating-point range. Please rescale coefficients/bounds or specify a finite { M } explicitly.`);
 	return o;
 }
-function X(e, t, n, r, i, a, o) {
+function Y(e, t, n, r, i, a, o) {
 	if (!(e instanceof b && (e.type === "Binary" || e.type === "Integer" && e.lb === 0 && e.ub === 1))) throw Error(`Indicator variable "${e?.name ?? String(e)}" must be a Binary variable (or Integer variable with bounds [0, 1]), received "${e?.type ?? typeof e}" with bounds [${e?.lb}, ${e?.ub}].`);
 	if (!Number.isFinite(e.lb) || !Number.isFinite(e.ub) || e.lb < 0 || e.ub > 1 || e.lb > e.ub) throw Error(`Binary indicator variable "${e.name}" has invalid bounds [${e.lb}, ${e.ub}]. Binary variables must stay within [0, 1] with lb <= ub.`);
-	let s = Fe(t, r, o);
+	let s = Ge(t, r, o);
 	if (i !== 0 && i !== 1) throw Error(`Invalid activeValue: ${i}. Indicator activation value must be 0 or 1.`);
 	if (n !== "<=" && n !== ">=") throw Error(`Invalid indicator sense for "${o}": expected "<=" or ">=", received "${String(n)}".`);
 	if (!Number.isFinite(a) || a < 0) throw Error(`Invalid Big-M value for indicator constraint "${o}": expected a finite non-negative number, received ${a}.`);
@@ -1266,6 +1287,527 @@ function X(e, t, n, r, i, a, o) {
 	};
 }
 //#endregion
+//#region src/modeler/linearizer.ts
+function X(e, t = 0) {
+	return new j(new Map(e), t);
+}
+function Ke(e, t, r, i) {
+	let a = [...e], s = [...r], l = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
+	for (let e of r) u.set(e, e.name);
+	let d = new Set(e.map((e) => e.name)), f = 0;
+	function p(e) {
+		let t;
+		do
+			t = `__washi_${e}_${++f}`;
+		while (d.has(t));
+		return d.add(t), t;
+	}
+	for (let e of t) {
+		let t = e.name;
+		d.has(t) ? t = p(`bool_${e.name}`) : d.add(t);
+		let n = new b({
+			name: t,
+			type: "Binary",
+			lb: 0,
+			ub: 1
+		});
+		l.set(e, n), a.push(n);
+	}
+	function m(e, t) {
+		if (e instanceof qe) return e.wrappedVar;
+		if (e instanceof o) {
+			let n = l.get(e);
+			if (!n) throw Error(`Unregistered BoolVar "${e.name}" in logical constraint "${t}".`);
+			return n;
+		}
+		let n = new b({
+			name: p("expr"),
+			type: "Binary",
+			lb: 0,
+			ub: 1
+		});
+		return a.push(n), g(n, e, t), n;
+	}
+	function h(e, t, n, r) {
+		let i = new c(X([
+			[e, 1],
+			[t, -1],
+			[n, -1]
+		], 0), "<=", 0, `${r}_xor_1`), a = new c(X([
+			[e, 1],
+			[t, -1],
+			[n, 1]
+		], 0), ">=", 0, `${r}_xor_2`), o = new c(X([
+			[e, 1],
+			[n, -1],
+			[t, 1]
+		], 0), ">=", 0, `${r}_xor_3`), l = new c(X([
+			[e, 1],
+			[t, 1],
+			[n, 1]
+		], 0), "<=", 2, `${r}_xor_4`);
+		s.push(i, a, o, l), u.set(i, r), u.set(a, r), u.set(o, r), u.set(l, r);
+	}
+	function g(e, t, r) {
+		if (t instanceof o) {
+			let n = l.get(t), i = new c(X([[e, 1], [n, -1]], 0), "==", 0, `${r}_equiv`);
+			s.push(i), u.set(i, r);
+			return;
+		}
+		if (t instanceof n) {
+			if (t.op === "not") {
+				let n = m(t.children[0], r), i = new c(X([[e, 1], [n, 1]], 0), "==", 1, `${r}_not`);
+				s.push(i), u.set(i, r);
+				return;
+			}
+			if (t.op === "and") {
+				let n = t.children.map((e) => m(e, r));
+				for (let t = 0; t < n.length; t++) {
+					let i = new c(X([[e, 1], [n[t], -1]], 0), "<=", 0, `${r}_and_ub_${t}`);
+					s.push(i), u.set(i, r);
+				}
+				let i = [[e, 1], ...n.map((e) => [e, -1])], a = new c(X(i, 0), ">=", 1 - n.length, `${r}_and_lb`);
+				s.push(a), u.set(a, r);
+				return;
+			}
+			if (t.op === "or") {
+				let n = t.children.map((e) => m(e, r));
+				for (let t = 0; t < n.length; t++) {
+					let i = new c(X([[e, 1], [n[t], -1]], 0), ">=", 0, `${r}_or_lb_${t}`);
+					s.push(i), u.set(i, r);
+				}
+				let i = [[e, 1], ...n.map((e) => [e, -1])], a = new c(X(i, 0), "<=", 0, `${r}_or_ub`);
+				s.push(a), u.set(a, r);
+				return;
+			}
+			if (t.op === "implies") {
+				let n = m(t.children[0], r), i = m(t.children[1], r), a = new c(X([
+					[e, 1],
+					[i, -1],
+					[n, 1]
+				], 0), ">=", 0, `${r}_imp_1`), o = new c(X([
+					[e, 1],
+					[n, 1],
+					[i, -1]
+				], 0), "<=", 1, `${r}_imp_2`);
+				s.push(a, o), u.set(a, r), u.set(o, r);
+				return;
+			}
+			if (t.op === "xor") {
+				if (t.children.length === 0) {
+					let t = new c(X([[e, 1]], 0), "==", 0, `${r}_xor_empty`);
+					s.push(t), u.set(t, r);
+					return;
+				}
+				if (t.children.length === 1) {
+					let n = m(t.children[0], r), i = new c(X([[e, 1], [n, -1]], 0), "==", 0, `${r}_xor_single`);
+					s.push(i), u.set(i, r);
+					return;
+				}
+				let n = t.children.map((e) => m(e, r)), i = n[0];
+				for (let e = 1; e < n.length - 1; e++) {
+					let t = new b({
+						name: p(`xor_fold_${e}`),
+						type: "Binary",
+						lb: 0,
+						ub: 1
+					});
+					a.push(t), h(t, i, n[e], `${r}_xor_fold_${e}`), i = t;
+				}
+				h(e, i, n[n.length - 1], r);
+				return;
+			}
+		}
+		throw Error(`Unsupported logical element in equivalence linearization: ${t}`);
+	}
+	for (let e of i) {
+		let t = e.name, n = e.expr;
+		_(n, t);
+	}
+	function _(e, t) {
+		if (e instanceof o) {
+			let n = l.get(e), r = new c(X([[n, 1]], 0), ">=", 1, t);
+			s.push(r), u.set(r, t);
+			return;
+		}
+		if (e instanceof n) {
+			if (e.op === "not") {
+				let n = e.children[0];
+				if (n instanceof o) {
+					let e = l.get(n), r = new c(X([[e, 1]], 0), "<=", 0, t);
+					s.push(r), u.set(r, t);
+					return;
+				}
+				let r = m(n, t), i = new c(X([[r, 1]], 0), "<=", 0, t);
+				s.push(i), u.set(i, t);
+				return;
+			}
+			if (e.op === "and") {
+				for (let n = 0; n < e.children.length; n++) _(e.children[n], `${t}_and_${n}`);
+				return;
+			}
+			if (e.op === "or") {
+				if (e.children.every((e) => e instanceof o || e instanceof n)) {
+					let n = e.children.map((e) => m(e, t)).map((e) => [e, 1]), r = new c(X(n, 0), ">=", 1, t);
+					s.push(r), u.set(r, t);
+					return;
+				}
+				let r = [];
+				for (let n = 0; n < e.children.length; n++) {
+					let i = e.children[n], o = new b({
+						name: p(`or_branch_${n}`),
+						type: "Binary",
+						lb: 0,
+						ub: 1
+					});
+					if (a.push(o), r.push(o), i instanceof c) v(o, i, 1, `${t}_or_branch_${n}`, t);
+					else {
+						let e = m(i, t), r = new c(X([[o, 1], [e, -1]], 0), "<=", 0, `${t}_or_bool_${n}`);
+						s.push(r), u.set(r, t);
+					}
+				}
+				let i = r.map((e) => [e, 1]), l = new c(X(i, 0), ">=", 1, t);
+				s.push(l), u.set(l, t);
+				return;
+			}
+			if (e.op === "xor") {
+				if (e.children.length === 0) {
+					let e = new b({
+						name: p("unsat"),
+						type: "Binary",
+						lb: 0,
+						ub: 0
+					});
+					a.push(e);
+					let n = new c(X([[e, 1]], 0), ">=", 1, t);
+					s.push(n), u.set(n, t);
+					return;
+				}
+				if (e.children.length === 1) {
+					_(e.children[0], t);
+					return;
+				}
+				let n = e.children.map((e) => m(e, t));
+				if (n.length === 2) {
+					let e = new c(X([[n[0], 1], [n[1], 1]], 0), "==", 1, t);
+					s.push(e), u.set(e, t);
+					return;
+				}
+				let r = n[0];
+				for (let e = 1; e < n.length - 1; e++) {
+					let i = new b({
+						name: p(`xor_fold_${e}`),
+						type: "Binary",
+						lb: 0,
+						ub: 1
+					});
+					a.push(i), h(i, r, n[e], `${t}_xor_fold_${e}`), r = i;
+				}
+				let i = n[n.length - 1], o = new c(X([[r, 1], [i, 1]], 0), "==", 1, t);
+				s.push(o), u.set(o, t);
+				return;
+			}
+			if (e.op === "implies") {
+				let [r, i] = e.children;
+				if (r instanceof c && r.lhs.terms.size === 1 && r.lhs.constant === 0) {
+					let [[e, n]] = Array.from(r.lhs.terms.entries());
+					if ((e.type === "Binary" || e.type === "Integer" && e.lb === 0 && e.ub === 1) && n === 1) {
+						let n = null;
+						if (r.sense === "==" && r.rhs === 1 ? n = 1 : r.sense === "==" && r.rhs === 0 || r.sense === "<=" && r.rhs === 0 ? n = 0 : r.sense === ">=" && r.rhs === 1 && (n = 1), n !== null && i instanceof c) {
+							v(e, i, n, t, t);
+							return;
+						}
+					}
+				}
+				let d;
+				if (r instanceof c ? (d = new b({
+					name: p("ante"),
+					type: "Binary",
+					lb: 0,
+					ub: 1
+				}), a.push(d), v(d, r, 1, `${t}_ante_active`, t)) : d = m(r, t), i instanceof c) {
+					v(d, i, 1, t, t);
+					return;
+				}
+				if (i instanceof o) {
+					let e = l.get(i), n = new c(X([[e, 1], [d, -1]], 0), ">=", 0, t);
+					s.push(n), u.set(n, t);
+					return;
+				}
+				if (i instanceof n) {
+					if (i.op === "and") {
+						for (let e = 0; e < i.children.length; e++) _(new n("implies", [d instanceof b ? new qe(d) : r, i.children[e]]), `${t}_and_${e}`);
+						return;
+					}
+					if (i.op === "not") {
+						let e = i.children[0], n = m(e, t), r = new c(X([[d, 1], [n, 1]], 0), "<=", 1, t);
+						s.push(r), u.set(r, t);
+						return;
+					}
+					let e = m(i, t), a = new c(X([[e, 1], [d, -1]], 0), ">=", 0, t);
+					s.push(a), u.set(a, t);
+					return;
+				}
+			}
+		}
+		throw Error(`Unsupported top-level logical constraint "${t}": ${e}`);
+	}
+	function v(e, t, n, r, i) {
+		let { lhs: a, sense: o, rhs: l } = t;
+		if (o === "<=" || o === ">=") {
+			let t = Y(e, a, o, l, n, o === "<=" ? q(a, l, r) : J(a, l, r), r), d = new c(t.lhs, o, t.rhs, r);
+			s.push(d), u.set(d, i);
+		} else {
+			let t = q(a, l, `${r}_le`), o = J(a, l, `${r}_ge`), d = Y(e, a, "<=", l, n, t, `${r}_le`), f = Y(e, a, ">=", l, n, o, `${r}_ge`), p = new c(d.lhs, "<=", d.rhs, `${r}_le`), m = new c(f.lhs, ">=", f.rhs, `${r}_ge`);
+			s.push(p, m), u.set(p, i), u.set(m, i);
+		}
+	}
+	return {
+		variables: a,
+		constraints: s,
+		boolVarToBinary: l,
+		constraintToOriginalName: u
+	};
+}
+var qe = class extends o {
+	wrappedVar;
+	constructor(e) {
+		super(e.name), this.wrappedVar = e;
+	}
+};
+//#endregion
+//#region src/decomposition/column-generation.ts
+async function Je(e) {
+	let t = e.master;
+	if (!t) throw Error("A master Model must be provided for solveColumnGeneration.");
+	let { pricing: n, maxIterations: r = 100, reducedCostTolerance: i = 1e-6, finalizeAsMIP: a = !0, solver: o, solverOptions: s, onIteration: c } = e, l = t.sense.toLowerCase() === "maximize", u = n;
+	if (!u) throw Error("The 'pricing' callback must be provided in ColumnGenerationOptions.");
+	let d = [], f = null, p = 0, m = t.status;
+	for (let e = 1; e <= r; e++) {
+		p = e;
+		let n = await t.relax(o, s);
+		if (m = n, n !== "Optimal" && n !== "Feasible" || !t.solution) break;
+		f = t.objectiveValue;
+		let r = t.solution, a = r.duals || {}, h = (e) => typeof e == "string" ? a[e] ?? 0 : e.dual ?? (e.name ? a[e.name] ?? 0 : 0), g = await u({
+			iteration: e,
+			duals: a,
+			getDual: h,
+			masterSolution: r,
+			reducedCostTolerance: i,
+			master: t
+		}), _ = [];
+		g && (Array.isArray(g) ? _.push(...g) : _.push(g));
+		let v = [];
+		for (let e of _) {
+			let t = e.reducedCost;
+			if (typeof t != "number" || !Number.isFinite(t)) {
+				let n = 0, r = e.coefficients;
+				if (Array.isArray(r)) for (let e of r) Array.isArray(e) ? n += e[1] * h(e[0]) : e && typeof e == "object" && (n += e.coeff * h(e.constraint));
+				else if (r instanceof Map) for (let [e, t] of r.entries()) n += t * h(e);
+				else if (r && typeof r == "object") for (let [e, t] of Object.entries(r)) n += t * h(e);
+				t = e.cost - n;
+			}
+			(l ? t > i : t < -i) && v.push(e);
+		}
+		if (c && c({
+			iteration: e,
+			relaxationObjective: f,
+			columnsAdded: d.length + v.length,
+			proposedColumns: v
+		}), v.length === 0) break;
+		for (let e of v) {
+			let n = t.addColumn({
+				name: e.name,
+				type: e.type || "Continuous",
+				lb: e.lb,
+				ub: e.ub,
+				cost: e.cost,
+				coefficients: e.coefficients
+			});
+			d.push({
+				variable: n,
+				proposal: e
+			});
+		}
+	}
+	let h = f;
+	a && (m === "Optimal" || m === "Feasible") && (m = await t.solve(o, s), h = t.objectiveValue);
+	let g = {};
+	for (let e of t.variables) e.value !== null && (g[e.name] = e.value);
+	let _ = {
+		status: m,
+		objectiveValue: h,
+		relaxationObjectiveValue: f,
+		iterations: p,
+		columnsAdded: d.length,
+		generatedColumns: d,
+		master: t,
+		values: g
+	};
+	return t.decomposition = _, _;
+}
+//#endregion
+//#region src/modeler/objective.ts
+function Ye(e, t) {
+	let n = e;
+	if (n instanceof c || typeof n == "object" && n && "sense" in n && "lhs" in n && "rhs" in n) throw Error(`Cannot use a Constraint as an objective in ${t}(). Use m.constraint(expr\`... <= ...\`) for constraints, or supply an unconstrained arithmetic expression to ${t}(), e.g. m.objective(${t}(expr\`30 * \${x}\`)).`);
+	if (typeof n == "string" && /(<=|>=|==|=<|=>|=)/.test(n)) throw Error(`Cannot use a comparison constraint as an objective in ${t}(). Use m.constraint(expr\`... <= ...\`) for constraints, or supply an unconstrained arithmetic expression to ${t}(), e.g. m.objective(${t}(expr\`30 * \${x}\`)).`);
+	if (typeof n == "number") {
+		if (!Number.isFinite(n)) throw Error(`Invalid non-finite objective constant "${n}" passed to ${t}().`);
+		return n;
+	}
+	if (typeof n == "string" || n instanceof j || n instanceof A || n instanceof b || typeof n == "object" && n && ("terms" in n && n.terms instanceof Map && typeof n.constant == "number" || "quadTerms" in n && n.quadTerms instanceof Map && "linearTerms" in n && n.linearTerms instanceof Map && typeof n.constant == "number" || "id" in n && "name" in n && "lb" in n && "ub" in n)) return n;
+	throw Error(`Invalid expression passed to ${t}(): expected a finite number, Var, LinExpr, QuadExpr, or arithmetic expression string.`);
+}
+function Xe(e) {
+	return {
+		expr: Ye(e, "maximize"),
+		sense: "Maximize"
+	};
+}
+function Ze(e) {
+	return {
+		expr: Ye(e, "minimize"),
+		sense: "Minimize"
+	};
+}
+//#endregion
+//#region src/decomposition/benders.ts
+function Qe(e) {
+	return !!(e && typeof e == "object" && "constraints" in e && "variables" in e && typeof e.solve == "function");
+}
+async function $e(e, t, n, r, i, a, o, s, l = 1) {
+	let u = [];
+	for (let r = 0; r < t.length; r++) {
+		let a = t[r], o = a.lhs, s = a.sense, d = a.rhs - (o.constant || 0), f = [], p = [], m = 0;
+		for (let [e, t] of o.terms.entries()) if (e.ownerModel === n || n.getVarByName(e.name) !== void 0) {
+			p.push([e, t]);
+			let n = i[e.name] ?? 0;
+			m += t * n;
+		} else f.push([e, t]);
+		let h = d - m, g = new j();
+		for (let [e, t] of f) g.addTerm(e, t);
+		let _ = `__benders_link_${l}_${r}`, v = new c(g, s, h, _);
+		e.constraint(v), u.push({
+			origConstraint: a,
+			subConstr: v,
+			masterTerms: p,
+			baseRhs: d
+		});
+	}
+	let d = await e.solve(o, {
+		...s,
+		relax: !0
+	});
+	if (d !== "Optimal" && d !== "Feasible") return null;
+	let f = e.objectiveValue ?? 0, p = i[r.name] ?? 0, m = 1e-4;
+	if (!(a ? p < f - m : p > f + m)) return null;
+	let h = 0, g = /* @__PURE__ */ new Map(), _ = new Set(u.map((e) => e.subConstr.name));
+	for (let t of e.constraints) {
+		if (_.has(t.name)) continue;
+		let n = e.solution?.duals[t.name] ?? t.dual ?? 0;
+		if (Math.abs(n) > 1e-12) {
+			let e = t.rhs - (t.lhs.constant || 0);
+			h += n * e;
+		}
+	}
+	for (let t of u) {
+		let n = e.solution?.duals[t.subConstr.name] ?? t.subConstr.dual ?? 0;
+		if (Math.abs(n) > 1e-12) {
+			h += n * t.baseRhs;
+			for (let [e, r] of t.masterTerms) {
+				let t = g.get(e) ?? 0;
+				g.set(e, t + n * r);
+			}
+		}
+	}
+	let v = new j();
+	v.addTerm(r, 1);
+	for (let [e, t] of g.entries()) Math.abs(t) > 1e-12 && v.addTerm(e, t);
+	let y = new c(v, a ? ">=" : "<=", h, `__benders_opt_cut_${l}`), b = (n.objectiveValue ?? 0) - p + f;
+	return {
+		kind: "optimality",
+		constraint: y,
+		name: y.name,
+		subproblemObjective: b
+	};
+}
+async function et(e) {
+	let t = e.master;
+	if (!t) throw Error("A master Model must be provided for solveBenders.");
+	let { subproblem: n, maxIterations: r = 100, gapTolerance: i = 1e-4, solver: a, solverOptions: o, onIteration: s } = e, c;
+	e.theta && (c = typeof e.theta == "string" ? t.getVarByName(e.theta) : e.theta), c ||= t.variables.find((e) => e.name === "theta" || e.name === "__benders_theta");
+	let l = 0, u = 0, d = t.status, f, p, m, h = {}, g = null;
+	for (let e = 1; e <= r; e++) {
+		u = e;
+		let r = await t.solve(a, o);
+		if (d = r, r !== "Optimal" && r !== "Feasible") break;
+		let _ = t.objectiveValue, v = t.sense.toLowerCase() === "minimize";
+		v ? f = _ === null ? f : _ : p = _ === null ? p : _;
+		let y = {};
+		for (let e of t.variables) e.value !== null && (y[e.name] = e.value);
+		let b = await n({
+			iteration: e,
+			masterValues: y,
+			getMasterValue: (e) => typeof e == "string" ? y[e] ?? 0 : e.value ?? (e.name ? y[e.name] ?? 0 : 0),
+			masterObjective: _,
+			lowerBound: f,
+			upperBound: p,
+			master: t
+		}), x = [];
+		if (b) {
+			if (Qe(b)) {
+				let n = b, r = n.linkingConstraints;
+				c || (c = t.continuous("__benders_theta", { lb: 0 }), v ? t.objective(Ze(t.objectiveExpr.add(c))) : t.objective(Xe(t.objectiveExpr.sub(c))));
+				let i = await $e(n, r, t, c, y, v, a, o, e);
+				i && x.push(i);
+			} else Array.isArray(b) ? x.push(...b) : x.push(b);
+		}
+		for (let e of x) if (typeof e.subproblemObjective == "number" && Number.isFinite(e.subproblemObjective)) {
+			if (v) {
+				let t = e.subproblemObjective;
+				(p === void 0 || t < p) && (p = t, g = t, h = { ...y });
+			} else {
+				let t = e.subproblemObjective;
+				(f === void 0 || t > f) && (f = t, g = t, h = { ...y });
+			}
+		}
+		if (f !== void 0 && p !== void 0) {
+			let e = Math.abs(p) + 1e-10;
+			m = Math.abs(p - f) / e;
+		}
+		if (s && s({
+			iteration: e,
+			masterObjective: _,
+			lowerBound: f,
+			upperBound: p,
+			cutsAdded: l + x.length,
+			proposedCuts: x
+		}), x.length === 0) {
+			g = _, h = { ...y };
+			break;
+		}
+		if (m !== void 0 && m <= i) break;
+		for (let e of x) t.constraint(e.constraint, e.name), l++;
+	}
+	let _ = Object.keys(h).length > 0 ? h : (() => {
+		let e = {};
+		for (let n of t.variables) n.value !== null && (e[n.name] = n.value);
+		return e;
+	})(), v = g === null ? t.objectiveValue : g, y = {
+		status: d,
+		objectiveValue: v,
+		lowerBound: f,
+		upperBound: p,
+		gap: m,
+		iterations: u,
+		cutsAdded: l,
+		master: t,
+		values: _
+	};
+	return t.decomposition = y, y;
+}
+//#endregion
 //#region src/modeler/model.ts
 function Z(e) {
 	return Array.isArray(e) || typeof e == "object" && !!e && !(e instanceof String) && typeof e[Symbol.iterator] == "function";
@@ -1273,10 +1815,13 @@ function Z(e) {
 function Q(e) {
 	return typeof e == "object" && !!e && !Array.isArray(e) && !(e instanceof String) && typeof e[Symbol.iterator] != "function";
 }
+function tt(e) {
+	return e instanceof b || typeof e == "object" && !!e && !(e instanceof r) && !(e instanceof c) && "id" in e && "name" in e && "lb" in e && "ub" in e && !("terms" in e) && !("quadTerms" in e) && !("sense" in e);
+}
 function $(e, t) {
 	if (!Number.isInteger(e) || e < 0) throw Error(`Invalid count (${e}) for ${t} variable creation: count must be a non-negative integer.`);
 }
-var Re = class {
+var nt = class {
 	name;
 	_sense;
 	_objectiveExpr;
@@ -1285,6 +1830,7 @@ var Re = class {
 	boolVars = [];
 	logicalConstraints = [];
 	unsatCore = void 0;
+	_conflicts = void 0;
 	values = /* @__PURE__ */ new Map();
 	varMapByName = /* @__PURE__ */ new Map();
 	varPrefixCounters = /* @__PURE__ */ new Map();
@@ -1305,6 +1851,8 @@ var Re = class {
 	runTime = 0;
 	solution = null;
 	solver = null;
+	decomposition;
+	_linkingConstraints;
 	hasSolutionState = !1;
 	modelRevision = 0;
 	activeOperationId = 0;
@@ -1316,13 +1864,13 @@ var Re = class {
 		n = typeof e == "string" ? {
 			...t,
 			name: e
-		} : e, this.name = n.name || "OptimizationModel", this._sense = le(n.sense), this._objectiveExpr = new j(), n.solver && (this.solver = D(n.solver));
+		} : e, this.name = n.name || "OptimizationModel", this._sense = _e(n.sense), this._objectiveExpr = new j(), n.solver && (this.solver = D(n.solver));
 	}
 	get sense() {
 		return this._sense;
 	}
 	set sense(e) {
-		let t = le(e);
+		let t = _e(e);
 		this._sense !== t && (this._sense = t, this.recordModelMutation());
 	}
 	get objectiveExpr() {
@@ -1332,7 +1880,10 @@ var Re = class {
 		this.applyObjective(e);
 	}
 	get conflicts() {
-		return this.unsatCore;
+		return this._conflicts ?? this.unsatCore;
+	}
+	set conflicts(e) {
+		this._conflicts = e;
 	}
 	get numVars() {
 		return this.variables.length;
@@ -1342,7 +1893,7 @@ var Re = class {
 	}
 	clearSolutionFields() {
 		if (this.hasSolutionState || this.status !== "NotSolved" || this.terminationStatus !== "NotSolved" || this.hasPrimalSolution || this.solution !== null || this.unsatCore !== void 0) {
-			this.hasSolutionState = !1, this.status = "NotSolved", this.terminationStatus = "NotSolved", this.hasPrimalSolution = !1, this.objectiveValue = null, this.objectiveBound = void 0, this.relGap = void 0, this.mipGap = void 0, this.absGap = void 0, this.solution = null, this.runTime = 0, this.unsatCore = void 0, this.values.clear();
+			this.hasSolutionState = !1, this.status = "NotSolved", this.terminationStatus = "NotSolved", this.hasPrimalSolution = !1, this.objectiveValue = null, this.objectiveBound = void 0, this.relGap = void 0, this.mipGap = void 0, this.absGap = void 0, this.solution = null, this.runTime = 0, this.unsatCore = void 0, this._conflicts = void 0, this.values.clear();
 			for (let e of this.variables) e.value = null, e.reducedCost = null;
 			for (let e of this.boolVars) e.value = null;
 			for (let e of this.constraints) e.dual = null, e.slack = null;
@@ -1467,6 +2018,37 @@ var Re = class {
 	continuous(e, t, n) {
 		return this.createDomainVars("Continuous", e, t, n);
 	}
+	addColumn(e) {
+		let t = e.type || "Continuous", n = this.addVar({
+			name: e.name,
+			type: t,
+			lb: e.lb,
+			ub: e.ub
+		});
+		if (typeof e.cost == "number" && e.cost !== 0 && (this._objectiveExpr = this._objectiveExpr.add(n.mul(e.cost)), this.recordModelMutation()), e.coefficients) {
+			if (Array.isArray(e.coefficients)) {
+				for (let t of e.coefficients) if (Array.isArray(t)) {
+					let [e, r] = t, i = typeof e == "string" ? this.getConstraintByName(e) : e;
+					if (!i) throw Error(`Constraint '${String(e)}' not found in model when adding column`);
+					i.addTerm(n, r);
+				} else if (typeof t == "object" && t) {
+					let e = typeof t.constraint == "string" ? this.getConstraintByName(t.constraint) : t.constraint;
+					if (!e) throw Error(`Constraint '${String(t.constraint)}' not found in model when adding column`);
+					e.addTerm(n, t.coeff);
+				}
+			} else if (e.coefficients instanceof Map) for (let [t, r] of e.coefficients.entries()) {
+				let e = typeof t == "string" ? this.getConstraintByName(t) : t;
+				if (!e) throw Error(`Constraint '${String(t)}' not found in model when adding column`);
+				e.addTerm(n, r);
+			}
+			else if (typeof e.coefficients == "object") for (let [t, r] of Object.entries(e.coefficients)) {
+				let e = this.getConstraintByName(t);
+				if (!e) throw Error(`Constraint '${t}' not found in model when adding column`);
+				e.addTerm(n, r);
+			}
+		}
+		return n;
+	}
 	bool(e, t, n) {
 		let r = typeof e == "number", i = typeof t == "number", a = Z(e), o = Z(t);
 		if (i || o) {
@@ -1572,12 +2154,16 @@ var Re = class {
 		return this.logicalConstrMapByName.get(e);
 	}
 	objective(e) {
-		return e ? (this.applyObjective(e.expr, e.sense), this) : this.objectiveExpr;
+		if (arguments.length === 0) return this.objectiveExpr;
+		let t = e;
+		if (t instanceof c || typeof t == "object" && t && "sense" in t && "lhs" in t && "rhs" in t || typeof t == "string" && /(<=|>=|==|=<|=>|=)/.test(t)) throw Error("Cannot use a Constraint as an objective. Did you mean to use m.constraint(expr`... <= ...`)? To set an objective, wrap an unconstrained expression with maximize(...) or minimize(...), e.g. m.objective(maximize(expr`30 * ${x}`)).");
+		if (typeof t != "object" || !t || !("expr" in t) || !("sense" in t)) throw Error("m.objective(...) expects an ObjectiveSpec created with maximize(...) or minimize(...), e.g. m.objective(maximize(expr`30 * ${x}`)).");
+		return this.applyObjective(t.expr, t.sense), this;
 	}
 	applyObjective(e, t) {
-		if (e instanceof c || typeof e == "object" && e && "sense" in e && "lhs" in e && "rhs" in e || typeof e == "string" && /(<=|>=|==|=<|=>|=)/.test(e)) throw Error(typeof e == "string" ? "Cannot use a comparison constraint as an objective. Did you mean to use m.constraint(expr`... <= ...`)?" : "Cannot use a Constraint as an objective. Did you mean to use m.constraint(expr`... <= ...`)? For objectives, supply an unconstrained expression like expr`45 * ${x} + 80 * ${y}`.");
-		let n = t === void 0 ? this.sense : le(t), r;
-		if (typeof e == "string") r = pe(e, (e) => this.getVarByName(e));
+		if (e instanceof c || typeof e == "object" && e && "sense" in e && "lhs" in e && "rhs" in e || typeof e == "string" && /(<=|>=|==|=<|=>|=)/.test(e)) throw Error(typeof e == "string" ? "Cannot use a comparison constraint as an objective. Did you mean to use m.constraint(expr`... <= ...`)? To set an objective, wrap an unconstrained expression with maximize(...) or minimize(...), e.g. m.objective(maximize(expr`30 * ${x}`))." : "Cannot use a Constraint as an objective. Did you mean to use m.constraint(expr`... <= ...`)? To set an objective, wrap an unconstrained expression with maximize(...) or minimize(...), e.g. m.objective(maximize(expr`30 * ${x}`)).");
+		let n = t === void 0 ? this.sense : _e(t), r;
+		if (typeof e == "string") r = Se(e, (e) => this.getVarByName(e));
 		else if (typeof e == "number") r = new j(/* @__PURE__ */ new Map(), e);
 		else if (e instanceof A) r = e.clone();
 		else if (e instanceof j) r = e.clone();
@@ -1598,6 +2184,7 @@ var Re = class {
 		});
 		if (e instanceof A || typeof e == "object" && e && "quadTerms" in e) throw Error("Constraint must contain a comparison operator (<=, >=, ==): cannot add a quadratic expression as a constraint.");
 		if (e instanceof j || typeof e == "object" && e && "terms" in e) throw Error("Constraint must contain a comparison operator (<=, >=, ==): cannot add a linear expression without a comparison operator. Use expr`... <= ...` or .le(), .ge(), .eq().");
+		if (tt(e)) throw Error(`Cannot add numeric variable "${e.name}" directly as a constraint without a comparison operator (<=, >=, ==). Numeric variables require a comparison such as expr\`\${x} <= 10\` or x.le(10), whereas propositional BoolVar variables must be created with m.bool().`);
 		return this.addConstraint(e, t), this;
 	}
 	getValues(e) {
@@ -1614,6 +2201,7 @@ var Re = class {
 	addConstraint(e, t) {
 		if (e instanceof A || typeof e == "object" && e && "quadTerms" in e) throw Error("Constraint must contain a comparison operator (<=, >=, ==): cannot add a quadratic expression as a constraint.");
 		if (e instanceof j || typeof e == "object" && e && "terms" in e) throw Error("Constraint must contain a comparison operator (<=, >=, ==): cannot add a linear expression without a comparison operator. Use expr`... <= ...` or .le(), .ge(), .eq().");
+		if (tt(e)) throw Error(`Cannot add numeric variable "${e.name}" directly as a constraint without a comparison operator (<=, >=, ==). Numeric variables require a comparison such as expr\`\${x} <= 10\` or x.le(10), whereas propositional BoolVar variables must be created with m.bool().`);
 		if (e instanceof r) {
 			let n = typeof t == "string" && t.trim().length > 0 ? t.trim() : void 0;
 			if (n !== void 0) {
@@ -1633,7 +2221,8 @@ var Re = class {
 			};
 			return this.logicalConstraints.push(a), this.logicalConstrMapByName.set(i, a), this.recordModelMutation(), e;
 		}
-		let n = typeof e == "string" ? he(e, (e) => this.getVarByName(e), t) : e;
+		let n = typeof e == "string" ? we(e, (e) => this.getVarByName(e), t) : e;
+		if (typeof n != "object" || !n || !("sense" in n) || !("lhs" in n) || !("rhs" in n)) throw Error("Invalid constraint passed to m.constraint(...): expected a linear Constraint (e.g. expr`${x} <= 10` or x.le(10)), a propositional BoolVar/BoolExpr (created with m.bool()), or an array of constraints.");
 		n.ownerModel && n.ownerModel !== this && (h(n, this.name, (e) => this.varMapByName.get(e.name) === e, n.name), p(n, this));
 		let i = typeof t == "string" && t.trim().length > 0 ? t.trim() : n.hasExplicitName ? n.name.trim() : void 0;
 		if (i !== void 0) {
@@ -1652,40 +2241,41 @@ var Re = class {
 		}), this.batchDepth === 0 && (this.batchUndoActions = []), n._assignModelName(o, !0), n.ownerModel = this, this.constraints.push(n), this.constrMapByName.set(n.name, n), this.recordModelMutation(), n;
 	}
 	indicator(e, t, n = {}) {
-		if (!(e instanceof b)) throw Error("Invalid binary variable passed to indicator(). Expected a binary Var instance.");
-		if (!(e.type === "Binary" || e.type === "Integer" && e.lb === 0 && e.ub === 1)) throw Error(`Invalid variable "${e.name}" passed to indicator(): variable has type "${e.type}" with bounds [${e.lb}, ${e.ub}]. Indicator activation variable must be a Binary variable (or Integer variable with bounds [0, 1]).`);
-		if (t instanceof A) throw Error("Quadratic expressions or constraints are not supported in indicator constraints (only linear constraints are allowed).");
-		if (!("sense" in t) || !("lhs" in t)) throw Error("Invalid constraint expression passed to indicator(). Expression must include a comparison operator (<=, >=, ==).");
-		let r = t, i = n.activeValue === void 0 ? 1 : n.activeValue;
-		if (i !== 0 && i !== 1) throw Error(`Invalid activeValue: ${i}. Indicator activeValue must be 0 or 1.`);
+		if (e instanceof r) throw Error("Invalid binary variable passed to indicator(): received a propositional BoolVar/BoolExpr, but m.indicator() requires a 0-1 numeric binary Var created with m.binary(). For general boolean logic with m.bool(), use m.constraint(implies(flag, expr`${x} <= 10`)) with the Z3 solver.");
+		if (!(e instanceof b)) throw Error("Invalid binary variable passed to indicator(). Expected a 0-1 binary Var instance created with m.binary() (or use implies(flag, ...) with m.bool() and the Z3 solver for general boolean logic).");
+		if (!(e.type === "Binary" || e.type === "Integer" && e.lb === 0 && e.ub === 1)) throw Error(`Invalid variable "${e.name}" passed to indicator(): variable has type "${e.type}" with bounds [${e.lb}, ${e.ub}]. Indicator activation variable must be a Binary variable created with m.binary() (or Integer variable with bounds [0, 1]).`);
+		if (t instanceof A || typeof t == "object" && t && "quadTerms" in t) throw Error("Quadratic expressions or constraints are not supported in indicator constraints (only linear Constraints with <=, >=, or == such as expr`${x} <= 10` are allowed).");
+		if (typeof t != "object" || !t || !("sense" in t) || !("lhs" in t) || !("rhs" in t)) throw Error("Invalid constraint expression passed to indicator(). Expression must include a comparison operator (<=, >=, ==), e.g. m.indicator(b, expr`${x} <= 10`). For general boolean logic (such as BoolVar or implies/and/or/not), use m.constraint(implies(flag, ...)) with the Z3 solver.");
+		let i = t, a = n.activeValue === void 0 ? 1 : n.activeValue;
+		if (a !== 0 && a !== 1) throw Error(`Invalid activeValue: ${a}. Indicator activeValue must be 0 or 1.`);
 		if (this.varMapByName.get(e.name) !== e) throw Error(`Variable "${e.name}" passed to indicator() does not belong to model "${this.name}". All variables must belong to the model by object identity.`);
-		let a = typeof n.name == "string" && n.name.trim().length > 0 ? n.name.trim() : void 0, o = this.constrPrefixCounters.get("c"), { lhs: s, sense: l, rhs: u } = r, d, f, p;
-		if (a !== void 0) d = a, f = l === "==" ? `${d}_le` : d, p = l === "==" ? `${d}_ge` : d;
-		else if (r.hasExplicitName) d = `ind_${e.name}_${r.name.trim()}`, f = l === "==" ? `${d}_le` : d, p = l === "==" ? `${d}_ge` : d;
+		let o = typeof n.name == "string" && n.name.trim().length > 0 ? n.name.trim() : void 0, s = this.constrPrefixCounters.get("c"), { lhs: l, sense: u, rhs: d } = i, f, p, m;
+		if (o !== void 0) f = o, p = u === "==" ? `${f}_le` : f, m = u === "==" ? `${f}_ge` : f;
+		else if (i.hasExplicitName) f = `ind_${e.name}_${i.name.trim()}`, p = u === "==" ? `${f}_le` : f, m = u === "==" ? `${f}_ge` : f;
 		else do {
 			let t = this.getNextConstrName("c");
-			d = `ind_${e.name}_${t}`, f = l === "==" ? `${d}_le` : d, p = l === "==" ? `${d}_ge` : d;
-		} while ((l === "<=" || l === "==") && (this.hasConstraintName(f) || this.hasBoolVarName(f)) || (l === ">=" || l === "==") && (this.hasConstraintName(p) || this.hasBoolVarName(p)));
-		let m = [];
+			f = `ind_${e.name}_${t}`, p = u === "==" ? `${f}_le` : f, m = u === "==" ? `${f}_ge` : f;
+		} while ((u === "<=" || u === "==") && (this.hasConstraintName(p) || this.hasBoolVarName(p)) || (u === ">=" || u === "==") && (this.hasConstraintName(m) || this.hasBoolVarName(m)));
+		let g = [];
 		try {
-			if ((l === "<=" || l === "==") && (this.hasConstraintName(f) || this.hasBoolVarName(f))) throw Error(this.hasBoolVarName(f) ? `Constraint name '${f}' conflicts with an existing Boolean variable in model` : `Constraint with name '${f}' already exists in model`);
-			if ((l === ">=" || l === "==") && (this.hasConstraintName(p) || this.hasBoolVarName(p))) throw Error(this.hasBoolVarName(p) ? `Constraint name '${p}' conflicts with an existing Boolean variable in model` : `Constraint with name '${p}' already exists in model`);
-			n.M !== void 0 && Pe(n.M, d);
+			if ((u === "<=" || u === "==") && (this.hasConstraintName(p) || this.hasBoolVarName(p))) throw Error(this.hasBoolVarName(p) ? `Constraint name '${p}' conflicts with an existing Boolean variable in model` : `Constraint with name '${p}' already exists in model`);
+			if ((u === ">=" || u === "==") && (this.hasConstraintName(m) || this.hasBoolVarName(m))) throw Error(this.hasBoolVarName(m) ? `Constraint name '${m}' conflicts with an existing Boolean variable in model` : `Constraint with name '${m}' already exists in model`);
+			n.M !== void 0 && We(n.M, f);
 			let t = (e) => this.varMapByName.get(e.name) === e;
-			for (let [e] of s.terms) if (!t(e)) throw Error(`Variable "${e.name}" in constraint "${d}" does not belong to model "${this.name}". All variables must belong to the model by object identity.`);
-			if (l === "<=" || l === "==") {
-				let t = X(e, s, "<=", u, i, n.M === void 0 ? Ie(s, u, f) : n.M, f);
-				m.push([new c(t.lhs, "<=", t.rhs, f), f]);
+			for (let [e] of l.terms) if (!t(e)) throw Error(`Variable "${e.name}" in constraint "${f}" does not belong to model "${this.name}". All variables must belong to the model by object identity.`);
+			if (u === "<=" || u === "==") {
+				let t = Y(e, l, "<=", d, a, n.M === void 0 ? q(l, d, p) : n.M, p);
+				g.push([new c(t.lhs, "<=", t.rhs, p), p]);
 			}
-			if (l === ">=" || l === "==") {
-				let t = X(e, s, ">=", u, i, n.M === void 0 ? Le(s, u, p) : n.M, p);
-				m.push([new c(t.lhs, ">=", t.rhs, p), p]);
+			if (u === ">=" || u === "==") {
+				let t = Y(e, l, ">=", d, a, n.M === void 0 ? J(l, d, m) : n.M, m);
+				g.push([new c(t.lhs, ">=", t.rhs, m), m]);
 			}
-			for (let [e, n] of m) h(e, this.name, t, n);
+			for (let [e, n] of g) h(e, this.name, t, n);
 		} catch (e) {
-			throw o === void 0 ? this.constrPrefixCounters.delete("c") : this.constrPrefixCounters.set("c", o), e;
+			throw s === void 0 ? this.constrPrefixCounters.delete("c") : this.constrPrefixCounters.set("c", s), e;
 		}
-		return this.runTransactionalBatch(() => m.map(([e, t]) => this.addConstraint(e, t)));
+		return this.runTransactionalBatch(() => g.map(([e, t]) => this.addConstraint(e, t)));
 	}
 	toLpString() {
 		this.validateIntegrity();
@@ -1750,14 +2340,31 @@ var Re = class {
 			activeOptions: r
 		};
 	}
+	async relax(e, t) {
+		let n = typeof e == "object" && !!e && !("solve" in e), r = n ? {
+			...e,
+			relax: !0
+		} : {
+			...t || {},
+			relax: !0
+		}, i = n ? void 0 : e;
+		return i ? this.solve(i, r) : this.solve(r);
+	}
 	async solve(e, t) {
 		let n = ++this.activeOperationId, r = this.modelRevision;
 		this.clearSolutionFields(), this.validateIntegrity();
 		let { activeSolver: i, activeOptions: a } = this.resolveSolverAndOptions(e, t);
 		if (this._objectiveExpr instanceof A && this._objectiveExpr.quadTerms.size > 0 && i.capabilities?.supportsQP === !1) throw Error(`Solver "${i.name}" does not support quadratic objectives (QP). Please use a QP-capable solver such as HiGHS or Clarabel.`);
-		if (this.logicalConstraints.length > 0 && i.capabilities?.supportsSMT !== !0) throw Error(`Solver "${i.name}" does not support SMT / logical constraints (or, implies, not, xor). Please use an SMT-capable solver such as Z3.`);
-		if (this.variables.some((e) => e.initialValue !== void 0) && i.capabilities?.supportsWarmStart !== !0) throw Error(`Solver "${i.name}" does not support primal initial values (initialValue). Please use a solver with warm-start support such as HiGHS.`);
-		let o = {
+		let o, s = null;
+		if (this.logicalConstraints.length > 0 && i.capabilities?.supportsSMT !== !0 ? (s = Ke(this.variables, this.boolVars, this.constraints, this.logicalConstraints), o = {
+			name: this.name,
+			sense: this.sense,
+			objective: this._objectiveExpr,
+			constraints: s.constraints,
+			variables: s.variables,
+			logicalConstraints: [],
+			boolVars: []
+		}) : o = {
 			name: this.name,
 			sense: this.sense,
 			objective: this._objectiveExpr,
@@ -1765,53 +2372,64 @@ var Re = class {
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, s = this.wrapSolveOptions(a, r, n), c;
+		}, this.variables.some((e) => e.initialValue !== void 0) && i.capabilities?.supportsWarmStart !== !0) throw Error(`Solver "${i.name}" does not support primal initial values (initialValue). Please use a solver with warm-start support such as HiGHS.`);
+		let c = this.wrapSolveOptions(a, r, n), l;
 		try {
-			c = await i.solve(o, s);
+			l = await i.solve(o, c);
 		} catch (e) {
 			throw this.activeOperationId === n && this.clearSolutionFields(), e;
 		}
-		this.ensureExecutionValid(r, n, "solve"), this.runTime = c.runTime ?? 0, this.status = c.status, this.terminationStatus = c.terminationStatus ?? c.status;
-		let l = this.hasPrimalFromResult(c);
-		this.hasPrimalSolution = l, this.objectiveValue = l && typeof c.objectiveValue == "number" && Number.isFinite(c.objectiveValue) ? c.objectiveValue : null, this.objectiveBound = typeof c.objectiveBound == "number" && Number.isFinite(c.objectiveBound) ? c.objectiveBound : void 0;
-		let u = typeof c.relGap == "number" && Number.isFinite(c.relGap) ? c.relGap : typeof c.mipGap == "number" && Number.isFinite(c.mipGap) ? c.mipGap : void 0;
-		this.relGap = u, this.mipGap = u, this.absGap = typeof c.absGap == "number" && Number.isFinite(c.absGap) ? c.absGap : this.objectiveValue !== null && this.objectiveBound !== void 0 ? Math.abs(this.objectiveValue - this.objectiveBound) : void 0;
-		let d = (e, t, n) => {
+		this.ensureExecutionValid(r, n, "solve"), this.runTime = l.runTime ?? 0, this.status = l.status, this.terminationStatus = l.terminationStatus ?? l.status;
+		let u = this.hasPrimalFromResult(l);
+		this.hasPrimalSolution = u, this.objectiveValue = u && typeof l.objectiveValue == "number" && Number.isFinite(l.objectiveValue) ? l.objectiveValue : null, this.objectiveBound = typeof l.objectiveBound == "number" && Number.isFinite(l.objectiveBound) ? l.objectiveBound : void 0;
+		let d = typeof l.relGap == "number" && Number.isFinite(l.relGap) ? l.relGap : typeof l.mipGap == "number" && Number.isFinite(l.mipGap) ? l.mipGap : void 0;
+		this.relGap = d, this.mipGap = d, this.absGap = typeof l.absGap == "number" && Number.isFinite(l.absGap) ? l.absGap : this.objectiveValue !== null && this.objectiveBound !== void 0 ? Math.abs(this.objectiveValue - this.objectiveBound) : void 0;
+		let f = (e, t, n) => {
 			Object.defineProperty(e, t, {
 				value: n,
 				enumerable: !0,
 				writable: !0,
 				configurable: !0
 			});
-		}, f = {}, p = {}, m = {}, h = {};
-		if (this.values.clear(), l && c.values) {
-			for (let [e, t] of Object.entries(c.values)) if (typeof t == "number" && Number.isFinite(t)) {
+		}, p = {}, m = {}, h = {}, g = {};
+		if (this.values.clear(), u && l.values) {
+			for (let [e, t] of Object.entries(l.values)) if (typeof t == "number" && Number.isFinite(t)) {
 				let n = this.getVarByName(e), r = this.getBoolVarByName(e);
-				n && (n.value = t, d(f, n.name, t), this.values.set(n.name, t)), r && (r.value = !!t, this.values.set(r.name, t)), !n && !r && this.values.set(e, t);
+				n && (n.value = t, f(p, n.name, t), this.values.set(n.name, t)), r && (r.value = !!t, this.values.set(r.name, t)), !n && !r && this.values.set(e, t);
 			} else if (typeof t == "boolean") {
 				let n = t, r = this.getBoolVarByName(e);
-				r ? (r.value = n, d(f, r.name, +!!n), this.values.set(r.name, n)) : this.values.set(e, n);
+				r ? (r.value = n, f(p, r.name, +!!n), this.values.set(r.name, n)) : this.values.set(e, n);
+			}
+			if (s) for (let e of this.boolVars) {
+				let t = s.boolVarToBinary.get(e);
+				if (t && l.values) {
+					let n = l.values[t.name];
+					if (typeof n == "number" && Number.isFinite(n)) {
+						let t = Math.round(n) === 1;
+						e.value = t, f(p, e.name, +!!t), this.values.set(e.name, t);
+					}
+				}
 			}
 		}
-		if (l && c.boolValues) for (let [e, t] of Object.entries(c.boolValues)) {
+		if (u && l.boolValues) for (let [e, t] of Object.entries(l.boolValues)) {
 			if (typeof t != "boolean") continue;
 			let n = this.getBoolVarByName(e);
 			n ? (n.value = t, this.values.has(n.name) || this.values.set(n.name, t)) : this.values.has(e) || this.values.set(e, t);
 		}
-		if (l && c.reducedCosts) for (let [e, t] of Object.entries(c.reducedCosts)) {
+		if (u && l.reducedCosts) for (let [e, t] of Object.entries(l.reducedCosts)) {
 			if (typeof t != "number" || !Number.isFinite(t)) continue;
 			let n = this.getVarByName(e);
-			n && (n.reducedCost = t, d(m, n.name, t));
+			n && (n.reducedCost = t, f(h, n.name, t));
 		}
-		if (c.duals) for (let [e, t] of Object.entries(c.duals)) {
+		if (l.duals) for (let [e, t] of Object.entries(l.duals)) {
 			if (typeof t != "number" || !Number.isFinite(t)) continue;
 			let n = this.getConstraintByName(e);
-			n && (n.dual = t, d(p, n.name, t));
+			n && (n.dual = t, f(m, n.name, t));
 		}
-		if (c.slacks) for (let [e, t] of Object.entries(c.slacks)) {
+		if (l.slacks) for (let [e, t] of Object.entries(l.slacks)) {
 			if (typeof t != "number" || !Number.isFinite(t)) continue;
 			let n = this.getConstraintByName(e);
-			n && (n.slack = t, d(h, n.name, t));
+			n && (n.slack = t, f(g, n.name, t));
 		}
 		return this.solution = {
 			status: this.status,
@@ -1824,19 +2442,18 @@ var Re = class {
 				mipGap: this.mipGap
 			},
 			...this.absGap === void 0 ? {} : { absGap: this.absGap },
-			values: f,
-			duals: p,
-			reducedCosts: m,
-			slacks: h,
+			values: p,
+			duals: m,
+			reducedCosts: h,
+			slacks: g,
 			runTime: this.runTime,
-			raw: c.raw
+			raw: l.raw
 		}, this.hasSolutionState = !0, this.status;
 	}
 	async check(e, t) {
 		let n = ++this.activeOperationId, r = this.modelRevision;
 		this.clearSolutionFields(), this.validateIntegrity();
 		let { activeSolver: i, activeOptions: a } = this.resolveSolverAndOptions(e, t);
-		if (this.logicalConstraints.length > 0 && i.capabilities?.supportsSMT !== !0) throw Error(`Solver "${i.name}" does not support SMT / logical constraints (or, implies, not, xor). Please use an SMT-capable solver such as Z3.`);
 		if (this.variables.some((e) => e.initialValue !== void 0) && i.capabilities?.supportsWarmStart !== !0) throw Error(`Solver "${i.name}" does not support primal initial values (initialValue). Please use a solver with warm-start support such as HiGHS.`);
 		let o = this.wrapSolveOptions(a, r, n), s = (e, t, n) => {
 			Object.defineProperty(e, t, {
@@ -1845,7 +2462,7 @@ var Re = class {
 				writable: !0,
 				configurable: !0
 			});
-		}, c = {
+		}, l = {
 			name: this.name,
 			variables: this.variables,
 			boolVars: this.boolVars,
@@ -1855,11 +2472,11 @@ var Re = class {
 		if (typeof i.check == "function") {
 			let e;
 			try {
-				e = await i.check(c, o);
+				e = await i.check(l, o);
 			} catch (e) {
 				throw this.activeOperationId === n && this.clearSolutionFields(), e;
 			}
-			this.ensureExecutionValid(r, n, "check"), this.status = e.status, this.terminationStatus = a.signal?.aborted ? "Interrupted" : e.status, this.hasPrimalSolution = e.status === "Sat", this.runTime = e.runTime ?? 0, this.unsatCore = e.unsatCore === void 0 ? void 0 : Object.freeze([...e.unsatCore]);
+			this.ensureExecutionValid(r, n, "check"), this.status = e.status, this.terminationStatus = a.signal?.aborted ? "Interrupted" : e.status, this.hasPrimalSolution = e.status === "Sat", this.runTime = e.runTime ?? 0, this.unsatCore = e.unsatCore === void 0 ? void 0 : Object.freeze([...e.unsatCore]), this.conflicts = e.conflicts === void 0 ? this.unsatCore : Object.freeze([...e.conflicts]);
 			let t = {};
 			if (e.values && e.status === "Sat") {
 				for (let [n, r] of Object.entries(e.values)) if (typeof r == "number") {
@@ -1875,133 +2492,184 @@ var Re = class {
 				status: e.status,
 				values: t,
 				unsatCore: this.unsatCore,
-				conflicts: this.unsatCore,
+				conflicts: this.conflicts,
 				runTime: this.runTime
 			};
 		}
-		let l = {
-			name: this.name,
+		let u = this.logicalConstraints.length > 0 || this.boolVars.length > 0 ? Ke(this.variables, this.boolVars, this.constraints, this.logicalConstraints) : {
+			variables: [...this.variables],
+			constraints: [...this.constraints],
+			boolVarToBinary: /* @__PURE__ */ new Map(),
+			constraintToOriginalName: new Map(this.constraints.map((e) => [e, e.name]))
+		}, d = [], f = [], p = [], m = /* @__PURE__ */ new Map(), h = 0;
+		for (let e of u.constraints) {
+			let t = u.constraintToOriginalName.get(e) ?? e.name, { lhs: n, sense: r, rhs: i } = e;
+			if (r === "<=") {
+				let r = new b({
+					name: `__slack_${++h}`,
+					type: "Continuous",
+					lb: 0,
+					ub: Infinity
+				});
+				f.push(r), p.push([r, 1]), m.set(r, t);
+				let a = n.clone().add(new j(/* @__PURE__ */ new Map([[r, -1]]), 0));
+				d.push(new c(a, "<=", i, `${e.name}_slack`));
+			} else if (r === ">=") {
+				let r = new b({
+					name: `__slack_${++h}`,
+					type: "Continuous",
+					lb: 0,
+					ub: Infinity
+				});
+				f.push(r), p.push([r, 1]), m.set(r, t);
+				let a = n.clone().add(new j(/* @__PURE__ */ new Map([[r, 1]]), 0));
+				d.push(new c(a, ">=", i, `${e.name}_slack`));
+			} else {
+				let r = new b({
+					name: `__slack_${++h}_p`,
+					type: "Continuous",
+					lb: 0,
+					ub: Infinity
+				}), a = new b({
+					name: `__slack_${++h}_n`,
+					type: "Continuous",
+					lb: 0,
+					ub: Infinity
+				});
+				f.push(r, a), p.push([r, 1], [a, 1]), m.set(r, t), m.set(a, t);
+				let o = n.clone().add(new j(/* @__PURE__ */ new Map([[r, -1], [a, 1]]), 0));
+				d.push(new c(o, "==", i, `${e.name}_slack`));
+			}
+		}
+		let g = {
+			name: `${this.name}_elastic_check`,
 			sense: "Minimize",
-			objective: new j(),
-			constraints: this.constraints,
-			variables: this.variables,
-			logicalConstraints: this.logicalConstraints,
-			boolVars: this.boolVars
-		}, u;
+			objective: new j(new Map(p), 0),
+			constraints: d,
+			variables: [...u.variables, ...f]
+		}, _;
 		try {
-			u = await i.solve(l, o);
+			_ = await i.solve(g, o);
 		} catch (e) {
 			throw this.activeOperationId === n && this.clearSolutionFields(), e;
 		}
-		this.ensureExecutionValid(r, n, "check"), this.runTime = u.runTime ?? 0;
-		let d = u.status, f = u.terminationStatus ?? d, p = this.hasPrimalFromResult(u) || d === "Optimal" || d === "Feasible", m = p ? "Sat" : d === "Infeasible" ? "Unsat" : "Unknown";
-		this.status = m, this.terminationStatus = a.signal?.aborted || f === "Interrupted" ? "Interrupted" : f === "Optimal" || f === "Feasible" || f === "Infeasible" ? m : f, this.hasPrimalSolution = p, this.objectiveValue = null, this.objectiveBound = void 0, this.relGap = void 0, this.mipGap = void 0, this.absGap = void 0, this.solution = null, this.values.clear();
-		let h = {};
-		if (p && u.values) {
-			for (let [e, t] of Object.entries(u.values)) if (typeof t == "number" && Number.isFinite(t)) {
-				let n = this.getVarByName(e), r = this.getBoolVarByName(e);
-				n && (n.value = t, this.values.set(n.name, t), s(h, n.name, t)), r && (r.value = !!t, this.values.set(r.name, r.value), s(h, r.name, r.value)), !n && !r && (this.values.set(e, t), s(h, e, t));
-			} else if (typeof t == "boolean") {
-				let n = t, r = this.getBoolVarByName(e);
-				r ? (r.value = n, this.values.set(r.name, n), s(h, r.name, n)) : (this.values.set(e, n), s(h, e, n));
+		this.ensureExecutionValid(r, n, "check"), this.runTime = _.runTime ?? 0;
+		let v = _.status, y = _.terminationStatus ?? v, x = this.hasPrimalFromResult(_), S = typeof _.objectiveValue == "number" && Number.isFinite(_.objectiveValue) ? _.objectiveValue : Infinity, C = (v === "Optimal" || v === "Feasible" || x) && S <= 1e-5, w = typeof _.objectiveBound == "number" && Number.isFinite(_.objectiveBound) && _.objectiveBound > 1e-5, T = !C && (v === "Infeasible" || v === "Optimal" && S > 1e-5 || w), E = C ? "Sat" : T ? "Unsat" : "Unknown";
+		this.status = E, this.terminationStatus = a.signal?.aborted || y === "Interrupted" ? "Interrupted" : y === "Optimal" || y === "Feasible" || y === "Infeasible" ? E : y, this.hasPrimalSolution = C, this.objectiveValue = null, this.objectiveBound = void 0, this.relGap = void 0, this.mipGap = void 0, this.absGap = void 0, this.solution = null, this.values.clear();
+		let D = {};
+		if (C && _.values) {
+			for (let e of this.variables) {
+				let t = _.values[e.name];
+				typeof t == "number" && Number.isFinite(t) && (e.value = t, this.values.set(e.name, t), s(D, e.name, t));
+			}
+			for (let e of this.boolVars) {
+				let t = u.boolVarToBinary.get(e), n = t ? _.values[t.name] : _.values[e.name];
+				if (typeof n == "number" && Number.isFinite(n)) {
+					let t = Math.round(n) === 1;
+					e.value = t, this.values.set(e.name, t), s(D, e.name, t);
+				}
 			}
 		}
-		if (p && u.boolValues) for (let [e, t] of Object.entries(u.boolValues)) {
-			if (typeof t != "boolean") continue;
-			let n = this.getBoolVarByName(e);
-			n ? (n.value = t, this.values.set(n.name, t), s(h, n.name, t)) : (this.values.set(e, t), s(h, e, t));
-		}
-		if (u.slacks) for (let [e, t] of Object.entries(u.slacks)) {
-			if (typeof t != "number" || !Number.isFinite(t)) continue;
-			let n = this.getConstraintByName(e);
-			n && (n.slack = t);
+		let O = /* @__PURE__ */ new Set();
+		if (T && _.values) for (let [e, t] of m.entries()) {
+			let n = _.values[e.name];
+			typeof n == "number" && n > 1e-5 && O.add(t);
 		}
-		return this.hasSolutionState = !0, {
-			status: m,
-			values: h,
+		return this.conflicts = T ? Object.freeze(Array.from(O)) : void 0, this.unsatCore = void 0, this.hasSolutionState = !0, {
+			status: E,
+			values: D,
+			conflicts: this.conflicts,
+			unsatCore: this.unsatCore,
 			runTime: this.runTime
 		};
 	}
 	validateSolution(e = {}) {
-		return Ne(this, e);
+		return Ue(this, e);
+	}
+	link(e) {
+		if (e instanceof A || typeof e == "object" && e && "quadTerms" in e) throw Error("Linking constraint cannot be a quadratic expression.");
+		if (!(e instanceof c) && (typeof e != "object" || !e || !("sense" in e) || !("lhs" in e) || !("rhs" in e))) throw Error("Linking constraint must contain a comparison operator (<=, >=, ==). Use expr`... <= ...` or .le(), .ge(), .eq().");
+		this._linkingConstraints ||= [];
+		let t = e;
+		return this._linkingConstraints.push(t), t;
+	}
+	get linkingConstraints() {
+		return this._linkingConstraints ?? [];
+	}
+	async solveBenders(e) {
+		let t = await et({
+			master: this,
+			...e
+		});
+		return this.decomposition = t, t;
 	}
-};
-//#endregion
-//#region src/modeler/objective.ts
-function ze(e, t) {
-	let n = e;
-	if (n instanceof c || typeof n == "object" && n && "sense" in n && "lhs" in n && "rhs" in n) throw Error(`Cannot use a Constraint as an objective in ${t}(). Use model.constraint(expr\`... <= ...\`) for constraints, or supply an unconstrained arithmetic expression to ${t}().`);
-	if (typeof n == "string" && /(<=|>=|==|=<|=>|=)/.test(n)) throw Error(`Cannot use a comparison constraint as an objective in ${t}(). Use model.constraint(expr\`... <= ...\`) for constraints, or supply an unconstrained arithmetic expression to ${t}().`);
-	if (typeof n == "number") {
-		if (!Number.isFinite(n)) throw Error(`Invalid non-finite objective constant "${n}" passed to ${t}().`);
-		return n;
+	async solveColumnGeneration(e) {
+		let t = await Je({
+			master: this,
+			...e
+		});
+		return this.decomposition = t, t;
 	}
-	if (typeof n == "string" || n instanceof j || n instanceof A || n instanceof b || typeof n == "object" && n && ("terms" in n && n.terms instanceof Map && typeof n.constant == "number" || "quadTerms" in n && n.quadTerms instanceof Map && "linearTerms" in n && n.linearTerms instanceof Map && typeof n.constant == "number" || "id" in n && "name" in n && "lb" in n && "ub" in n)) return n;
-	throw Error(`Invalid expression passed to ${t}(): expected a finite number, Var, LinExpr, QuadExpr, or arithmetic expression string.`);
-}
-function Be(e) {
-	return {
-		expr: ze(e, "maximize"),
-		sense: "Maximize"
-	};
-}
-function Ve(e) {
-	return {
-		expr: ze(e, "minimize"),
-		sense: "Minimize"
-	};
-}
-z(/* @__PURE__ */ se({
+};
+R(/* @__PURE__ */ he({
 	BoolExpr: () => r,
 	BoolOp: () => n,
 	BoolVar: () => o,
 	Constraint: () => c,
-	HiGHS: () => J,
-	HighsSolver: () => q,
+	HIGHS_CONSTANTS: () => ie,
+	HIGHS_STATUS_NAMES: () => le,
+	HiGHS: () => G,
+	Highs: () => P,
+	HighsError: () => te,
+	HighsModel: () => se,
+	HighsSolver: () => W,
+	HighsUnsupportedOptionError: () => ae,
 	LinExpr: () => j,
-	MockSolver: () => ke,
-	Model: () => Re,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => te,
+	MockSolver: () => ze,
+	Model: () => nt,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => ce,
 	QuadExpr: () => A,
 	Var: () => b,
 	and: () => y,
-	buildIndicatorLinearization: () => X,
+	bindHighsFunctions: () => ne,
+	buildIndicatorLinearization: () => Y,
 	buildLpSymbolMaps: () => u,
-	deriveBigMForGe: () => Le,
-	deriveBigMForLe: () => Ie,
+	deriveBigMForGe: () => J,
+	deriveBigMForLe: () => q,
 	dot: () => s,
-	expr: () => be,
+	expr: () => ke,
 	generateLpString: () => C,
-	getHighs: () => F,
-	getHighsWasmUrl: () => L,
+	getHighs: () => oe,
+	getHighsWasmUrl: () => I,
 	getSolver: () => D,
 	implies: () => e,
 	isLpExportResult: () => E,
-	isValidWasmHeader: () => P,
+	isValidWasmHeader: () => re,
+	linearizeModelForMip: () => Ke,
 	listAvailableSolvers: () => S,
-	mapHighsStatus: () => K,
-	mapHighsTerminationStatus: () => G,
-	maximize: () => Be,
-	minimize: () => Ve,
+	mapHighsStatus: () => U,
+	mapHighsTerminationStatus: () => H,
+	maximize: () => Xe,
+	minimize: () => Ze,
 	not: () => v,
 	or: () => i,
-	parseConstraint: () => he,
-	parseExpr: () => pe,
+	parseConstraint: () => we,
+	parseExpr: () => Se,
 	probeWasmUrl: () => M,
-	registerHighsSolver: () => Y,
-	registerMockSolver: () => Ae,
+	registerHighsSolver: () => K,
+	registerMockSolver: () => Be,
 	registerSolver: () => T,
-	resolveBrowserWasmUrl: () => I,
+	resolveBrowserWasmUrl: () => F,
 	sanitizeIdentifier: () => f,
 	setDefaultSolver: () => _,
-	setHighsWasmUrl: () => R,
-	solveLp: () => W,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
 	solveLpWithHighs: () => N,
 	sum: () => t,
 	validateModelIntegrity: () => k,
-	validateModelSolution: () => Ne,
-	validateUserBigM: () => Pe,
+	validateModelSolution: () => Ue,
+	validateUserBigM: () => We,
 	xor: () => a
-}), je);
+}), Ve);
 //#endregion
-export { r as BoolExpr, n as BoolOp, o as BoolVar, c as Constraint, J as HiGHS, q as HighsSolver, j as LinExpr, ke as MockSolver, Re as Model, A as QuadExpr, b as Var, y as and, X as buildIndicatorLinearization, u as buildLpSymbolMaps, Le as deriveBigMForGe, Ie as deriveBigMForLe, s as dot, be as expr, C as generateLpString, F as getHighs, L as getHighsWasmUrl, D as getSolver, e as implies, E as isLpExportResult, S as listAvailableSolvers, Be as maximize, Ve as minimize, le as normalizeSense, v as not, i as or, he as parseConstraint, pe as parseExpr, T as registerSolver, f as sanitizeIdentifier, _ as setDefaultSolver, R as setHighsWasmUrl, N as solveLpWithHighs, t as sum, k as validateModelIntegrity, Ne as validateModelSolution, Pe as validateUserBigM, a as xor };
+export { r as BoolExpr, n as BoolOp, o as BoolVar, c as Constraint, G as HiGHS, P as Highs, W as HighsSolver, j as LinExpr, ze as MockSolver, nt as Model, A as QuadExpr, b as Var, y as and, Y as buildIndicatorLinearization, u as buildLpSymbolMaps, J as deriveBigMForGe, q as deriveBigMForLe, s as dot, ke as expr, C as generateLpString, oe as getHighs, I as getHighsWasmUrl, D as getSolver, e as implies, E as isLpExportResult, Ke as linearizeModelForMip, S as listAvailableSolvers, Xe as maximize, Ze as minimize, _e as normalizeSense, v as not, i as or, we as parseConstraint, Se as parseExpr, T as registerSolver, f as sanitizeIdentifier, _ as setDefaultSolver, L as setHighsWasmUrl, et as solveBenders, Je as solveColumnGeneration, N as solveLpWithHighs, t as sum, k as validateModelIntegrity, Ue as validateModelSolution, We as validateUserBigM, a as xor };