@ohtaman/washi 0.4.0 → 0.6.0

package/dist/lib/washi.js

@@ -1,531 +1,119 @@
-import { a as e, c as t, i as n, l as r, n as i, o as a, r as o, s, t as c } from "./constraint-BRuB3ooC.js";
-import { i as l, n as u, r as d, t as f } from "./registry-DksqCSjI.js";
-import { a as p, c as m, i as h, n as g, o as _, r as v, s as y, t as b } from "./loader-Dti0v9yC.js";
-import { createHighsWorker as ee } 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 x = Object.defineProperty, te = Object.getOwnPropertyDescriptor, ne = Object.getOwnPropertyNames, re = Object.prototype.hasOwnProperty, S = (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) x(n, r, {
+	for (var r in e) de(n, r, {
 		get: e[r],
 		enumerable: !0
 	});
-	return t || x(n, Symbol.toStringTag, { value: "Module" }), n;
-}, C = (e, t, n, r) => {
-	if (t && typeof t == "object" || typeof t == "function") for (var i = ne(t), a = 0, o = i.length, s; a < o; a++) s = i[a], !re.call(e, s) && s !== n && x(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 = te(t, s)) || r.enumerable
+		enumerable: !(r = fe(t, s)) || r.enumerable
 	});
 	return e;
-}, w = (e, t, n) => (C(e, t, "default"), n && C(n, t, "default"));
+}, R = (e, t, n) => (ge(e, t, "default"), n && ge(n, t, "default"));
 //#endregion
 //#region src/modeler/types.ts
-function T(e) {
-	return e && e.toLowerCase() === "maximize" ? "Maximize" : "Minimize";
+function _e(e) {
+	if (e === void 0) return "Minimize";
+	if (typeof e == "string") {
+		let t = e.toLowerCase();
+		if (t === "maximize") return "Maximize";
+		if (t === "minimize") return "Minimize";
+	}
+	throw Error(`Invalid optimization sense "${String(e)}": expected "Maximize", "Minimize", "maximize", or "minimize".`);
 }
 //#endregion
-//#region src/modeler/quad-expr.ts
-function E(e, t) {
-	let n = e.id, r = t.id;
-	return n <= r ? `${n}:${r}` : `${r}:${n}`;
-}
-var D = class e {
-	linearTerms;
-	quadTerms;
-	constant;
-	constructor(e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map(), n = 0) {
-		this.linearTerms = new Map(e), this.quadTerms = /* @__PURE__ */ new Map();
-		for (let [e, n] of t) this.quadTerms.set(e, { ...n });
-		this.constant = n;
-	}
-	clone() {
-		return new e(this.linearTerms, this.quadTerms, this.constant);
-	}
-	getQuadCoeff(e, t) {
-		let n = E(e, t), r = this.quadTerms.get(n);
-		return r ? r.coeff : 0;
-	}
-	add(t) {
-		let n = this.clone();
-		if (typeof t == "number") return n.constant += t, n;
-		if (t instanceof e) {
-			for (let [e, r] of t.quadTerms) {
-				let t = n.quadTerms.get(e), i = (t ? t.coeff : 0) + r.coeff;
-				Math.abs(i) < 1e-12 ? n.quadTerms.delete(e) : n.quadTerms.set(e, {
-					var1: r.var1,
-					var2: r.var2,
-					coeff: i
-				});
-			}
-			for (let [e, r] of t.linearTerms) {
-				let t = (n.linearTerms.get(e) || 0) + r;
-				Math.abs(t) < 1e-12 ? n.linearTerms.delete(e) : n.linearTerms.set(e, t);
-			}
-			return n.constant += t.constant, n;
-		}
-		if ("terms" in t && t.terms instanceof Map) {
-			for (let [e, r] of t.terms) {
-				let t = (n.linearTerms.get(e) || 0) + r;
-				Math.abs(t) < 1e-12 ? n.linearTerms.delete(e) : n.linearTerms.set(e, t);
-			}
-			return n.constant += t.constant, n;
-		}
-		let r = t, i = (n.linearTerms.get(r) || 0) + 1;
-		return Math.abs(i) < 1e-12 ? n.linearTerms.delete(r) : n.linearTerms.set(r, i), n;
-	}
-	sub(t) {
-		return typeof t == "number" ? this.add(-t) : t instanceof e ? this.add(t.neg()) : ("terms" in t && t.terms instanceof Map, this.add(t.mul(-1)));
-	}
-	mul(t) {
-		if (typeof t == "number") {
-			let n = new e(/* @__PURE__ */ new Map(), /* @__PURE__ */ new Map(), this.constant * t);
-			for (let [e, r] of this.linearTerms) {
-				let i = r * t;
-				Math.abs(i) >= 1e-12 && n.linearTerms.set(e, i);
-			}
-			for (let [e, r] of this.quadTerms) {
-				let i = r.coeff * t;
-				Math.abs(i) >= 1e-12 && n.quadTerms.set(e, {
-					var1: r.var1,
-					var2: r.var2,
-					coeff: i
-				});
-			}
-			return n;
-		}
-		if ("id" in t && "name" in t && !("terms" in t) && !("quadTerms" in t)) {
-			if (this.quadTerms.size > 0) throw Error("Multiplication creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)");
-			let n = new e();
-			Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(t, this.constant);
-			for (let [r, i] of this.linearTerms) n = n.add(e.fromProduct(r, t, i));
-			return n;
-		}
-		let n = t, r = "quadTerms" in n ? n.quadTerms.size : 0, i = "quadTerms" in n ? n.linearTerms : n.terms;
-		if (this.quadTerms.size > 0 && (r > 0 || i.size > 0) || r > 0 && this.linearTerms.size > 0) throw Error("Multiplication creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)");
-		if (r === 0 && i.size === 0) return this.mul(n.constant);
-		if (this.quadTerms.size === 0 && this.linearTerms.size === 0) {
-			let t = n.mul(this.constant);
-			if (t instanceof e) return t;
-			let r = new e();
-			r.constant = t.constant;
-			for (let [e, n] of t.terms) r.linearTerms.set(e, n);
-			return r;
-		}
-		let a = new e();
-		if (a.constant = this.constant * n.constant, Math.abs(n.constant) >= 1e-12) for (let [e, t] of this.linearTerms) a.linearTerms.set(e, (a.linearTerms.get(e) || 0) + t * n.constant);
-		if (Math.abs(this.constant) >= 1e-12) for (let [e, t] of i) a.linearTerms.set(e, (a.linearTerms.get(e) || 0) + t * this.constant);
-		for (let [t, n] of this.linearTerms) for (let [r, o] of i) a = a.add(e.fromProduct(t, r, n * o));
-		return a;
-	}
-	div(e) {
-		if (Math.abs(e) < 1e-12) throw Error("Division by zero in QuadExpr.div()");
-		return this.mul(1 / e);
-	}
-	neg() {
-		return this.mul(-1);
-	}
-	get value() {
-		let e = this.constant;
-		for (let [t, n] of this.linearTerms) {
-			if (t.value === null) return null;
-			e += n * t.value;
-		}
-		for (let t of this.quadTerms.values()) {
-			if (t.var1.value === null || t.var2.value === null) return null;
-			e += t.coeff * t.var1.value * t.var2.value;
-		}
-		return e;
-	}
-	getValue() {
-		return this.value;
-	}
-	toString() {
-		let e = [], t = !0;
-		for (let n of this.quadTerms.values()) {
-			let r = n.coeff, i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), o = a === 1 ? "" : `${a} `;
-			n.var1 === n.var2 ? e.push(`${i}${o}${n.var1.name}^2`) : e.push(`${i}${o}${n.var1.name} * ${n.var2.name}`), t = !1;
-		}
-		for (let [n, r] of this.linearTerms) {
-			let i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), o = a === 1 ? "" : `${a} `;
-			e.push(`${i}${o}${n.name}`), t = !1;
-		}
-		if (this.constant !== 0 || e.length === 0) {
-			let n = this.constant >= 0 ? t ? "" : "+ " : "- ";
-			e.push(`${n}${Math.abs(this.constant)}`);
-		}
-		return e.join(" ") || "0";
-	}
-	static fromProduct(t, n, r = 1) {
-		let i = new e(), a = E(t, n);
-		return i.quadTerms.set(a, {
-			var1: t.id <= n.id ? t : n,
-			var2: t.id <= n.id ? n : t,
-			coeff: r
-		}), i;
-	}
-}, O = class e {
-	terms;
-	constant;
-	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
-		this.terms = new Map(e), this.constant = t;
-	}
-	clone() {
-		return new e(this.terms, this.constant);
-	}
-	add(e) {
-		if (e instanceof D) return e.add(this);
-		let t = this.clone();
-		if (typeof e == "number") t.constant += e;
-		else if ("terms" in e) {
-			for (let [n, r] of e.terms) {
-				let e = (t.terms.get(n) || 0) + r;
-				Math.abs(e) < 1e-12 ? t.terms.delete(n) : t.terms.set(n, e);
-			}
-			t.constant += e.constant;
-		} else {
-			let n = (t.terms.get(e) || 0) + 1;
-			Math.abs(n) < 1e-12 ? t.terms.delete(e) : t.terms.set(e, n);
-		}
-		return t;
-	}
-	sub(e) {
-		return e instanceof D ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
-	}
-	mul(t) {
-		if (typeof t == "number") {
-			let n = new e(/* @__PURE__ */ new Map(), this.constant * t);
-			for (let [e, r] of this.terms) {
-				let i = r * t;
-				Math.abs(i) >= 1e-12 && n.terms.set(e, i);
-			}
-			return n;
-		}
-		if (t instanceof M || typeof t == "object" && t && "id" in t && !("terms" in t) && !("quadTerms" in t)) {
-			let e = t, n = new D();
-			Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(e, this.constant);
-			for (let [t, r] of this.terms) n = n.add(D.fromProduct(t, e, r));
-			return n;
-		}
-		if (t instanceof D) {
-			if (t.quadTerms.size > 0 && this.terms.size > 0) throw Error("Multiplication creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)");
-			if (this.terms.size === 0) return t.mul(this.constant);
-			let e = new D();
-			if (e.constant = this.constant * t.constant, Math.abs(t.constant) >= 1e-12) for (let [n, r] of this.terms) e.linearTerms.set(n, (e.linearTerms.get(n) || 0) + r * t.constant);
-			if (Math.abs(this.constant) >= 1e-12) for (let [n, r] of t.linearTerms) e.linearTerms.set(n, (e.linearTerms.get(n) || 0) + r * this.constant);
-			for (let [n, r] of this.terms) for (let [i, a] of t.linearTerms) e = e.add(D.fromProduct(n, i, r * a));
-			return e;
-		}
-		if (this.terms.size === 0) return t.mul(this.constant);
-		if (t.terms.size === 0) return this.mul(t.constant);
-		let n = new D();
-		if (n.constant = this.constant * t.constant, Math.abs(t.constant) >= 1e-12) for (let [e, r] of this.terms) n.linearTerms.set(e, (n.linearTerms.get(e) || 0) + r * t.constant);
-		if (Math.abs(this.constant) >= 1e-12) for (let [e, r] of t.terms) n.linearTerms.set(e, (n.linearTerms.get(e) || 0) + r * this.constant);
-		for (let [e, r] of this.terms) for (let [i, a] of t.terms) n = n.add(D.fromProduct(e, i, r * a));
-		return n;
-	}
-	div(e) {
-		if (Math.abs(e) < 1e-12) throw Error("Division by zero in LinExpr.div()");
-		return this.mul(1 / e);
-	}
-	neg() {
-		return this.mul(-1);
-	}
-	get value() {
-		let e = this.constant;
-		for (let [t, n] of this.terms) {
-			if (t.value === null) return null;
-			e += n * t.value;
-		}
-		return e;
-	}
-	getValue() {
-		return this.value;
-	}
-	le(e, t) {
-		return this.toConstraint("<=", e, t);
-	}
-	lessThanOrEqual(e, t) {
-		return this.le(e, t);
-	}
-	ge(e, t) {
-		return this.toConstraint(">=", e, t);
-	}
-	greaterThanOrEqual(e, t) {
-		return this.ge(e, t);
-	}
-	eq(e, t) {
-		return this.toConstraint("==", e, t);
-	}
-	equalTo(e, t) {
-		return this.eq(e, t);
-	}
-	toConstraint(t, n, r) {
-		let i = this.clone(), a = 0;
-		typeof n == "number" ? a = n : "terms" in n ? (i = i.sub(new e(n.terms, 0)), a = n.constant) : i = i.sub(n);
-		let o = a - i.constant;
-		return i.constant = 0, new c(i, t, o, r);
-	}
-	toString() {
-		let e = [], t = !0;
-		for (let [n, r] of this.terms) {
-			let i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), o = a === 1 ? "" : `${a} `;
-			e.push(`${i}${o}${n.name}`), t = !1;
-		}
-		if (this.constant !== 0 || e.length === 0) {
-			let n = this.constant >= 0 ? t ? "" : "+ " : "- ";
-			e.push(`${n}${Math.abs(this.constant)}`);
-		}
-		return e.join(" ") || "0";
-	}
-};
-function k(e, t) {
-	let n = /* @__PURE__ */ new Map(), r = 0;
-	function i(e) {
-		if (e != null) {
-			if (typeof e == "number") r += e;
-			else if (typeof e == "object" && "terms" in e) {
-				let t = e;
-				for (let [e, r] of t.terms) {
-					let t = n.get(e) || 0;
-					n.set(e, t + r);
-				}
-				r += t.constant;
-			} else {
-				let t = e, r = n.get(t) || 0;
-				n.set(t, r + 1);
-			}
-		}
-	}
-	if (typeof e == "number") {
-		let n = e, r = t;
-		for (let e = 0; e < n; e++) i(r(e, e));
-	} else {
-		let n = 0;
-		for (let r of e) i(t ? t(r, n++) : r);
-	}
-	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
-	return new O(n, r);
-}
-function A(e, t) {
-	let n = /* @__PURE__ */ new Map(), r = 0;
-	function i(e) {
-		return typeof e == "object" && !!e && typeof e.id == "number" && typeof e.name == "string" && typeof e.mul == "function" && typeof e.le == "function";
-	}
-	function a(e) {
-		return i(e) || e instanceof O || e instanceof D;
-	}
-	function o(e, t) {
-		if (typeof t == "number") r += e * t;
-		else if (t instanceof O) {
-			for (let [r, i] of t.terms) {
-				let t = n.get(r) || 0;
-				n.set(r, t + e * i);
-			}
-			r += e * t.constant;
-		} else if (i(t)) {
-			let r = t, i = n.get(r) || 0;
-			n.set(r, i + e);
-		} else throw Error("Cannot multiply number by non-variable/expression operand in dot().");
-	}
-	function s(e) {
-		return typeof e == "object" && !!e && !Array.isArray(e) && !a(e);
-	}
-	function c(e, t, n = "") {
-		if (e === void 0 || t === void 0 || e === null || t === null) throw Error(`Nullish or undefined operand encountered in dot() at '${n || "root"}'.`);
-		if (typeof e == "number") {
-			o(e, t);
-			return;
-		}
-		if (typeof t == "number") {
-			o(t, e);
-			return;
-		}
-		if (Array.isArray(e) || Array.isArray(t)) {
-			if (Array.isArray(e) && Array.isArray(t)) {
-				if (e.length !== t.length) throw Error(`Array length mismatch in dot() at '${n || "root"}': received lengths ${e.length} and ${t.length}.`);
-				for (let r = 0; r < e.length; r++) c(e[r], t[r], n ? `${n}[${r}]` : `[${r}]`);
-				return;
-			}
-			let r = Array.isArray(e) ? e : t, i = Array.isArray(e) ? t : e;
-			if (s(i)) {
-				let a = Object.keys(i);
-				if (a.length > 0 && a.every((e) => /^\d+$/.test(e))) {
-					if (a.length !== r.length) throw Error(`Array length mismatch in dot() at '${n || "root"}': array has length ${r.length}, but object has ${a.length} indices.`);
-					let o = [];
-					for (let e = 0; e < r.length; e++) !(e in i) && !(String(e) in i) && o.push(e);
-					if (o.length > 0) throw Error(`Key mismatch in dot() at '${n || "root"}': missing indices [${o.join(", ")}] in numeric record.`);
-					for (let i = 0; i < r.length; i++) c(e[i], t[i], n ? `${n}[${i}]` : `[${i}]`);
-					return;
-				}
-				throw Error(`Type mismatch in dot() at '${n || "root"}': one operand is an Array while the other is an Object with keys [${a.slice(0, 5).join(", ")}].`);
-			}
-			throw Error(`Type mismatch in dot() at '${n || "root"}': one operand is an Array while the other is not.`);
-		}
-		if (s(e) && s(t)) {
-			let r = Object.keys(e), i = Object.keys(t), a = r.filter((e) => !(e in t)), o = i.filter((t) => !(t in e));
-			if (a.length > 0 || o.length > 0) {
-				let e = [];
-				throw a.length > 0 && e.push(`missing in second operand: [${a.join(", ")}]`), o.length > 0 && e.push(`missing in first operand: [${o.join(", ")}]`), Error(`Key mismatch in dot() at '${n || "root"}': ${e.join("; ")}.`);
-			}
-			for (let i of r) c(e[i], t[i], n ? `${n}.${i}` : i);
-			return;
-		}
-		throw Error(`Unsupported operand types in dot() at '${n || "root"}'.`);
-	}
-	c(e, t);
-	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
-	return new O(n, r);
-}
-//#endregion
-//#region src/modeler/variable.ts
-var j = 0;
-function ie(e) {
-	if (!e) return "Continuous";
-	let t = e.toLowerCase();
-	return t === "binary" || t === "bin" ? "Binary" : t === "integer" || t === "int" ? "Integer" : "Continuous";
-}
-var M = class e {
-	id;
-	name;
-	type;
-	lb;
-	ub;
-	value = null;
-	reducedCost = null;
-	constructor(e = {}) {
-		this.id = ++j, this.name = e.name || `x_${this.id}`, this.type = ie(e.type), this.type === "Binary" ? (this.lb = 0, this.ub = 1) : (this.lb = e.lb === void 0 ? 0 : e.lb, this.ub = e.ub === void 0 ? Infinity : e.ub);
-	}
-	mul(t) {
-		if (typeof t == "number") return new O(/* @__PURE__ */ new Map([[this, t]]), 0);
-		if (t instanceof e) return D.fromProduct(this, t, 1);
-		if (t instanceof D) {
-			if (t.quadTerms.size > 0) throw Error("Multiplication creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)");
-			let e = new D();
-			Math.abs(t.constant) >= 1e-12 && e.linearTerms.set(this, t.constant);
-			for (let [n, r] of t.linearTerms) e = e.add(D.fromProduct(this, n, r));
-			return e;
-		}
-		let n = new D();
-		Math.abs(t.constant) >= 1e-12 && n.linearTerms.set(this, t.constant);
-		for (let [e, r] of t.terms) {
-			let t = D.fromProduct(this, e, r);
-			n = n.add(t);
-		}
-		return n;
-	}
-	add(e) {
-		return e instanceof D ? e.add(this) : new O(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
-	}
-	sub(e) {
-		return e instanceof D ? e.neg().add(this) : new O(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
-	}
-	neg() {
-		return this.mul(-1);
-	}
-	le(e, t) {
-		return new O(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
-	}
-	lessThanOrEqual(e, t) {
-		return this.le(e, t);
-	}
-	ge(e, t) {
-		return new O(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
-	}
-	greaterThanOrEqual(e, t) {
-		return this.ge(e, t);
-	}
-	eq(e, t) {
-		return new O(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
-	}
-	equalTo(e, t) {
-		return this.eq(e, t);
-	}
-	toString() {
-		return this.name;
-	}
-};
-//#endregion
 //#region src/modeler/parser.ts
-function ae(e) {
-	let t = [], n = 0, r = e.length;
-	for (; n < r;) {
-		let i = e[n];
-		if (/\s/.test(i)) {
-			n++;
+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];
+		if (/\s/.test(a)) {
+			r++;
 			continue;
 		}
-		if (i === "+") t.push({
+		if (a === "+") n.push({
 			type: "PLUS",
 			value: "+"
-		}), n++;
-		else if (i === "-") t.push({
+		}), r++;
+		else if (a === "-") n.push({
 			type: "MINUS",
 			value: "-"
-		}), n++;
-		else if (i === "*") n + 1 < r && e[n + 1] === "*" ? (t.push({
+		}), r++;
+		else if (a === "*") r + 1 < i && e[r + 1] === "*" ? (n.push({
 			type: "CARET",
 			value: "**"
-		}), n += 2) : (t.push({
+		}), r += 2) : (n.push({
 			type: "STAR",
 			value: "*"
-		}), n++);
-		else if (i === "^") t.push({
+		}), r++);
+		else if (a === "^") n.push({
 			type: "CARET",
 			value: "^"
-		}), n++;
-		else if (i === "/") t.push({
+		}), r++;
+		else if (a === "/") n.push({
 			type: "SLASH",
 			value: "/"
-		}), n++;
-		else if (i === "(") t.push({
+		}), r++;
+		else if (a === "(") n.push({
 			type: "LPAREN",
 			value: "("
-		}), n++;
-		else if (i === ")") t.push({
+		}), r++;
+		else if (a === ")") n.push({
 			type: "RPAREN",
 			value: ")"
-		}), n++;
-		else if (i === "<" || i === ">" || i === "=") {
-			let a = i;
-			n + 1 < r && (e[n + 1] === "=" || e[n + 1] === "<" || e[n + 1] === ">") ? (a += e[n + 1], n += 2) : n++, t.push({
+		}), r++;
+		else if (a === "<" || a === ">" || a === "=") {
+			let t = a;
+			r + 1 < i && (e[r + 1] === "=" || e[r + 1] === "<" || e[r + 1] === ">") ? (t += e[r + 1], r += 2) : r++, n.push({
 				type: "COMP",
-				value: a
+				value: t
 			});
-		} else if (/[0-9.]/.test(i)) {
-			let i = "";
-			for (; n < r && /[0-9.]/.test(e[n]);) i += e[n], n++;
-			t.push({
+		} else if (/[0-9.]/.test(a)) {
+			let t = r, a = "";
+			for (; r < i && /[0-9]/.test(e[r]);) a += e[r++];
+			if (r < i && e[r] === ".") for (a += e[r++]; r < i && /[0-9]/.test(e[r]);) a += e[r++];
+			if (r < i && (e[r] === "e" || e[r] === "E")) {
+				let t = r + 1 < i ? e[r + 1] : "";
+				if (!/[a-zA-Z_]/.test(t)) {
+					for (a += e[r++], r < i && (e[r] === "+" || e[r] === "-") && (a += e[r++]); r < i && /[0-9]/.test(e[r]);) a += e[r++];
+					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 (!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}"`);
+			n.push({
 				type: "NUMBER",
-				value: i
+				value: a,
+				numericValue: o
 			});
-		} else if (/[a-zA-Z_]/.test(i)) {
-			let i = "";
-			for (; n < r && /[a-zA-Z0-9_]/.test(e[n]);) i += e[n], n++;
-			t.push({
+		} else if (/[a-zA-Z_]/.test(a)) {
+			let a = "";
+			for (; r < i && /[a-zA-Z0-9_]/.test(e[r]);) a += e[r], r++;
+			if (t && t.has(a)) {
+				let e = t.get(a);
+				n.push({
+					type: "NUMBER",
+					value: String(e),
+					numericValue: e
+				});
+			} else n.push({
 				type: "IDENT",
-				value: i
+				value: a
 			});
-		} else throw Error(`Unexpected character '${i}' at position ${n} in: "${e}"`);
+		} else throw Error(`Unexpected character '${a}' at position ${r} in: "${e}"`);
 	}
-	return t;
-}
-function oe(e, t) {
-	return e instanceof D ? e.add(t) : t instanceof D ? t.add(e) : e.add(t);
-}
-function se(e, t) {
-	return e instanceof D ? e.sub(t) : t instanceof D ? t.neg().add(e) : e.sub(t);
+	return n;
 }
-function N(e, t) {
-	let n = e instanceof D ? e.quadTerms : /* @__PURE__ */ new Map(), r = t instanceof D ? t.quadTerms : /* @__PURE__ */ new Map(), i = e instanceof D ? e.linearTerms : e.terms, a = t instanceof D ? t.linearTerms : t.terms;
-	if (n.size > 0 && (r.size > 0 || a.size > 0) || r.size > 0 && (n.size > 0 || i.size > 0)) throw Error("Multiplication creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)");
-	if (n.size === 0 && i.size === 0) return t.mul(e.constant);
-	if (r.size === 0 && a.size === 0) return e.mul(t.constant);
-	let o = new D();
-	if (o.constant = e.constant * t.constant, Math.abs(t.constant) >= 1e-12) for (let [e, n] of i) o.linearTerms.set(e, (o.linearTerms.get(e) || 0) + n * t.constant);
-	if (Math.abs(e.constant) >= 1e-12) for (let [t, n] of a) o.linearTerms.set(t, (o.linearTerms.get(t) || 0) + n * e.constant);
-	for (let [e, t] of i) for (let [n, r] of a) o = o.add(D.fromProduct(e, n, t * r));
-	return o;
-}
-var ce = class {
+var be = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -546,28 +134,20 @@ var ce = class {
 		for (; this.pos < this.tokens.length;) {
 			let t = this.peek();
 			if (!t) break;
-			if (t.type === "PLUS") this.consume(), e = oe(e, this.parseTerm());
-			else if (t.type === "MINUS") this.consume(), e = se(e, this.parseTerm());
+			if (t.type === "PLUS") this.consume(), e = e.add(this.parseTerm());
+			else if (t.type === "MINUS") this.consume(), e = e.sub(this.parseTerm());
 			else break;
 		}
-		return e instanceof D && e.quadTerms.size === 0 ? new O(e.linearTerms, e.constant) : e;
+		return e instanceof A && e.quadTerms.size === 0 ? new j(e.linearTerms, e.constant) : e;
 	}
 	parseTerm() {
 		let e = this.parseFactor();
 		for (; this.pos < this.tokens.length;) {
 			let t = this.peek();
 			if (!t) break;
-			if (t.type === "STAR") {
-				this.consume();
-				let t = this.parseFactor();
-				e = N(e, t);
-			} else if (t.type === "SLASH") {
-				this.consume();
-				let t = this.parseFactor(), n = t instanceof D ? t.linearTerms : t.terms, r = t instanceof D ? t.quadTerms.size : 0;
-				if (n.size > 0 || r > 0) throw Error("Cannot divide by variable in expression");
-				if (Math.abs(t.constant) < 1e-12) throw Error("Division by zero in expression");
-				e = e.div(t.constant);
-			} else break;
+			if (t.type === "STAR") this.consume(), e = e.mul(this.parseFactor());
+			else if (t.type === "SLASH") this.consume(), e = e.div(this.parseFactor());
+			else break;
 		}
 		return e;
 	}
@@ -579,20 +159,20 @@ var ce = class {
 		let t;
 		if (e.type === "NUMBER") {
 			this.consume();
-			let n = parseFloat(e.value);
+			let n = e.numericValue ?? Number(e.value);
 			if (this.peek()?.type === "IDENT" || this.peek()?.type === "LPAREN") {
 				let e;
 				if (this.peek()?.type === "IDENT") {
 					let t = this.consume(), n = this.resolve(t.value);
-					e = n instanceof M || "id" in n && !("terms" in n) && !("quadTerms" in n) ? new O(/* @__PURE__ */ new Map([[n, 1]]), 0) : n.clone();
+					e = n instanceof b || "id" in n && !("terms" in n) && !("quadTerms" in n) ? new j(/* @__PURE__ */ new Map([[n, 1]]), 0) : n.clone();
 				} else this.consume("LPAREN"), e = this.parseExpression(), this.consume("RPAREN");
 				return this.applyPower(e).mul(n);
 			}
-			t = new O(/* @__PURE__ */ new Map(), n);
+			t = new j(/* @__PURE__ */ new Map(), n);
 		} else if (e.type === "IDENT") {
 			this.consume();
 			let n = this.resolve(e.value);
-			t = n instanceof M || "id" in n && !("terms" in n) && !("quadTerms" in n) ? new O(/* @__PURE__ */ new Map([[n, 1]]), 0) : n.clone();
+			t = n instanceof b || "id" in n && !("terms" in n) && !("quadTerms" in n) ? new j(/* @__PURE__ */ new Map([[n, 1]]), 0) : n.clone();
 		} else if (e.type === "LPAREN") this.consume("LPAREN"), t = this.parseExpression(), this.consume("RPAREN");
 		else throw Error(`Unexpected token '${e.value}' in expression`);
 		return this.applyPower(t);
@@ -602,24 +182,27 @@ var ce = class {
 		let t = [];
 		for (; this.peek()?.type === "CARET";) {
 			this.consume();
-			let e = this.peek();
-			if (!e || e.type !== "NUMBER") throw Error("Exponent must be a non-negative integer number");
-			this.consume();
-			let n = parseFloat(e.value);
-			if (!Number.isInteger(n) || n < 0) throw Error("Exponent must be a non-negative integer");
-			t.push(n);
+			let e = this.tokens[this.pos]?.type === "LPAREN" && this.tokens[this.pos + 1]?.type === "NUMBER" && this.tokens[this.pos + 2]?.type === "RPAREN";
+			e && this.consume("LPAREN");
+			let n = this.peek();
+			if (!n || n.type !== "NUMBER") throw Error("Exponent must be a non-negative integer number");
+			this.consume(), e && this.consume("RPAREN");
+			let r = n.numericValue ?? Number(n.value);
+			if (!Number.isInteger(r) || r < 0) throw Error("Exponent must be a non-negative integer");
+			t.push(r);
 		}
 		let n = t[t.length - 1];
 		for (let e = t.length - 2; e >= 0; e--) n = t[e] ** +n;
 		if (!Number.isFinite(n) || n < 0) throw Error("Exponent creates an invalid or out-of-range power");
-		let r = e instanceof D, i = r ? e.quadTerms.size : 0, a = r ? e.linearTerms.size : e.terms.size;
+		let r = e instanceof A, i = r ? e.quadTerms.size : 0, a = r ? e.linearTerms.size : e.terms.size;
 		if (i === 0 && a === 0) {
 			let t = e.constant ** +n;
-			return new O(/* @__PURE__ */ new Map(), t);
+			if (e.constant !== 0 && n > 0 && t === 0) throw Error("Constant exponentiation underflows to zero.");
+			return new j(/* @__PURE__ */ new Map(), t);
 		}
-		if (n === 0) return new O(/* @__PURE__ */ new Map(), 1);
+		if (n === 0) return new j(/* @__PURE__ */ new Map(), 1);
 		if (n === 1) return e;
-		if (n === 2) return N(e, e);
+		if (n === 2) return e.mul(e);
 		throw Error(`Exponent ${n} creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)`);
 	}
 	getRemainingToken() {
@@ -631,193 +214,270 @@ var ce = class {
 		return t;
 	}
 };
-function P(e, t) {
-	let n = new ce(ae(e), t), r = n.parseExpression(), i = n.getRemainingToken();
-	if (i) throw Error(`Unexpected token '${i.value}' after expression in "${e}"`);
-	return r;
+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 Ee(i), i;
+}
+function Se(e, t) {
+	return xe(e, t);
+}
+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;
+	if (a === "<=" || a === "=<") l = "<=";
+	else if (a === ">=" || a === "=>") l = ">=";
+	else if (a === "==" || a === "=") l = "==";
+	else throw Error(`Unsupported operator "${a}"`);
+	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), Ee(m.lhs), !Number.isFinite(m.rhs)) throw Error(`Invalid non-finite right-hand side "${m.rhs}" in constraint.`);
+	return m;
+}
+function we(e, t, n) {
+	return Ce(e, t, n);
+}
+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 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.`);
+	}
+	if ("linearTerms" in e && e.linearTerms instanceof Map) {
+		for (let [, t] of e.linearTerms) if (!Number.isFinite(t)) throw Error(`Invalid non-finite coefficient "${t}" in expression.`);
+	}
+	if ("quadTerms" in e && e.quadTerms instanceof Map) {
+		for (let [, t] of e.quadTerms) if (!Number.isFinite(t.coeff)) throw Error(`Invalid non-finite quadratic coefficient "${t.coeff}" in expression.`);
+	}
 }
-function F(e, t, n) {
-	let r = e.match(/(<=|>=|==|=<|=>|=)/);
-	if (!r) throw Error(`Constraint must contain a comparison operator (<=, >=, ==, =): "${e}"`);
-	let i = r[0], a = r.index, o = e.substring(0, a).trim(), s = e.substring(a + i.length).trim(), c;
-	if (i === "<=" || i === "=<") c = "<=";
-	else if (i === ">=" || i === "=>") c = ">=";
-	else if (i === "==" || i === "=") c = "==";
-	else throw Error(`Unsupported operator "${i}"`);
-	let l = P(o, t), u = P(s, t);
-	if (l instanceof D && l.quadTerms.size > 0 || u instanceof D && u.quadTerms.size > 0) throw Error("Quadratic constraints are not supported (only linear constraints are allowed in MILP/LP/QP)");
-	let d = l instanceof D ? new O(l.linearTerms, l.constant) : l, f = u instanceof D ? new O(u.linearTerms, u.constant) : u;
-	return c === "<=" ? d.le(f, n) : c === ">=" ? d.ge(f, n) : d.eq(f, n);
+function De(e) {
+	return e instanceof c || typeof e == "object" && !!e && "sense" in e && "lhs" in e && "rhs" in e;
 }
-function I(e, t) {
-	let n = /* @__PURE__ */ new Map(), r = "";
-	for (let i = 0; i < e.length; i++) if (r += e[i], i < t.length) {
+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 = "";
+	for (let i = 0; i < e.length; i++) if (o += e[i], i < t.length) {
 		let e = t[i];
-		if (typeof e == "number") r += `(${e})`;
-		else if (e instanceof M || e instanceof O || e instanceof D || typeof e == "object" && e && ("id" in e || "terms" in e || "quadTerms" in e)) {
-			let t = `__ph_${i}__`;
-			n.set(t, e), r += t;
-		}
+		if (typeof e == "number") {
+			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 (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.");
 	}
 	return {
-		fullText: r,
-		resolver: (e) => n.get(e)
+		fullText: o,
+		resolver: (e) => n.get(e),
+		numberMap: r
 	};
 }
-function L(e, ...t) {
-	let { fullText: n, resolver: r } = I(e, t);
-	return F(n, r);
-}
-function R(e, ...t) {
-	let { fullText: n, resolver: r } = I(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? F(n, r) : P(n, r);
+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/lp-writer.ts
-function z(e, t, n) {
-	let r = e.replace(/[^a-zA-Z0-9_]/g, "_");
-	return /^[0-9]/.test(r) && (r = `${t}_${r}`), (!r || r.length === 0) && (r = `${t}_${n}`), r;
+//#region src/modeler/solvers/highs/worker-client.ts
+var z = null, Ae = 0, B = /* @__PURE__ */ new Map();
+function je(e, t) {
+	return e ? {
+		Status: "Interrupted",
+		StatusCode: 17,
+		HasPrimalSolution: !0,
+		IsMip: !0,
+		ObjectiveValue: e.objectiveValue,
+		ObjectiveOffsetApplied: !0,
+		...t?.objectiveBound === void 0 ? e.mipDualBound === void 0 ? {} : { MipDualBound: e.mipDualBound } : { MipDualBound: t.objectiveBound },
+		...t?.relGap === void 0 ? e.mipGap === void 0 ? {} : { MipGap: e.mipGap } : { MipGap: t.relGap },
+		Columns: e.columns,
+		Rows: []
+	} : {
+		Status: "Interrupted",
+		StatusCode: 17,
+		HasPrimalSolution: !1,
+		ObjectiveValue: NaN,
+		ObjectiveOffsetApplied: !0,
+		...t?.objectiveBound === void 0 ? {} : { MipDualBound: t.objectiveBound },
+		...t?.relGap === void 0 ? {} : { MipGap: t.relGap },
+		Columns: {},
+		Rows: []
+	};
 }
-function B(e) {
-	let { sense: t, objective: n, constraints: r, variables: i } = e, a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
-	for (let e of i) {
-		let t = z(e.name, "x", e.id), n = t, r = 1;
-		for (; c.has(n);) n = `${t}_${r++}`;
-		c.add(n), o.set(e, n), a.set(n, e);
-	}
-	let l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Map();
-	for (let e of r) {
-		let t = z(e.name, "c", e.id), n = t, r = 1;
-		for (; l.has(n);) n = `${t}_${r++}`;
-		l.add(n), u.set(e, n), s.set(n, e);
-	}
-	let d = [];
-	d.push(t && t.toLowerCase() === "maximize" ? "Maximize" : "Minimize");
-	let f = [], p = !0, m = n instanceof D ? n.linearTerms : n.terms;
-	if (m) for (let [e, t] of m) {
-		if (Math.abs(t) < 1e-12) continue;
-		let n = o.get(e), r = t >= 0 ? p ? "" : "+ " : "- ", i = Math.abs(t), a = i === 1 ? "" : `${i} `;
-		f.push(`${r}${a}${n}`), p = !1;
-	}
-	if (n instanceof D && n.quadTerms.size > 0) {
-		let e = [], t = !0;
-		for (let r of n.quadTerms.values()) {
-			if (Math.abs(r.coeff) < 1e-12) continue;
-			let n = 2 * r.coeff, i = n >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(n), s = a === 1 ? "" : `${a} `, c = o.get(r.var1), l = o.get(r.var2);
-			r.var1 === r.var2 ? e.push(`${i}${s}${c} ^ 2`) : e.push(`${i}${s}${c} * ${l}`), t = !1;
-		}
-		if (e.length > 0) {
-			let t = `[ ${e.join(" ")} ] / 2`;
-			f.length > 0 ? f.push("+", t) : f.push(t);
-		}
-	}
-	let h = f.length > 0 ? f.join(" ") : "0";
-	d.push(` obj: ${h}`), d.push("Subject To");
-	for (let e of r) {
-		let t = u.get(e), n = [], r = !0;
-		for (let [t, i] of e.lhs.terms) {
-			if (Math.abs(i) < 1e-12) continue;
-			let e = o.get(t), a = i >= 0 ? r ? "" : "+ " : "- ", s = Math.abs(i), c = s === 1 ? "" : `${s} `;
-			n.push(`${a}${c}${e}`), r = !1;
-		}
-		let i = n.length > 0 ? n.join(" ") : "0", a = e.sense === "==" ? "=" : e.sense;
-		d.push(` ${t}: ${i} ${a} ${e.rhs}`);
-	}
-	d.push("Bounds");
-	let g = [], _ = [];
-	for (let e of i) {
-		let t = o.get(e);
-		if (e.type === "Binary") {
-			_.push(t);
-			continue;
+function Me(e) {
+	let t = B.values().next().value;
+	if (t && !t.dispatched) {
+		t.dispatched = !0;
+		try {
+			e.postMessage({
+				type: "SOLVE",
+				id: t.id,
+				lpString: t.lpString,
+				options: t.workerOptions,
+				...t.reportProgress ? { reportProgress: !0 } : {}
+			});
+		} catch (n) {
+			B.delete(t.id), t.cleanupAbort?.(), t.reject(n), Me(e);
 		}
-		e.type === "Integer" && g.push(t);
-		let n = e.lb === -Infinity, r = e.ub === Infinity;
-		n && r ? d.push(` ${t} free`) : n && !r ? d.push(` -infinity <= ${t} <= ${e.ub}`) : !n && r ? e.lb !== 0 && d.push(` ${t} >= ${e.lb}`) : d.push(` ${e.lb} <= ${t} <= ${e.ub}`);
-	}
-	if (g.length > 0) {
-		d.push("Generals");
-		for (let e = 0; e < g.length; e += 10) d.push(" " + g.slice(e, e + 10).join(" "));
 	}
-	if (_.length > 0) {
-		d.push("Binary");
-		for (let e = 0; e < _.length; e += 10) d.push(" " + _.slice(e, e + 10).join(" "));
+}
+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(B.values())) B.delete(t.id), t.cleanupAbort?.(), t.reject(e);
+		}
 	}
-	return d.push("End"), {
-		lpString: d.join("\n") + "\n",
-		nameToVar: a,
-		nameToConstraint: s
-	};
 }
-//#endregion
-//#region src/modeler/solvers/highs/worker-client.ts
-var V = null, le = 0, H = /* @__PURE__ */ new Map();
-function ue() {
+function Pe() {
 	if (typeof window > "u" || typeof Worker > "u") return null;
-	if (!V) try {
-		V = ee();
-		let e = V;
-		V.onmessage = (e) => {
-			let { type: t, id: n, result: r, runTime: i, error: a } = e.data, o = H.get(n);
-			o && (H.delete(n), t === "SOLVE_SUCCESS" ? o.resolve({
-				result: r,
-				runTime: i
-			}) : o.reject(Error(a || "Worker solve failed")));
+	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) {
+						l.lastProgress = s;
+						try {
+							l.onProgress?.(s);
+						} catch (e) {
+							let t = B.get(r);
+							if (t) {
+								let n = B.keys().next().value;
+								B.delete(r), t.cleanupAbort?.(), n === r && Ne(), t.reject(e);
+							}
+						}
+					}
+					return;
+				}
+				if (n === "SOLVE_INCUMBENT") {
+					c && (l.lastIncumbent = c);
+					return;
+				}
+				B.delete(r), l.cleanupAbort?.(), n === "SOLVE_SUCCESS" ? l.resolve({
+					result: i,
+					runTime: a
+				}) : 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.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 U(e, t = {}) {
-	let n = await _(t.wasmUrl), r = t.useWorker ?? typeof window < "u" ? ue() : null;
-	if (!r) return m(e, t);
-	let i = {
-		...t,
-		wasmUrl: n
-	}, a = `req_${++le}`;
+async function V(e, t = {}) {
+	if (t.signal?.aborted) return {
+		result: je(),
+		runTime: 0
+	};
+	let n = await F(t.wasmUrl);
+	if (t.signal?.aborted) return {
+		result: je(),
+		runTime: 0
+	};
+	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_${++Ae}`, u = performance.now();
 	return new Promise((t, n) => {
-		H.set(a, {
+		let o = {
+			id: l,
+			lpString: e,
+			workerOptions: s,
+			reportProgress: c,
+			startTime: u,
+			onProgress: a,
 			resolve: t,
 			reject: n
-		});
-		try {
-			r.postMessage({
-				type: "SOLVE",
-				id: a,
-				lpString: e,
-				options: i
-			});
-		} catch (e) {
-			H.delete(a), n(e);
+		};
+		if (i) {
+			let e = () => {
+				let e = B.get(l);
+				if (!e) return;
+				let t = B.keys().next().value;
+				B.delete(l), e.cleanupAbort?.(), t === l && Ne();
+				let n = (performance.now() - e.startTime) / 1e3;
+				e.resolve({
+					result: je(e.lastIncumbent, e.lastProgress),
+					runTime: n
+				});
+			};
+			i.addEventListener("abort", e, { once: !0 }), o.cleanupAbort = () => i.removeEventListener("abort", e);
 		}
+		B.set(l, o), Me(r);
 	});
 }
 //#endregion
 //#region src/modeler/solvers/highs/solver.ts
-function W(e) {
+function H(e, t) {
+	if (typeof t == "number") switch (t) {
+		case 0: return "NotSolved";
+		case 1:
+		case 2:
+		case 3:
+		case 4:
+		case 5: return "Error";
+		case 6: return "Unknown";
+		case 7: return "Optimal";
+		case 8: return "Infeasible";
+		case 9: return "InfeasibleOrUnbounded";
+		case 10: return "Unbounded";
+		case 11: return "ObjectiveBound";
+		case 12: return "ObjectiveTarget";
+		case 13: return "TimeLimit";
+		case 14: return "IterationLimit";
+		case 15: return "Unknown";
+		case 16: return "SolutionLimit";
+		case 17: return "Interrupted";
+		case 18: return "MemoryLimit";
+	}
 	if (typeof e != "string") return "Unknown";
-	let t = e.trim();
-	if (!t) return "Unknown";
-	switch (t) {
+	let n = e.trim();
+	if (!n) return "Unknown";
+	switch (n) {
 		case "Optimal": return "Optimal";
 		case "Infeasible": return "Infeasible";
 		case "Unbounded": return "Unbounded";
-		case "Primal infeasible or unbounded": return "Unknown";
+		case "Primal infeasible or unbounded":
+		case "InfeasibleOrUnbounded": return "InfeasibleOrUnbounded";
 		case "Time limit reached":
 		case "TimeLimit": return "TimeLimit";
 		case "Iteration limit reached":
 		case "IterationLimit": return "IterationLimit";
+		case "Solution limit reached":
+		case "SolutionLimit": return "SolutionLimit";
+		case "Memory limit reached":
+		case "MemoryLimit": return "MemoryLimit";
 		case "Bound on objective reached":
+		case "ObjectiveBound": return "ObjectiveBound";
 		case "Target for objective reached":
+		case "ObjectiveTarget": return "ObjectiveTarget";
+		case "Interrupted":
+		case "User interrupt": return "Interrupted";
 		case "Feasible": return "Feasible";
 		case "Not Set": return "NotSolved";
 		case "Load error":
@@ -829,307 +489,1657 @@ function W(e) {
 		case "Empty":
 		case "Unknown": return "Unknown";
 	}
-	let n = t.toLowerCase();
-	return n.includes("infeasible") && n.includes("unbounded") ? "Unknown" : n.includes("infeasible") ? "Infeasible" : n.includes("unbounded") ? "Unbounded" : n.includes("time limit") || n.includes("timelimit") ? "TimeLimit" : n.includes("iteration limit") || n.includes("iterationlimit") ? "IterationLimit" : n.includes("error") ? "Error" : n === "optimal" ? "Optimal" : "Unknown";
+	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 U(e, t, n) {
+	switch (H(e, t)) {
+		case "Optimal": return "Optimal";
+		case "Infeasible": return "Infeasible";
+		case "Unbounded": return "Unbounded";
+		case "TimeLimit": return "TimeLimit";
+		case "IterationLimit": return "IterationLimit";
+		case "Feasible": return "Feasible";
+		case "ObjectiveBound":
+		case "ObjectiveTarget":
+		case "SolutionLimit": return n === !1 ? "Unknown" : "Feasible";
+		case "MemoryLimit":
+		case "Interrupted": return n ? "Feasible" : "Unknown";
+		case "NotSolved": return "NotSolved";
+		case "Error": return "Error";
+		default: return "Unknown";
+	}
 }
-var G = class e {
+var W = class e {
 	static capabilities = {
 		supportsMIP: !0,
-		supportsQP: !0
+		supportsQP: !0,
+		supportsWarmStart: !0
 	};
 	name = "HiGHS";
-	version = "1.15.3";
+	version = "1.15.1";
 	capabilities = e.capabilities;
 	options;
 	constructor(e = {}) {
 		this.options = e;
 	}
-	async solve(e, t, n = {}) {
-		let r = {
+	async solve(e, t = {}, n = {}) {
+		let r = E(t), i = r ? n : t, a = {
 			...this.options,
-			...n
-		}, { lpString: i, nameToVar: a, nameToConstraint: o } = t, { result: s, runTime: c } = await U(i, r), l = W(s?.Status);
-		if (l === "Infeasible" || l === "Unbounded") return {
-			status: l,
+			...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, { 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);
+			n !== void 0 && (u[e] = n, p = !0);
+		}
+		for (let t = 0; t < e.variables.length; t++) {
+			let n = e.variables[t];
+			if (!m.has(n)) {
+				let e = w(n);
+				if (e !== void 0) {
+					let r = f(n.name, "x", t);
+					Object.prototype.hasOwnProperty.call(u, r) || (u[r] = e, p = !0);
+				}
+			}
+		}
+		let h = a;
+		(o !== 0 || p || h.initialValues !== void 0) && (h = {
+			...h,
+			...o === 0 ? {} : { objectiveOffset: o },
+			initialValues: p ? u : void 0
+		});
+		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 = 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) {
+			if (k === 0) O = 0;
+			else if (Math.abs(T) > 0) {
+				let e = k / Math.abs(T);
+				O = Number.isFinite(e) ? e : void 0;
+			} else O = void 0;
+		} else typeof g?.MipGap == "number" && Number.isFinite(g.MipGap) ? O = g.MipGap : b && y === "Optimal" && x && (k === void 0 || k === 0) && (O = 0);
+		if (!x) return {
+			status: S,
+			terminationStatus: y,
+			hasPrimalSolution: !1,
 			objectiveValue: null,
+			...D === void 0 ? {} : { objectiveBound: D },
+			...O === void 0 ? {} : {
+				relGap: O,
+				mipGap: O
+			},
+			...k === void 0 ? {} : { absGap: k },
 			values: {},
 			reducedCosts: {},
 			duals: {},
 			slacks: {},
-			runTime: c,
-			raw: s
+			runTime: _,
+			raw: g
 		};
-		let u = s.ObjectiveValue, d = typeof u == "number" ? u + e.objective.constant : null, f = {}, p = {}, m = {}, h = {};
-		if (s.Columns) for (let [e, t] of Object.entries(s.Columns)) {
-			let n = a.get(e);
+		let A = (e, t, n) => {
+			Object.defineProperty(e, t, {
+				value: n,
+				enumerable: !0,
+				writable: !0,
+				configurable: !0
+			});
+		}, j = {}, ee = {}, M = {}, N = {};
+		if (g.Columns) for (let [e, t] of Object.entries(g.Columns)) {
+			let n = c.get(e);
 			if (n) {
-				let e = Math.abs(t.Primal) < 1e-9 ? 0 : t.Primal;
-				f[n.name] = e, t.Dual !== void 0 && (m[n.name] = Math.abs(t.Dual) < 1e-9 ? 0 : t.Dual);
+				if (typeof t.Primal == "number" && Number.isFinite(t.Primal)) {
+					let e = Math.abs(t.Primal) < 1e-9 ? 0 : t.Primal;
+					A(j, n.name, e);
+				}
+				typeof t.Dual == "number" && Number.isFinite(t.Dual) && A(M, n.name, Math.abs(t.Dual) < 1e-9 ? 0 : t.Dual);
 			}
 		}
-		if (s.Rows) {
-			let e = Array.isArray(s.Rows) ? s.Rows : Object.values(s.Rows);
+		if (g.Rows) {
+			let e = Array.isArray(g.Rows) ? g.Rows : Object.values(g.Rows);
 			for (let t of e) {
-				let e = t.Name, n = o.get(e);
-				if (n && (t.Dual !== void 0 && (p[n.name] = Math.abs(t.Dual) < 1e-9 ? 0 : t.Dual), t.Primal !== void 0)) {
+				let e = t.Name, n = e ? l.get(e) : void 0;
+				if (n && (typeof t.Dual == "number" && Number.isFinite(t.Dual) && A(ee, n.name, Math.abs(t.Dual) < 1e-9 ? 0 : t.Dual), typeof t.Primal == "number" && Number.isFinite(t.Primal))) {
 					let e = n.rhs - t.Primal;
-					h[n.name] = Math.abs(e) < 1e-9 ? 0 : e;
+					A(N, n.name, Math.abs(e) < 1e-9 ? 0 : e);
 				}
 			}
 		}
 		return {
-			status: l,
-			objectiveValue: d,
-			values: f,
-			reducedCosts: m,
-			duals: p,
-			slacks: h,
-			runTime: c,
-			raw: s
+			status: S,
+			terminationStatus: y,
+			hasPrimalSolution: !0,
+			objectiveValue: T,
+			...D === void 0 ? {} : { objectiveBound: D },
+			...O === void 0 ? {} : {
+				relGap: O,
+				mipGap: O
+			},
+			...k === void 0 ? {} : { absGap: k },
+			values: j,
+			reducedCosts: M,
+			duals: ee,
+			slacks: N,
+			runTime: _,
+			raw: g
 		};
 	}
-}, K = G;
-function q() {
-	d("highs", (e) => new G(e)), l((e) => new G(e));
+}, G = W;
+function K() {
+	T("highs", (e) => new W(e)), _((e) => new W(e));
 }
-q();
+K();
 //#endregion
 //#region src/modeler/solvers/highs/index.ts
-var J = /* @__PURE__ */ S({
-	HiGHS: () => K,
-	HighsSolver: () => G,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
-	getHighs: () => g,
-	getHighsWasmUrl: () => v,
-	isValidWasmHeader: () => h,
-	mapHighsStatus: () => W,
-	probeWasmUrl: () => p,
-	registerHighsSolver: () => q,
-	resolveBrowserWasmUrl: () => _,
-	setHighsWasmUrl: () => y,
-	solveLp: () => U,
-	solveLpWithHighs: () => m
+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: () => K,
+	resolveBrowserWasmUrl: () => F,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
+	solveLpWithHighs: () => N
 });
-import * as de from "./highs-worker-factory.js";
-w(J, de);
-import * as fe from "./highs-assets.js";
-w(J, fe);
+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 Y = /* @__PURE__ */ S({
-	HiGHS: () => K,
-	HighsSolver: () => G,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
-	getHighs: () => g,
-	getHighsWasmUrl: () => v,
-	isValidWasmHeader: () => h,
-	mapHighsStatus: () => W,
-	probeWasmUrl: () => p,
-	registerHighsSolver: () => q,
-	resolveBrowserWasmUrl: () => _,
-	setHighsWasmUrl: () => y,
-	solveLp: () => U,
-	solveLpWithHighs: () => m
+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: () => K,
+	resolveBrowserWasmUrl: () => F,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
+	solveLpWithHighs: () => N
 });
-w(Y, J);
+R(Re, Fe);
 //#endregion
 //#region src/modeler/solvers/mock.ts
-var X = class {
+var ze = class {
 	name;
 	capabilities;
 	options;
 	constructor(e = {}) {
 		this.name = e.name || "MockSolver", this.capabilities = e.capabilities || {
 			supportsMIP: !0,
-			supportsQP: !0
+			supportsQP: !0,
+			supportsWarmStart: !0
 		}, this.options = e;
 	}
-	async solve(e, t, n = {}) {
-		let r = {
+	async solve(e, t = {}, n = {}) {
+		let r = E(t) ? n : t, i = {
 			...this.options,
-			...n
+			...r
+		}, a = !!(i.values && Object.keys(i.values).length > 0 || i.boolValues && Object.keys(i.boolValues).length > 0);
+		if (i.signal?.aborted) return {
+			status: "Unknown",
+			terminationStatus: "Interrupted",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {},
+			runTime: 0,
+			raw: { mock: !0 }
 		};
-		return r.delayMs && r.delayMs > 0 && await new Promise((e) => setTimeout(e, r.delayMs)), {
-			status: r.status || "Optimal",
-			objectiveValue: r.objectiveValue ?? 0,
-			values: r.values || {},
-			reducedCosts: r.reducedCosts,
-			duals: r.duals,
-			slacks: r.slacks,
+		if (i.delayMs && i.delayMs > 0 && (await new Promise((e) => {
+			let t = setTimeout(() => {
+				i.signal?.removeEventListener("abort", n), e();
+			}, i.delayMs), n = () => {
+				clearTimeout(t), e();
+			};
+			i.signal?.addEventListener("abort", n, { once: !0 });
+		}), i.signal?.aborted)) {
+			let e = !!(i.hasPrimalSolution ?? a);
+			return {
+				status: e ? "Feasible" : "Unknown",
+				terminationStatus: "Interrupted",
+				hasPrimalSolution: e,
+				objectiveValue: e ? i.objectiveValue ?? 0 : null,
+				...i.objectiveBound === void 0 ? {} : { objectiveBound: i.objectiveBound },
+				...i.relGap === void 0 ? i.mipGap === void 0 ? {} : {
+					relGap: i.mipGap,
+					mipGap: i.mipGap
+				} : {
+					relGap: i.relGap,
+					mipGap: i.relGap
+				},
+				...i.absGap === void 0 ? {} : { absGap: i.absGap },
+				values: e && i.values || {},
+				...e && i.boolValues !== void 0 ? { boolValues: i.boolValues } : {},
+				runTime: .001,
+				raw: { mock: !0 }
+			};
+		}
+		if (i.onProgress && Array.isArray(i.progressEvents)) for (let e of i.progressEvents) {
+			if (i.signal?.aborted) break;
+			i.onProgress(e);
+		}
+		let o = i.status || "Optimal", s = i.terminationStatus ?? o, c = i.hasPrimalSolution === void 0 ? o === "Optimal" || o === "Feasible" || o === "Sat" || (o === "TimeLimit" || o === "IterationLimit" || s === "Interrupted") && a : i.hasPrimalSolution;
+		if (i.onProgress && !Array.isArray(i.progressEvents) && !i.signal?.aborted) {
+			let e = c ? i.objectiveValue ?? 0 : void 0;
+			i.onProgress({
+				elapsedTime: .001,
+				elapsedSeconds: .001,
+				...typeof e == "number" && Number.isFinite(e) ? { objectiveValue: e } : {},
+				...i.objectiveBound === void 0 ? {} : { objectiveBound: i.objectiveBound },
+				...i.relGap === void 0 ? i.mipGap === void 0 ? {} : {
+					relGap: i.mipGap,
+					mipGap: i.mipGap
+				} : {
+					relGap: i.relGap,
+					mipGap: i.relGap
+				},
+				...i.absGap === void 0 ? {} : { absGap: i.absGap }
+			});
+		}
+		return i.signal?.aborted && (s = "Interrupted", c = i.hasPrimalSolution === void 0 ? a : i.hasPrimalSolution, o = c ? "Feasible" : "Unknown"), {
+			status: o,
+			terminationStatus: s,
+			hasPrimalSolution: c,
+			objectiveValue: c ? i.objectiveValue ?? 0 : null,
+			...i.objectiveBound === void 0 ? {} : { objectiveBound: i.objectiveBound },
+			...i.relGap === void 0 ? i.mipGap === void 0 ? {} : {
+				relGap: i.mipGap,
+				mipGap: i.mipGap
+			} : {
+				relGap: i.relGap,
+				mipGap: i.relGap
+			},
+			...i.absGap === void 0 ? {} : { absGap: i.absGap },
+			values: c && i.values || {},
+			...c && i.boolValues !== void 0 ? { boolValues: i.boolValues } : {},
+			reducedCosts: i.reducedCosts,
+			duals: i.duals,
+			slacks: i.slacks,
 			runTime: .001,
 			raw: { mock: !0 }
 		};
 	}
 };
-function Z() {
-	d("mock", (e) => new X(e));
+function Be() {
+	T("mock", (e) => new ze(e));
 }
-Z();
+Be();
 //#endregion
 //#region src/modeler/solvers/index.ts
-var Q = /* @__PURE__ */ S({
-	HiGHS: () => K,
-	HighsSolver: () => G,
-	MockSolver: () => X,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
-	getHighs: () => g,
-	getHighsWasmUrl: () => v,
-	getSolver: () => f,
-	isValidWasmHeader: () => h,
-	listAvailableSolvers: () => u,
-	mapHighsStatus: () => W,
-	probeWasmUrl: () => p,
-	registerHighsSolver: () => q,
-	registerMockSolver: () => Z,
-	registerSolver: () => d,
-	resolveBrowserWasmUrl: () => _,
-	setDefaultSolver: () => l,
-	setHighsWasmUrl: () => y,
-	solveLp: () => U,
-	solveLpWithHighs: () => m
+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: () => re,
+	listAvailableSolvers: () => S,
+	mapHighsStatus: () => U,
+	mapHighsTerminationStatus: () => H,
+	probeWasmUrl: () => M,
+	registerHighsSolver: () => K,
+	registerMockSolver: () => Be,
+	registerSolver: () => T,
+	resolveBrowserWasmUrl: () => F,
+	setDefaultSolver: () => _,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
+	solveLpWithHighs: () => N
 });
-w(Q, Y);
+R(Ve, Re);
 //#endregion
-//#region src/modeler/model.ts
-var $ = class {
-	name;
-	sense;
-	objective;
-	variables = [];
-	constraints = [];
-	boolVars = [];
-	logicalConstraints = [];
-	unsatCore = [];
-	values = /* @__PURE__ */ new Map();
-	varMapByName = /* @__PURE__ */ new Map();
-	boolVarMapByName = /* @__PURE__ */ new Map();
-	boolVarPrefixCounters = /* @__PURE__ */ new Map();
-	constrMapByName = /* @__PURE__ */ new Map();
-	status = "NotSolved";
-	objectiveValue = null;
-	runTime = 0;
-	solution = null;
-	solver = null;
-	constructor(e = {}, t) {
-		let n;
-		n = typeof e == "string" ? {
-			...t,
-			name: e
-		} : e, this.name = n.name || "OptimizationModel", this.sense = T(n.sense), this.objective = new O(), n.solver && (this.solver = f(n.solver));
-	}
-	get vars() {
-		return this.variables;
-	}
-	get constrs() {
-		return this.constraints;
-	}
-	get numVars() {
-		return this.variables.length;
-	}
-	get numConstrs() {
-		return this.constraints.length;
-	}
-	createDomainVars(e, t, n, r) {
-		if (typeof n == "number" || Array.isArray(n)) {
-			let i = typeof t == "number" ? Array.from({ length: t }, (e, t) => t) : t, a = typeof n == "number" ? Array.from({ length: n }, (e, t) => t) : n, o = r || {}, s = o.prefix || o.name || "x", c = {};
-			for (let t of i) {
-				c[t] = {};
-				for (let n of a) c[t][n] = this.addVar({
-					...o,
-					type: e,
-					name: `${s}_${t}_${n}`
-				});
-			}
-			return c;
+//#region src/modeler/solution-validator.ts
+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 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);
+	}, g = (e) => {
+		u.push(e), Object.prototype.hasOwnProperty.call(d, e.name) || (d[e.name] = []), d[e.name].push(e), e.type !== "missing_value" && e.type !== "unchecked_constraint" && h(e.violation);
+	}, _ = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), y = 0, b = 0, x = 0, S = 0;
+	for (let t of e.variables) {
+		let e = s ? Object.prototype.hasOwnProperty.call(l, t.name) ? l[t.name] : void 0 : t.value;
+		if (e == null) {
+			p.push(t.name), g({
+				type: "missing_value",
+				target: "variable",
+				name: t.name,
+				actual: e ?? null,
+				violation: Infinity,
+				message: `Variable "${t.name}" has no assigned solution value.`
+			});
+			continue;
 		}
-		if (typeof t == "string") {
-			let r = n || {};
-			return this.addVar({
-				...r,
-				type: e,
-				name: t
+		if (typeof e != "number" || !Number.isFinite(e)) {
+			g({
+				type: "non_finite_value",
+				target: "variable",
+				name: t.name,
+				actual: e,
+				violation: Infinity,
+				message: `Variable "${t.name}" has non-finite or non-numeric value: ${String(e)}.`
 			});
+			continue;
 		}
-		let i = n || {}, a = i.prefix || i.name;
-		if (typeof t == "number") {
-			let n = [], r = a || "x";
-			for (let a = 0; a < t; a++) n.push(this.addVar({
-				...i,
-				type: e,
-				name: `${r}_${a}`
-			}));
-			return n;
+		_.set(t, e), y++;
+		let n = t.type === "Binary" || t.type === "BINARY", a = n || t.type === "Integer" || t.type === "INTEGER", o = n ? Math.max(0, t.lb) : t.lb, c = n ? Math.min(1, t.ub) : t.ub, u = typeof t.lb == "number" && !Number.isNaN(t.lb) && t.lb !== Infinity, d = typeof t.ub == "number" && !Number.isNaN(t.ub) && t.ub !== -Infinity;
+		if (!u) g({
+			type: "lower_bound",
+			target: "variable",
+			name: t.name,
+			actual: e,
+			limit: t.lb,
+			violation: Infinity,
+			message: `Variable "${t.name}" has invalid lower bound (${String(t.lb)}).`
+		});
+		else if (o !== -Infinity) {
+			let n = e - o, i = Math.max(0, o - e);
+			h(i), i > r && g({
+				type: "lower_bound",
+				target: "variable",
+				name: t.name,
+				actual: e,
+				limit: o,
+				violation: i,
+				signedViolation: n,
+				message: `Variable "${t.name}" value (${e}) violates lower bound (${o}) by ${i}.`
+			});
 		}
-		if (Array.isArray(t) || t && typeof t[Symbol.iterator] == "function") {
-			let n = {};
-			for (let r of t) {
-				let t = a ? `${a}_${r}` : `${r}`;
-				n[r] = this.addVar({
-					...i,
-					type: e,
-					name: t
-				});
-			}
-			return n;
+		if (!d) g({
+			type: "upper_bound",
+			target: "variable",
+			name: t.name,
+			actual: e,
+			limit: t.ub,
+			violation: Infinity,
+			message: `Variable "${t.name}" has invalid upper bound (${String(t.ub)}).`
+		});
+		else if (c !== Infinity) {
+			let n = e - c, i = Math.max(0, e - c);
+			h(i), i > r && g({
+				type: "upper_bound",
+				target: "variable",
+				name: t.name,
+				actual: e,
+				limit: c,
+				violation: i,
+				signedViolation: n,
+				message: `Variable "${t.name}" value (${e}) violates upper bound (${c}) by ${i}.`
+			});
+		}
+		if (u && d && o > c && o - e <= r && e - c <= r) {
+			let n = o - c;
+			g({
+				type: "lower_bound",
+				target: "variable",
+				name: t.name,
+				actual: e,
+				limit: o,
+				violation: n,
+				signedViolation: e - o,
+				message: `Variable "${t.name}" has inverted bounds [${o}, ${c}].`
+			});
+		}
+		if (a) {
+			let r = Math.round(e), a = e - r, o = Math.abs(a);
+			h(o), o > i && g({
+				type: "integrality",
+				target: "variable",
+				name: t.name,
+				varType: n ? "Binary" : "Integer",
+				actual: e,
+				nearestInteger: r,
+				violation: o,
+				signedViolation: a,
+				message: `${n ? "Binary" : "Integer"} variable "${t.name}" value (${e}) violates integrality by ${o} (nearest integer: ${r}).`
+			});
 		}
-		throw Error(`Invalid arguments provided for ${e.toLowerCase()} variable creation`);
-	}
-	binary(e, t, n) {
-		return this.createDomainVars("Binary", e, t, n);
-	}
-	integer(e, t, n) {
-		return this.createDomainVars("Integer", e, t, n);
-	}
-	continuous(e, t, n) {
-		return this.createDomainVars("Continuous", e, t, n);
 	}
-	bool(e, t, n) {
-		if (typeof t == "number" || Array.isArray(t)) {
-			let r = typeof e == "number" ? Array.from({ length: e }, (e, t) => t) : e, i = typeof t == "number" ? Array.from({ length: t }, (e, t) => t) : t, a = n || {}, o = a.prefix || a.name || "p", s = {};
-			for (let e of r) {
-				s[e] = {};
-				for (let t of i) s[e][t] = this.createBoolVar(`${o}_${e}_${t}`);
-			}
-			return s;
+	for (let t of e.boolVars) {
+		let e = s ? Object.prototype.hasOwnProperty.call(l, t.name) ? l[t.name] : void 0 : t.value;
+		if (e == null) {
+			p.push(t.name), g({
+				type: "missing_value",
+				target: "bool_variable",
+				name: t.name,
+				actual: e ?? null,
+				violation: Infinity,
+				message: `Boolean variable "${t.name}" has no assigned solution value.`
+			});
+			continue;
 		}
-		if (typeof e == "string" || e === void 0) return this.createBoolVar(e);
-		let r = t || {}, i = r.prefix || r.name;
-		if (typeof e == "number") {
-			let t = [], n = i || "p";
-			for (let r = 0; r < e; r++) t.push(this.createBoolVar(this.getNextBoolVarName(n)));
-			return t;
+		if (typeof e != "boolean") {
+			g({
+				type: "invalid_boolean_value",
+				target: "bool_variable",
+				name: t.name,
+				actual: e,
+				violation: Infinity,
+				message: `Boolean variable "${t.name}" has non-boolean value: ${String(e)}.`
+			});
+			continue;
 		}
-		if (Array.isArray(e) || e && typeof e[Symbol.iterator] == "function") {
-			let t = {};
-			for (let n of e) {
-				let e = i ? `${i}_${n}` : `${n}`;
-				t[n] = this.createBoolVar(e);
+		v.set(t, e), b++;
+	}
+	let C = (e) => {
+		let t = e.constant === void 0 ? 0 : e.constant;
+		if (typeof t != "number" || !Number.isFinite(t)) return {
+			ok: !1,
+			reason: `non-finite constant (${String(t)})`
+		};
+		let n = t;
+		for (let [t, r] of e.terms) {
+			if (typeof r != "number" || !Number.isFinite(r)) return {
+				ok: !1,
+				reason: `non-finite coefficient (${String(r)}) for variable "${t.name}"`
+			};
+			if (r !== 0) {
+				if (!_.has(t)) return {
+					ok: !1,
+					reason: `missing or invalid value for variable "${t.name}"`
+				};
+				if (n += r * _.get(t), !Number.isFinite(n)) return {
+					ok: !1,
+					reason: "linear expression evaluation overflowed finite range"
+				};
 			}
-			return t;
 		}
+		return {
+			ok: !0,
+			value: n
+		};
+	}, w = (e, t = r) => {
+		if (typeof e.rhs != "number" || !Number.isFinite(e.rhs)) return {
+			status: "unchecked",
+			reason: `non-finite right-hand side (${String(e.rhs)})`
+		};
+		let n = C(e.lhs);
+		if (!n.ok) return {
+			status: "unchecked",
+			reason: n.reason
+		};
+		let i = n.value, a = i - e.rhs;
+		if (!Number.isFinite(a)) return {
+			status: "unchecked",
+			reason: "constraint residual overflowed finite range"
+		};
+		let o = e.sense === "<=" ? Math.max(0, a) : e.sense === ">=" ? Math.max(0, -a) : Math.abs(a);
+		return o > t ? {
+			status: "violated",
+			lhsVal: i,
+			signed: a,
+			violation: o,
+			message: `Constraint "${e.name}" (${i} ${e.sense} ${e.rhs}) violated by ${o}.`
+		} : {
+			status: "satisfied",
+			lhsVal: i,
+			signed: a,
+			violation: o
+		};
+	};
+	for (let t of e.constraints) {
+		let e = w(t);
+		e.status === "unchecked" ? (f.push(t.name), g({
+			type: "unchecked_constraint",
+			target: "constraint",
+			name: t.name,
+			sense: t.sense,
+			limit: t.rhs,
+			rhs: t.rhs,
+			violation: Infinity,
+			message: `Constraint "${t.name}" could not be evaluated: ${e.reason}.`
+		})) : e.status === "violated" ? (x++, g({
+			type: "linear_constraint",
+			target: "constraint",
+			name: t.name,
+			sense: t.sense,
+			actual: e.lhsVal,
+			limit: t.rhs,
+			rhs: t.rhs,
+			violation: e.violation,
+			signedViolation: e.signed,
+			message: e.message
+		})) : (x++, h(e.violation));
+	}
+	let T = (e) => {
+		if (e instanceof o) return v.has(e) ? {
+			ok: !0,
+			value: v.get(e),
+			violation: 0
+		} : {
+			ok: !1,
+			reason: `missing or invalid value for Boolean variable "${e.name}"`
+		};
+		if (e instanceof c) {
+			let t = w(e, 0);
+			if (t.status === "unchecked") return {
+				ok: !1,
+				reason: t.reason
+			};
+			if (r > 0) {
+				let n = Math.abs(t.lhsVal - e.rhs);
+				if (n > 0 && n <= r) return {
+					ok: !1,
+					reason: `numeric comparison "${e.name}" lies within feasibilityTolerance (${r}) of boundary (${t.lhsVal} vs ${e.rhs})`
+				};
+			}
+			return {
+				ok: !0,
+				value: t.status === "satisfied",
+				violation: 0
+			};
+		}
+		if (e instanceof n) switch (e.op) {
+			case "not": {
+				let t = T(e.children[0]);
+				return t.ok ? {
+					ok: !0,
+					value: !t.value,
+					violation: 0
+				} : t;
+			}
+			case "and": {
+				let t = 0;
+				for (let n of e.children) {
+					let e = T(n);
+					if (!e.ok) return e;
+					if (!e.value) return {
+						ok: !0,
+						value: !1,
+						violation: 0
+					};
+					e.violation > t && (t = e.violation);
+				}
+				return {
+					ok: !0,
+					value: !0,
+					violation: t
+				};
+			}
+			case "or": {
+				let t = !1, n = Infinity;
+				for (let r of e.children) {
+					let e = T(r);
+					if (!e.ok) return e;
+					e.value && (t = !0, e.violation < n && (n = e.violation));
+				}
+				return {
+					ok: !0,
+					value: t,
+					violation: t ? n : 0
+				};
+			}
+			case "implies": {
+				let t = T(e.children[0]);
+				if (!t.ok) return t;
+				if (!t.value) return {
+					ok: !0,
+					value: !0,
+					violation: 0
+				};
+				let n = T(e.children[1]);
+				return n.ok ? {
+					ok: !0,
+					value: n.value,
+					violation: n.value ? n.violation : 0
+				} : n;
+			}
+			case "xor": {
+				let t = !1, n = 0;
+				for (let r of e.children) {
+					let e = T(r);
+					if (!e.ok) return e;
+					e.value && (t = !t, e.violation > n && (n = e.violation));
+				}
+				return {
+					ok: !0,
+					value: t,
+					violation: t ? n : 0
+				};
+			}
+			default: return {
+				ok: !1,
+				reason: `unsupported logical operator "${String(e.op)}"`
+			};
+		}
+		return {
+			ok: !1,
+			reason: "unsupported logical expression node"
+		};
+	};
+	for (let t = 0; t < e.logicalConstraints.length; t++) {
+		let n = e.logicalConstraints[t], r = n.name || `lc_${t + 1}`;
+		if (!a) {
+			f.push(r), g({
+				type: "unchecked_constraint",
+				target: "logical_constraint",
+				name: r,
+				violation: Infinity,
+				message: `Logical constraint "${r}" was not evaluated because evaluateLogicalConstraints is false.`
+			});
+			continue;
+		}
+		let i = T(n.expr);
+		if (!i.ok) {
+			f.push(r), g({
+				type: "unchecked_constraint",
+				target: "logical_constraint",
+				name: r,
+				violation: Infinity,
+				message: `Logical constraint "${r}" could not be evaluated: ${i.reason}.`
+			});
+			continue;
+		}
+		S++, i.value ? h(i.violation) : g({
+			type: "logical_constraint",
+			target: "logical_constraint",
+			name: r,
+			actual: !1,
+			limit: !0,
+			violation: 1,
+			signedViolation: -1,
+			message: `Logical constraint "${r}" evaluated to false.`
+		});
+	}
+	let E = y === e.variables.length && b === e.boolVars.length && x === e.constraints.length && S === e.logicalConstraints.length && f.length === 0 && p.length === 0;
+	return {
+		valid: E && u.length === 0,
+		complete: E,
+		violations: u,
+		violationsByName: d,
+		uncheckedConstraints: f,
+		missingVariables: p,
+		maxViolation: m,
+		summary: {
+			checkedVariables: y,
+			totalVariables: e.variables.length,
+			checkedBoolVariables: b,
+			totalBoolVariables: e.boolVars.length,
+			checkedLinearConstraints: x,
+			totalLinearConstraints: e.constraints.length,
+			checkedLogicalConstraints: S,
+			totalLogicalConstraints: e.logicalConstraints.length
+		}
+	};
+}
+//#endregion
+//#region src/modeler/big-m.ts
+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 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;
+	if (!Number.isFinite(i)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": effective right-hand side (${t} - ${r}) overflows finite floating-point range. Please rescale coefficients/constants.`);
+	for (let [t, r] of e.terms) {
+		if (!Number.isFinite(r)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": variable "${t.name}" has non-finite coefficient (${r}).`);
+		if (Number.isNaN(t.lb) || Number.isNaN(t.ub) || t.lb === Infinity || t.ub === -Infinity || t.lb > t.ub) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": variable "${t.name}" has invalid bounds [${t.lb}, ${t.ub}].`);
+	}
+	return i;
+}
+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;
+		if (r > 0) {
+			if (!Number.isFinite(t.ub)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": variable "${t.name}" lacks a finite upper bound (required because coefficient ${r} is positive in <= constraint). Please set an explicit finite upper bound on the variable or specify { M } explicitly in indicator options.`);
+			e = t.ub;
+		} else {
+			if (!Number.isFinite(t.lb)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": variable "${t.name}" lacks a finite lower bound (required because coefficient ${r} is negative in <= constraint). Please set an explicit finite lower bound on the variable or specify { M } explicitly in indicator options.`);
+			e = t.lb;
+		}
+		let a = r * e;
+		if (i += a, !Number.isFinite(a) || !Number.isFinite(i)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": numeric overflow while bounding contribution of variable "${t.name}". Please rescale coefficients/bounds or specify a finite { M } explicitly.`);
+	}
+	let a = i - r;
+	if (!Number.isFinite(a)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": numeric overflow while computing Big-M (${i} - ${r}). Please rescale coefficients/bounds or specify a finite { M } explicitly.`);
+	let o = Math.max(0, a);
+	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 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;
+		if (r > 0) {
+			if (!Number.isFinite(t.lb)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": variable "${t.name}" lacks a finite lower bound (required because coefficient ${r} is positive in >= constraint). Please set an explicit finite lower bound on the variable or specify { M } explicitly in indicator options.`);
+			e = t.lb;
+		} else {
+			if (!Number.isFinite(t.ub)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": variable "${t.name}" lacks a finite upper bound (required because coefficient ${r} is negative in >= constraint). Please set an explicit finite upper bound on the variable or specify { M } explicitly in indicator options.`);
+			e = t.ub;
+		}
+		let a = r * e;
+		if (i += a, !Number.isFinite(a) || !Number.isFinite(i)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": numeric overflow while bounding contribution of variable "${t.name}". Please rescale coefficients/bounds or specify a finite { M } explicitly.`);
+	}
+	let a = r - i;
+	if (!Number.isFinite(a)) throw Error(`Cannot derive safe Big-M for indicator constraint "${n}": numeric overflow while computing Big-M (${r} - ${i}). Please rescale coefficients/bounds or specify a finite { M } explicitly.`);
+	let o = Math.max(0, a);
+	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 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 = 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}.`);
+	let c = t.terms.get(e);
+	if (c !== void 0 && c !== 0) throw Error(`Indicator constraint "${o}" cannot include its own binary activation variable "${e.name}" in the linear expression.`);
+	let l, u;
+	if (i === 1 ? n === "<=" ? (l = a, u = s + a) : (l = -a, u = s - a) : n === "<=" ? (l = -a, u = s) : (l = a, u = s), !Number.isFinite(u)) throw Error(`Cannot construct finite indicator constraint "${o}": shifted right-hand side overflows finite floating-point range. Please rescale coefficients/bounds or specify a smaller finite { M }.`);
+	let d = /* @__PURE__ */ new Map();
+	for (let [e, n] of t.terms) n !== 0 && d.set(e, n);
+	return l !== 0 && d.set(e, l), {
+		lhs: new j(d, 0),
+		rhs: u
+	};
+}
+//#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";
+}
+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 nt = class {
+	name;
+	_sense;
+	_objectiveExpr;
+	variables = [];
+	constraints = [];
+	boolVars = [];
+	logicalConstraints = [];
+	unsatCore = void 0;
+	_conflicts = void 0;
+	values = /* @__PURE__ */ new Map();
+	varMapByName = /* @__PURE__ */ new Map();
+	varPrefixCounters = /* @__PURE__ */ new Map();
+	boolVarMapByName = /* @__PURE__ */ new Map();
+	boolVarPrefixCounters = /* @__PURE__ */ new Map();
+	constrMapByName = /* @__PURE__ */ new Map();
+	constrPrefixCounters = /* @__PURE__ */ new Map();
+	logicalConstrMapByName = /* @__PURE__ */ new Map();
+	logicalConstrCounter = 0;
+	status = "NotSolved";
+	terminationStatus = "NotSolved";
+	hasPrimalSolution = !1;
+	objectiveValue = null;
+	objectiveBound = void 0;
+	relGap = void 0;
+	mipGap = void 0;
+	absGap = void 0;
+	runTime = 0;
+	solution = null;
+	solver = null;
+	decomposition;
+	_linkingConstraints;
+	hasSolutionState = !1;
+	modelRevision = 0;
+	activeOperationId = 0;
+	batchDepth = 0;
+	batchMutated = !1;
+	batchUndoActions = [];
+	constructor(e = {}, t) {
+		let n;
+		n = typeof e == "string" ? {
+			...t,
+			name: e
+		} : 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 = _e(e);
+		this._sense !== t && (this._sense = t, this.recordModelMutation());
+	}
+	get objectiveExpr() {
+		return this._objectiveExpr.clone();
+	}
+	set objectiveExpr(e) {
+		this.applyObjective(e);
+	}
+	get conflicts() {
+		return this._conflicts ?? this.unsatCore;
+	}
+	set conflicts(e) {
+		this._conflicts = e;
+	}
+	get numVars() {
+		return this.variables.length;
+	}
+	get numConstrs() {
+		return this.constraints.length;
+	}
+	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._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;
+		}
+	}
+	recordModelMutation() {
+		if (this.batchDepth > 0) {
+			this.batchMutated = !0;
+			return;
+		}
+		this.modelRevision++, this.clearSolutionFields();
+	}
+	notifyMutation() {
+		this.recordModelMutation();
+	}
+	resetSolutionState() {
+		this.recordModelMutation();
+	}
+	runTransactionalBatch(e) {
+		if (this.batchDepth > 0) return e();
+		let t = this.variables.length, n = this.boolVars.length, r = this.constraints.length, i = this.logicalConstraints.length, a = new Map(this.varPrefixCounters), o = new Map(this.boolVarPrefixCounters), s = new Map(this.constrPrefixCounters), c = this.logicalConstrCounter;
+		this.batchDepth = 1, this.batchMutated = !1, this.batchUndoActions = [];
+		try {
+			let t = e();
+			this.batchDepth = 0;
+			let n = this.batchMutated;
+			return this.batchMutated = !1, this.batchUndoActions = [], n && this.recordModelMutation(), t;
+		} catch (e) {
+			this.batchDepth = 0, this.batchMutated = !1;
+			for (let e = t; e < this.variables.length; e++) {
+				let t = this.variables[e];
+				this.varMapByName.delete(t.name), t.ownerModel = null, g(t, this);
+			}
+			this.variables.length = t;
+			for (let e = n; e < this.boolVars.length; e++) {
+				let t = this.boolVars[e];
+				this.boolVarMapByName.delete(t.name);
+			}
+			this.boolVars.length = n;
+			for (let e = r; e < this.constraints.length; e++) {
+				let t = this.constraints[e];
+				this.constrMapByName.delete(t.name);
+			}
+			this.constraints.length = r;
+			for (let e = i; e < this.logicalConstraints.length; e++) {
+				let t = this.logicalConstraints[e];
+				this.logicalConstrMapByName.delete(t.name);
+			}
+			this.logicalConstraints.length = i;
+			for (let e = this.batchUndoActions.length - 1; e >= 0; e--) this.batchUndoActions[e]();
+			throw this.batchUndoActions = [], this.varPrefixCounters = a, this.boolVarPrefixCounters = o, this.constrPrefixCounters = s, this.logicalConstrCounter = c, e;
+		}
+	}
+	createDomainVars(e, t, n, r) {
+		let i = e.toLowerCase(), a = typeof t == "number", o = typeof n == "number", s = Z(t), c = Z(n);
+		if (o || c) {
+			if (a && $(t, i), o && $(n, i), !a && !s || r !== void 0 && !Q(r)) throw Error(`Invalid arguments provided for ${i} variable creation`);
+			let c = a ? Array.from({ length: t }, (e, t) => t) : Array.from(t), l = o ? Array.from({ length: n }, (e, t) => t) : n === t ? c : Array.from(n), u = r || {}, d = u.prefix || u.name || "x";
+			return this.runTransactionalBatch(() => {
+				let t = a ? [] : {};
+				for (let n of c) {
+					let r = o ? [] : {};
+					for (let t of l) r[t] = this.addVar({
+						...u,
+						type: e,
+						name: `${d}_${n}_${t}`
+					});
+					t[n] = r;
+				}
+				return t;
+			});
+		}
+		if (typeof t == "string" || t === void 0) {
+			if (n !== void 0 && !Q(n)) throw Error(`Invalid arguments provided for ${i} variable creation`);
+			let r = n || {}, a = typeof t == "string" ? t : r.name;
+			return this.addVar({
+				...r,
+				type: e,
+				name: a
+			});
+		}
+		if (Q(t)) {
+			if (n !== void 0) throw Error(`Invalid arguments provided for ${i} variable creation`);
+			let r = t;
+			return this.addVar({
+				...r,
+				type: e
+			});
+		}
+		if (n !== void 0 && !Q(n)) throw Error(`Invalid arguments provided for ${i} variable creation`);
+		let l = n || {}, u = l.prefix || l.name;
+		if (typeof t == "number") return $(t, i), this.runTransactionalBatch(() => {
+			let n = [], r = u || "x";
+			for (let i = 0; i < t; i++) n.push(this.addVar({
+				...l,
+				type: e,
+				name: void 0,
+				prefix: r
+			}));
+			return n;
+		});
+		if (Z(t)) return this.runTransactionalBatch(() => {
+			let n = {};
+			for (let r of t) {
+				let t = u ? `${u}_${r}` : `${r}`;
+				n[r] = this.addVar({
+					...l,
+					type: e,
+					name: t
+				});
+			}
+			return n;
+		});
+		throw Error(`Invalid arguments provided for ${i} variable creation`);
+	}
+	binary(e, t, n) {
+		return this.createDomainVars("Binary", e, t, n);
+	}
+	integer(e, t, n) {
+		return this.createDomainVars("Integer", e, t, n);
+	}
+	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) {
+			if (r && $(e, "boolean"), i && $(t, "boolean"), !r && !a || n !== void 0 && !Q(n)) throw Error("Invalid arguments provided for boolean variable creation");
+			let o = r ? Array.from({ length: e }, (e, t) => t) : Array.from(e), s = i ? Array.from({ length: t }, (e, t) => t) : t === e ? o : Array.from(t), c = n || {}, l = c.prefix || c.name || "p";
+			return this.runTransactionalBatch(() => {
+				let e = r ? [] : {};
+				for (let t of o) {
+					let n = i ? [] : {};
+					for (let e of s) n[e] = this.createBoolVar(`${l}_${t}_${e}`);
+					e[t] = n;
+				}
+				return e;
+			});
+		}
+		if (typeof e == "string" || e === void 0) {
+			if (t !== void 0 && !Q(t)) throw Error("Invalid arguments provided for boolean variable creation");
+			let n = t || {}, r = typeof e == "string" ? e : n.name;
+			return this.createBoolVar(r, n.prefix);
+		}
+		if (Q(e)) {
+			if (t !== void 0) throw Error("Invalid arguments provided for boolean variable creation");
+			let n = e;
+			return this.createBoolVar(n.name, n.prefix);
+		}
+		if (t !== void 0 && !Q(t)) throw Error("Invalid arguments provided for boolean variable creation");
+		let s = t || {}, c = s.prefix || s.name;
+		if (typeof e == "number") return $(e, "boolean"), this.runTransactionalBatch(() => {
+			let t = [], n = c || "p";
+			for (let r = 0; r < e; r++) t.push(this.createBoolVar(void 0, n));
+			return t;
+		});
+		if (Z(e)) return this.runTransactionalBatch(() => {
+			let t = {};
+			for (let n of e) {
+				let e = c ? `${c}_${n}` : `${n}`;
+				t[n] = this.createBoolVar(e);
+			}
+			return t;
+		});
 		throw Error("Invalid arguments provided for boolean variable creation");
 	}
 	hasVarName(e) {
 		return this.varMapByName.has(e) || this.boolVarMapByName.has(e);
 	}
+	getNextVarName(e) {
+		let t = this.varPrefixCounters.get(e) ?? 0, n = `${e}_${t}`;
+		for (; this.hasVarName(n);) t++, n = `${e}_${t}`;
+		return this.varPrefixCounters.set(e, t + 1), n;
+	}
 	getNextBoolVarName(e) {
 		let t = this.boolVarPrefixCounters.get(e) ?? 0, n = `${e}_${t}`;
-		for (; this.hasVarName(n);) t++, n = `${e}_${t}`;
+		for (; this.hasVarName(n) || this.hasConstraintName(n);) t++, n = `${e}_${t}`;
 		return this.boolVarPrefixCounters.set(e, t + 1), n;
 	}
-	createBoolVar(e) {
-		let t = typeof e == "string" ? e.trim() : void 0, r = t && t.length > 0 ? t : this.getNextBoolVarName("p");
-		if (this.hasVarName(r)) throw Error(`Variable with name '${r}' already exists in model`);
-		let i = new n(r);
-		return this.boolVars.push(i), this.boolVarMapByName.set(i.name, i), i;
+	hasConstraintName(e) {
+		return this.constrMapByName.has(e) || this.logicalConstrMapByName.has(e);
+	}
+	hasBoolVarName(e) {
+		return this.boolVarMapByName.has(e);
+	}
+	getNextConstrName(e = "c") {
+		let t = this.constrPrefixCounters.get(e) ?? 1, n = `${e}_${t}`;
+		for (; this.hasConstraintName(n) || this.hasBoolVarName(n);) t++, n = `${e}_${t}`;
+		return this.constrPrefixCounters.set(e, t + 1), n;
+	}
+	getNextLogicalConstrName() {
+		let e = this.logicalConstrCounter + 1, t = `lc_${e}`;
+		for (; this.hasConstraintName(t) || this.hasBoolVarName(t);) e++, t = `lc_${e}`;
+		return this.logicalConstrCounter = e, t;
+	}
+	createBoolVar(e, t) {
+		let n = typeof e == "string" ? e.trim() : void 0, r = typeof t == "string" ? t.trim() : "", i = r.length > 0 ? r : "p", a = n && n.length > 0 ? n : this.getNextBoolVarName(i);
+		if (this.hasVarName(a)) throw Error(`Variable with name '${a}' already exists in model`);
+		if (this.hasConstraintName(a)) throw Error(`Boolean variable name '${a}' conflicts with an existing constraint in model`);
+		let s = new o(a);
+		return this.boolVars.push(s), this.boolVarMapByName.set(s.name, s), this.recordModelMutation(), s;
 	}
 	addVar(e) {
-		let t = e || {}, n = typeof t.name == "string" ? t.name.trim() : void 0, r = n && n.length > 0 ? n : void 0, i = new M({
-			...t,
-			name: r
-		});
-		if (this.hasVarName(i.name)) throw Error(`Variable with name '${i.name}' already exists in model`);
-		return this.variables.push(i), this.varMapByName.set(i.name, i), i;
+		let t = e || {}, n = typeof t.name == "string" ? t.name.trim() : void 0, r = n && n.length > 0 ? n : void 0, i = typeof t.prefix == "string" ? t.prefix.trim() : "", a = i.length > 0 ? i : "x", o = this.varPrefixCounters.get(a), s = r ?? this.getNextVarName(a);
+		try {
+			if (this.hasVarName(s)) throw Error(`Variable with name '${s}' already exists in model`);
+			let e = new b({
+				...t,
+				name: s,
+				prefix: a
+			});
+			return e.hasExplicitName = r !== void 0, d(e), m(e, this), e.ownerModel = this, this.variables.push(e), this.varMapByName.set(e.name, e), this.recordModelMutation(), e;
+		} catch (e) {
+			throw r === void 0 && (o === void 0 ? this.varPrefixCounters.delete(a) : this.varPrefixCounters.set(a, o)), e;
+		}
 	}
 	getVarByName(e) {
 		return this.varMapByName.get(e);
@@ -1140,28 +2150,46 @@ var $ = class {
 	getConstraintByName(e) {
 		return this.constrMapByName.get(e);
 	}
-	setObjective(e, t) {
-		if (e instanceof c) throw Error("Cannot set objective to a constraint comparison (<=, >=, ==). Did you mean to use m.constrain(expr`... <= ...`)? For objectives, supply an unconstrained expression like expr`45 * ${x} + 80 * ${y}`.");
-		t && (this.sense = T(t)), this.objective = typeof e == "string" ? P(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new O(/* @__PURE__ */ new Map(), e) : e instanceof D || "terms" in e ? e.clone() : new O(/* @__PURE__ */ new Map([[e, 1]]), 0);
-	}
-	maximize(e) {
-		this.setObjective(e, "Maximize");
-	}
-	minimize(e) {
-		this.setObjective(e, "Minimize");
-	}
-	constrain(e, t) {
-		if (Array.isArray(e)) {
-			for (let t of e) this.constrain(t);
+	getLogicalConstraintByName(e) {
+		return this.logicalConstrMapByName.get(e);
+	}
+	objective(e) {
+		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`... <= ...`)? 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();
+		else if (typeof e == "object" && e && "quadTerms" in e && e.quadTerms instanceof Map && "linearTerms" in e && e.linearTerms instanceof Map && typeof e.constant == "number") {
+			let t = e;
+			r = new A(t.linearTerms, t.quadTerms, t.constant);
+		} else if (typeof e == "object" && e && "terms" in e && e.terms instanceof Map && typeof e.constant == "number") {
+			let t = e;
+			r = new j(t.terms, t.constant);
+		} else if (e instanceof b || typeof e == "object" && e && "id" in e && "name" in e && "lb" in e && "ub" in e) r = new j(/* @__PURE__ */ new Map([[e, 1]]), 0);
+		else throw Error("Invalid objective expression: expected a finite number, Var, LinExpr, QuadExpr, or arithmetic expression string.");
+		ee(r, this.name, (e) => this.varMapByName.get(e.name) === e), this._sense = n, this._objectiveExpr = r, this.recordModelMutation();
+	}
+	constraint(e, t) {
+		if (Array.isArray(e)) return this.runTransactionalBatch(() => {
+			for (let t of e) this.constraint(t);
 			return this;
-		}
-		if (e instanceof D) throw Error("Cannot add a quadratic expression without a comparison operator (<=, >=, ==) as a constraint. Quadratic constraints are not supported (only linear constraints are allowed in MILP/LP/QP).");
-		if (e instanceof O) throw Error("Cannot add a linear expression without a comparison operator (<=, >=, ==) as a constraint. Use expr`... <= ...` or .le(), .ge(), .eq().");
+		});
+		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) {
 		if (e == null) return null;
-		if (e instanceof M || e instanceof n) return e.value;
+		if (e instanceof b || e instanceof o) return e.value;
 		if (Array.isArray(e)) return e.map((e) => this.getValues(e));
 		if (typeof e == "object") {
 			let t = {};
@@ -1171,198 +2199,477 @@ var $ = class {
 		return null;
 	}
 	addConstraint(e, t) {
-		if (e instanceof D) throw Error("Cannot add a quadratic expression without a comparison operator (<=, >=, ==) as a constraint. Quadratic constraints are not supported (only linear constraints are allowed in MILP/LP/QP).");
-		if (e instanceof O) throw Error("Cannot add a linear expression without a comparison operator (<=, >=, ==) as a constraint. Use expr`... <= ...` or .le(), .ge(), .eq().");
-		if (e instanceof i) {
-			let n = t || `lc_${this.logicalConstraints.length + 1}`;
-			return this.logicalConstraints.push({
-				name: n,
+		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) {
+				if (this.hasConstraintName(n)) throw Error(`Constraint with name '${n}' already exists in model`);
+				if (this.hasBoolVarName(n)) throw Error(`Constraint name '${n}' conflicts with an existing Boolean variable in model`);
+			}
+			let r = this.logicalConstrCounter, i = n ?? this.getNextLogicalConstrName();
+			try {
+				l(e, i, this.name, (e) => this.varMapByName.get(e.name) === e, (e) => this.boolVarMapByName.get(e.name) === e, this);
+			} catch (e) {
+				throw n === void 0 && (this.logicalConstrCounter = r), e;
+			}
+			O(e, this, this.batchDepth > 0 ? this.batchUndoActions : void 0);
+			let a = {
+				name: i,
 				expr: e
-			}), e;
+			};
+			return this.logicalConstraints.push(a), this.logicalConstrMapByName.set(i, a), this.recordModelMutation(), e;
 		}
-		let n;
-		if (typeof e == "string" ? n = F(e, (e) => this.getVarByName(e), t) : (n = e, t && (n.name = t)), this.constrMapByName.has(n.name)) throw Error(`Constraint with name '${n.name}' already exists in model`);
-		return this.constraints.push(n), this.constrMapByName.set(n.name, n), n;
-	}
-	add(e, t) {
-		if (Array.isArray(e)) {
-			for (let t of e) this.add(t);
-			return this;
+		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) {
+			if (this.hasConstraintName(i)) throw Error(`Constraint with name '${i}' already exists in model`);
+			if (this.hasBoolVarName(i)) throw Error(`Constraint name '${i}' conflicts with an existing Boolean variable in model`);
 		}
-		return e instanceof M ? (this.varMapByName.has(e.name) || (this.variables.push(e), this.varMapByName.set(e.name, e)), this) : (this.addConstraint(e, t), this);
+		let a = this.constrPrefixCounters.get("c"), o = i ?? this.getNextConstrName("c"), s;
+		try {
+			h(n, this.name, (e) => this.varMapByName.get(e.name) === e, o), s = p(n, this);
+		} catch (e) {
+			throw i === void 0 && (a === void 0 ? this.constrPrefixCounters.delete("c") : this.constrPrefixCounters.set("c", a)), e;
+		}
+		let c = n.name, u = n.hasExplicitName, d = n.ownerModel, f = s;
+		return this.batchUndoActions.push(() => {
+			n.ownerModel = d, n._assignModelName(c, u), x(n, this, f);
+		}), 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 (t instanceof D) 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, a = n.M === void 0 ? 1e5 : n.M, o = n.name || `ind_${e.name}_${r.name}`, s = [], { lhs: c, sense: l, rhs: u } = r;
-		if (i === 1) {
-			if (l === "<=" || l === "==") {
-				let t = this.addConstraint(c.add(e.mul(a)).le(u + a), l === "==" ? `${o}_le` : o);
-				s.push(t);
-			}
-			if (l === ">=" || l === "==") {
-				let t = this.addConstraint(c.sub(e.mul(a)).ge(u - a), l === "==" ? `${o}_ge` : o);
-				s.push(t);
-			}
-		} else {
-			if (l === "<=" || l === "==") {
-				let t = this.addConstraint(c.sub(e.mul(a)).le(u), l === "==" ? `${o}_le` : o);
-				s.push(t);
+		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 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");
+			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 ((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 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 = this.addConstraint(c.add(e.mul(a)).ge(u), l === "==" ? `${o}_ge` : o);
-				s.push(t);
+			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 g) h(e, this.name, t, n);
+		} catch (e) {
+			throw s === void 0 ? this.constrPrefixCounters.delete("c") : this.constrPrefixCounters.set("c", s), e;
 		}
-		return s;
+		return this.runTransactionalBatch(() => g.map(([e, t]) => this.addConstraint(e, t)));
 	}
 	toLpString() {
-		let { lpString: e } = B({
+		this.validateIntegrity();
+		let { lpString: e } = C({
 			name: this.name,
 			sense: this.sense,
-			objective: this.objective,
+			objective: this.objectiveExpr,
 			constraints: this.constraints,
 			variables: this.variables
 		});
 		return e;
 	}
-	async optimize(e, t) {
-		let n, r;
-		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function" ? (n = e, r = t || {}) : typeof e == "function" ? (n = new e(t), r = t || {}) : typeof e == "string" ? (n = f(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = f(r.solver, r), delete r.solver) : n = this.solver || f()), this.objective instanceof D && this.objective.quadTerms.size > 0 && n.capabilities?.supportsQP === !1) throw Error(`Solver "${n.name}" does not support quadratic objectives (QP). Please use a QP-capable solver such as HiGHS or Clarabel.`);
-		if (this.logicalConstraints.length > 0 && n.capabilities?.supportsSMT !== !0) throw Error(`Solver "${n.name}" does not support SMT / logical constraints (or, implies, not, xor). Please use an SMT-capable solver such as Z3.`);
-		let i = {
+	validateIntegrity() {
+		k(this);
+	}
+	ensureExecutionValid(e, t, n) {
+		if (this.modelRevision !== e) throw this.activeOperationId === t && this.clearSolutionFields(), Error(`Model "${this.name}" was modified while ${n}() was in progress; stale solver result was discarded.`);
+		if (this.activeOperationId !== t) throw Error(`Stale ${n}() result discarded because a newer solve or check operation was started on model "${this.name}".`);
+	}
+	wrapSolveOptions(e, t, n) {
+		let r = e.onProgress;
+		return r ? {
+			...e,
+			onProgress: (e) => {
+				this.activeOperationId === n && this.modelRevision === t && r(e);
+			}
+		} : e;
+	}
+	hasPrimalFromResult(e) {
+		if (typeof e.hasPrimalSolution == "boolean") return e.hasPrimalSolution;
+		let t = e.status, n = e.terminationStatus ?? t, r = e.values || {}, i = e.boolValues || {};
+		return t !== "Infeasible" && t !== "Unsat" && t !== "Unbounded" && t !== "Error" && t !== "NotSolved" && n !== "Infeasible" && n !== "Unsat" && n !== "Unbounded" && n !== "InfeasibleOrUnbounded" && n !== "Error" && n !== "NotSolved" && (t === "Optimal" || t === "Feasible" || t === "Sat" || n === "Optimal" || n === "Feasible" || n === "Sat" || typeof e.objectiveValue == "number" && Number.isFinite(e.objectiveValue) || Object.values(r).some((e) => typeof e == "number" && Number.isFinite(e) || typeof e == "boolean") || Object.values(i).some((e) => typeof e == "boolean"));
+	}
+	resolveSolverAndOptions(e, t) {
+		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function") {
+			let { solver: n, ...r } = t || {};
+			return {
+				activeSolver: e,
+				activeOptions: r
+			};
+		}
+		if (typeof e == "function") {
+			let { solver: n, ...r } = t || {};
+			return {
+				activeSolver: new e(r),
+				activeOptions: r
+			};
+		}
+		if (typeof e == "string") {
+			let { solver: n, ...r } = t || {};
+			return {
+				activeSolver: D(e, r),
+				activeOptions: r
+			};
+		}
+		let { solver: n, ...r } = e || {};
+		return n ? {
+			activeSolver: D(n, r),
+			activeOptions: r
+		} : {
+			activeSolver: this.solver || D(),
+			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.`);
+		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.objective,
+			objective: this._objectiveExpr,
 			constraints: this.constraints,
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, a = B(i), o = await n.solve(i, a, r);
-		this.runTime = o.runTime ?? 0, this.status = o.status, this.objectiveValue = o.objectiveValue ?? null;
-		let s = {}, c = {}, l = {}, u = {};
-		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;
-		if (a?.nameToVar) for (let e of a.nameToVar.values()) e.value = null, e.reducedCost = null;
-		if (a?.nameToConstraint) for (let e of a.nameToConstraint.values()) e.dual = null, e.slack = null;
-		if (o.values && o.status !== "Infeasible" && o.status !== "Unbounded") {
-			for (let [e, t] of Object.entries(o.values)) if (typeof t == "number" && !Number.isNaN(t)) {
-				this.values.set(e, t);
-				let n = this.getVarByName(e) || a.nameToVar.get(e);
-				n && (n.value = t, s[n.name] = t);
-				let r = this.boolVars.find((t) => t.name === e);
-				r && (r.value = !!t);
+		}, 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 {
+			l = await i.solve(o, c);
+		} catch (e) {
+			throw this.activeOperationId === n && this.clearSolutionFields(), e;
+		}
+		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
+			});
+		}, 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, 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, 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 (o.reducedCosts) for (let [e, t] of Object.entries(o.reducedCosts)) {
-			let n = this.getVarByName(e) || a.nameToVar.get(e);
-			n && (n.reducedCost = t, l[n.name] = t);
+		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 (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, f(h, n.name, t));
 		}
-		if (o.duals) for (let [e, t] of Object.entries(o.duals)) {
-			let n = this.getConstraintByName(e) || a.nameToConstraint.get(e);
-			n && (n.dual = t, c[n.name] = t);
+		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, f(m, n.name, t));
 		}
-		if (o.slacks) for (let [e, t] of Object.entries(o.slacks)) {
-			let n = this.getConstraintByName(e) || a.nameToConstraint.get(e);
-			n && (n.slack = t, u[n.name] = t);
+		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, f(g, n.name, t));
 		}
 		return this.solution = {
 			status: this.status,
+			terminationStatus: this.terminationStatus,
+			hasPrimalSolution: this.hasPrimalSolution,
 			objectiveValue: this.objectiveValue,
-			values: s,
-			duals: c,
-			reducedCosts: l,
-			slacks: u,
+			...this.objectiveBound === void 0 ? {} : { objectiveBound: this.objectiveBound },
+			...this.relGap === void 0 ? {} : {
+				relGap: this.relGap,
+				mipGap: this.mipGap
+			},
+			...this.absGap === void 0 ? {} : { absGap: this.absGap },
+			values: p,
+			duals: m,
+			reducedCosts: h,
+			slacks: g,
 			runTime: this.runTime,
-			raw: o.raw
-		}, this.status;
-	}
-	async solve(e, t) {
-		return this.optimize(e, t);
+			raw: l.raw
+		}, this.hasSolutionState = !0, this.status;
 	}
 	async check(e, t) {
-		let n, r;
-		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function" ? (n = e, r = t || {}) : typeof e == "function" ? (n = new e(t), r = t || {}) : typeof e == "string" ? (n = f(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = f(r.solver, r), delete r.solver) : n = this.solver || f()), this.logicalConstraints.length > 0 && n.capabilities?.supportsSMT !== !0) throw Error(`Solver "${n.name}" does not support SMT / logical constraints (or, implies, not, xor). Please use an SMT-capable solver such as Z3.`);
-		if (typeof n.check == "function") {
-			let e = await n.check({
-				name: this.name,
-				variables: this.variables,
-				boolVars: this.boolVars,
-				constraints: this.constraints,
-				logicalConstraints: this.logicalConstraints
-			}, r);
-			this.status = e.status, this.runTime = e.runTime ?? 0, this.unsatCore = e.unsatCore || [], this.values.clear();
-			for (let e of this.variables) e.value = null;
-			for (let e of this.boolVars) e.value = null;
-			if (e.values && e.status === "Sat") for (let [t, n] of Object.entries(e.values)) {
-				this.values.set(t, n);
-				let e = this.getVarByName(t);
-				e && typeof n == "number" && (e.value = n);
-				let r = this.boolVars.find((e) => e.name === t);
-				r && (r.value = !!n);
+		let n = ++this.activeOperationId, r = this.modelRevision;
+		this.clearSolutionFields(), this.validateIntegrity();
+		let { activeSolver: i, activeOptions: a } = this.resolveSolverAndOptions(e, t);
+		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, {
+				value: n,
+				enumerable: !0,
+				writable: !0,
+				configurable: !0
+			});
+		}, l = {
+			name: this.name,
+			variables: this.variables,
+			boolVars: this.boolVars,
+			constraints: this.constraints,
+			logicalConstraints: this.logicalConstraints
+		};
+		if (typeof i.check == "function") {
+			let e;
+			try {
+				e = await i.check(l, o);
+			} catch (e) {
+				throw this.activeOperationId === n && this.clearSolutionFields(), e;
 			}
-			return e;
-		}
-		let i = this.objective, a = this.sense;
-		try {
-			this.objective = new O(), this.sense = "Minimize";
-			let e = await this.optimize(n, r), t = e === "Optimal" || e === "Feasible", i = e === "Infeasible", a = {};
-			if (t) {
-				for (let e of this.variables) e.value !== null && (a[e.name] = e.value);
-				for (let e of this.boolVars) e.value !== null && (a[e.name] = e.value);
+			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") {
+					if (!Number.isFinite(r)) continue;
+					let e = this.getVarByName(n), i = this.getBoolVarByName(n);
+					e && (e.value = r, this.values.set(e.name, r), s(t, e.name, r)), i && (i.value = !!r, this.values.set(i.name, i.value), s(t, i.name, i.value)), !e && !i && (this.values.set(n, r), s(t, n, r));
+				} else if (typeof r == "boolean") {
+					let e = this.getBoolVarByName(n);
+					e ? (e.value = r, this.values.set(e.name, r), s(t, e.name, r)) : (this.values.set(n, r), s(t, n, r));
+				}
 			}
-			return {
-				status: t ? "Sat" : i ? "Unsat" : "Unknown",
-				values: a,
+			return this.hasSolutionState = !0, {
+				status: e.status,
+				values: t,
+				unsatCore: this.unsatCore,
+				conflicts: this.conflicts,
 				runTime: this.runTime
 			};
-		} finally {
-			this.objective = i, this.sense = a;
 		}
+		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(new Map(p), 0),
+			constraints: d,
+			variables: [...u.variables, ...f]
+		}, _;
+		try {
+			_ = await i.solve(g, o);
+		} catch (e) {
+			throw this.activeOperationId === n && this.clearSolutionFields(), e;
+		}
+		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);
+				}
+			}
+		}
+		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.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 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;
+	}
+	async solveColumnGeneration(e) {
+		let t = await Je({
+			master: this,
+			...e
+		});
+		return this.decomposition = t, t;
 	}
 };
-w(/* @__PURE__ */ S({
-	BoolExpr: () => i,
-	BoolOp: () => o,
-	BoolVar: () => n,
+R(/* @__PURE__ */ he({
+	BoolExpr: () => r,
+	BoolOp: () => n,
+	BoolVar: () => o,
 	Constraint: () => c,
-	HiGHS: () => K,
-	HighsSolver: () => G,
-	LinExpr: () => O,
-	MockSolver: () => X,
-	Model: () => $,
-	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
-	QuadExpr: () => D,
-	Var: () => M,
-	and: () => e,
-	c: () => L,
-	dot: () => A,
-	expr: () => R,
-	generateLpString: () => B,
-	getHighs: () => g,
-	getHighsWasmUrl: () => v,
-	getSolver: () => f,
-	implies: () => a,
-	isValidWasmHeader: () => h,
-	listAvailableSolvers: () => u,
-	mapHighsStatus: () => W,
-	not: () => s,
-	or: () => t,
-	parseConstraint: () => F,
-	parseExpr: () => P,
-	probeWasmUrl: () => p,
-	registerHighsSolver: () => q,
-	registerMockSolver: () => Z,
-	registerSolver: () => d,
-	resolveBrowserWasmUrl: () => _,
-	setDefaultSolver: () => l,
-	setHighsWasmUrl: () => y,
-	solveLp: () => U,
-	solveLpWithHighs: () => m,
-	sum: () => k,
-	xor: () => r
-}), Q);
+	HIGHS_CONSTANTS: () => ie,
+	HIGHS_STATUS_NAMES: () => le,
+	HiGHS: () => G,
+	Highs: () => P,
+	HighsError: () => te,
+	HighsModel: () => se,
+	HighsSolver: () => W,
+	HighsUnsupportedOptionError: () => ae,
+	LinExpr: () => j,
+	MockSolver: () => ze,
+	Model: () => nt,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => ce,
+	QuadExpr: () => A,
+	Var: () => b,
+	and: () => y,
+	bindHighsFunctions: () => ne,
+	buildIndicatorLinearization: () => Y,
+	buildLpSymbolMaps: () => u,
+	deriveBigMForGe: () => J,
+	deriveBigMForLe: () => q,
+	dot: () => s,
+	expr: () => ke,
+	generateLpString: () => C,
+	getHighs: () => oe,
+	getHighsWasmUrl: () => I,
+	getSolver: () => D,
+	implies: () => e,
+	isLpExportResult: () => E,
+	isValidWasmHeader: () => re,
+	linearizeModelForMip: () => Ke,
+	listAvailableSolvers: () => S,
+	mapHighsStatus: () => U,
+	mapHighsTerminationStatus: () => H,
+	maximize: () => Xe,
+	minimize: () => Ze,
+	not: () => v,
+	or: () => i,
+	parseConstraint: () => we,
+	parseExpr: () => Se,
+	probeWasmUrl: () => M,
+	registerHighsSolver: () => K,
+	registerMockSolver: () => Be,
+	registerSolver: () => T,
+	resolveBrowserWasmUrl: () => F,
+	sanitizeIdentifier: () => f,
+	setDefaultSolver: () => _,
+	setHighsWasmUrl: () => L,
+	solveLp: () => V,
+	solveLpWithHighs: () => N,
+	sum: () => t,
+	validateModelIntegrity: () => k,
+	validateModelSolution: () => Ue,
+	validateUserBigM: () => We,
+	xor: () => a
+}), Ve);
 //#endregion
-export { i as BoolExpr, o as BoolOp, n as BoolVar, c as Constraint, K as HiGHS, G as HighsSolver, O as LinExpr, X as MockSolver, $ as Model, b as OFFICIAL_HIGHS_CDN_WASM_URL, D as QuadExpr, M as Var, e as and, L as c, A as dot, R as expr, B as generateLpString, g as getHighs, v as getHighsWasmUrl, f as getSolver, a as implies, h as isValidWasmHeader, u as listAvailableSolvers, T as normalizeSense, s as not, t as or, F as parseConstraint, P as parseExpr, p as probeWasmUrl, d as registerSolver, _ as resolveBrowserWasmUrl, l as setDefaultSolver, y as setHighsWasmUrl, m as solveLpWithHighs, k as sum, r 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 };