@ohtaman/washi 0.3.0 → 0.5.0

package/dist/lib/solvers/glpk.js

@@ -1,8 +1,8 @@
-import { r as e } from "../registry-DksqCSjI.js";
+import { a as e, r as t, s as n } from "../registry-BEfvpZW3.js";
 //#region src/modeler/solvers/glpk/loader.ts
-var t = null, n = null;
-async function r() {
-	if (t) return t;
+var r = null, i = null;
+async function a() {
+	if (r) return r;
 	let e = (async () => {
 		let e = typeof process < "u" && process.versions && process.versions.node && process.type !== "renderer";
 		try {
@@ -12,150 +12,261 @@ async function r() {
 					/* @vite-ignore */
 					"glpk.js/node"
 ), t = await (e.default || e)();
-				return n = t, t;
+				return i = t, t;
 			}
-			let t = await import("glpk.js"), r = await (t.default || t)();
-			return n = r, r;
+			let t = await import("glpk.js"), n = await (t.default || t)();
+			return i = n, n;
 		} catch (e) {
 			throw Error("[WaSHI] Could not load GLPK. Install the optional glpk.js dependency before selecting this solver.", { cause: e });
 		}
 	})();
 	return e.catch(() => {
-		t === e && (t = null, n = null);
-	}), t = e, e;
+		r === e && (r = null, i = null);
+	}), r = e, e;
 }
-function i() {
-	if (n && typeof n.terminate == "function") try {
-		n.terminate();
+function o() {
+	if (i && typeof i.terminate == "function") try {
+		i.terminate();
 	} catch {}
-	n = null, t = null;
+	i = null, r = null;
 }
-function a() {
-	i();
+function s() {
+	o();
 }
 //#endregion
 //#region src/modeler/solvers/glpk/solver.ts
-var o = class e {
+function c(e, t, n) {
+	Object.defineProperty(e, t, {
+		value: n,
+		enumerable: !0,
+		writable: !0,
+		configurable: !0
+	});
+}
+var l = class t {
 	static capabilities = {
 		supportsMIP: !0,
-		supportsQP: !1
+		supportsQP: !1,
+		supportsWarmStart: !1
 	};
 	name = "GLPK";
 	version = "5.0.0";
-	capabilities = e.capabilities;
+	capabilities = t.capabilities;
 	options;
 	constructor(e = {}) {
 		this.options = e;
 	}
-	async solve(e, t, n = {}) {
-		let i = {
+	async solve(t, r, i) {
+		if (t.variables?.some((e) => e.initialValue !== void 0)) throw Error(`Solver "${this.name}" does not support primal initial values (initialValue). Please use a solver with warm-start support such as HiGHS.`);
+		let o = n(r), s = (o ? i : r) ?? {}, l = {
 			...this.options,
-			...n
-		}, a = await r(), { nameToVar: o, nameToConstraint: s } = t, c = /* @__PURE__ */ new Map();
-		for (let [e, t] of o.entries()) c.set(t, e);
-		let l = /* @__PURE__ */ new Map();
-		for (let [e, t] of s.entries()) l.set(t, e);
-		let u = [], d = "linearTerms" in e.objective ? e.objective.linearTerms : e.objective.terms;
-		if (d) for (let [e, t] of d) {
-			if (Math.abs(t) < 1e-12) continue;
-			let n = c.get(e) || e.name;
-			u.push({
+			...s
+		};
+		if (l.signal?.aborted) return {
+			status: "Unknown",
+			terminationStatus: "Interrupted",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {},
+			duals: {},
+			slacks: {},
+			runTime: 0,
+			logs: ["GLPK solve was cancelled before execution."]
+		};
+		let d = await a();
+		if (l.signal?.aborted) return {
+			status: "Unknown",
+			terminationStatus: "Interrupted",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {},
+			duals: {},
+			slacks: {},
+			runTime: 0,
+			logs: ["GLPK solve was cancelled before execution."]
+		};
+		let f, p, m, h;
+		if (o && (r.nameToVar.size > 0 || r.nameToConstraint.size > 0)) {
+			f = r.nameToVar, m = r.nameToConstraint, p = /* @__PURE__ */ new Map();
+			for (let [e, t] of f.entries()) p.set(t, e);
+			h = /* @__PURE__ */ new Map();
+			for (let [e, t] of m.entries()) h.set(t, e);
+		} else ({nameToVar: f, varToName: p, nameToConstraint: m, constraintToName: h} = e(t));
+		let g = [], _ = "linearTerms" in t.objective ? t.objective.linearTerms : t.objective.terms;
+		if (_) for (let [e, t] of _) {
+			if (t === 0) continue;
+			let n = p.get(e) || e.name;
+			g.push({
 				name: n,
 				coef: Number(t)
 			});
 		}
-		let f = [];
-		for (let t of e.constraints) {
-			let e = l.get(t) || t.name || `c_${f.length + 1}`, n = [];
-			for (let [e, r] of t.lhs.terms) {
-				if (Math.abs(r) < 1e-12) continue;
-				let t = c.get(e) || e.name;
+		let v = [];
+		for (let e of t.constraints) {
+			let t = h.get(e) || e.name || `c_${v.length + 1}`, n = [];
+			for (let [t, r] of e.lhs.terms) {
+				if (r === 0) continue;
+				let e = p.get(t) || t.name;
 				n.push({
-					name: t,
+					name: e,
 					coef: Number(r)
 				});
 			}
 			let r;
-			r = t.sense === "==" ? {
-				type: a.GLP_FX,
-				lb: t.rhs,
-				ub: t.rhs
-			} : t.sense === "<=" ? {
-				type: a.GLP_UP,
+			r = e.sense === "==" ? {
+				type: d.GLP_FX,
+				lb: e.rhs,
+				ub: e.rhs
+			} : e.sense === "<=" ? {
+				type: d.GLP_UP,
 				lb: -Infinity,
-				ub: t.rhs
+				ub: e.rhs
 			} : {
-				type: a.GLP_LO,
-				lb: t.rhs,
+				type: d.GLP_LO,
+				lb: e.rhs,
 				ub: Infinity
-			}, f.push({
-				name: e,
+			}, v.push({
+				name: t,
 				vars: n,
 				bnds: r
 			});
 		}
-		let p = [], m = [], h = [];
-		for (let t of e.variables) {
-			let e = c.get(t) || t.name;
-			t.type === "Binary" ? p.push(e) : t.type === "Integer" && m.push(e);
-			let n = t.lb, r = t.ub, i;
-			i = n === -Infinity && r === Infinity ? a.GLP_FR : n !== -Infinity && r === Infinity ? a.GLP_LO : n === -Infinity && r !== Infinity ? a.GLP_UP : n === r ? a.GLP_FX : a.GLP_DB, h.push({
-				name: e,
+		let y = [], b = [], x = [];
+		for (let e of t.variables) {
+			let t = p.get(e) || e.name;
+			e.type === "Binary" ? y.push(t) : e.type === "Integer" && b.push(t);
+			let n = e.lb, r = e.ub, i;
+			i = n === -Infinity && r === Infinity ? d.GLP_FR : n !== -Infinity && r === Infinity ? d.GLP_LO : n === -Infinity && r !== Infinity ? d.GLP_UP : n === r ? d.GLP_FX : d.GLP_DB, x.push({
+				name: t,
 				type: i,
 				lb: n === -Infinity ? 0 : n,
 				ub: r === Infinity ? 0 : r
 			});
 		}
-		let g = {
-			name: e.name || "GLPK_Model",
+		let S = {
+			name: t.name || "GLPK_Model",
 			objective: {
-				direction: e.sense && e.sense.toLowerCase() === "maximize" ? a.GLP_MAX : a.GLP_MIN,
+				direction: t.sense && t.sense.toLowerCase() === "maximize" ? d.GLP_MAX : d.GLP_MIN,
 				name: "obj",
-				vars: u
+				vars: g
 			},
-			subjectTo: f
+			subjectTo: v
 		};
-		h.length > 0 && (g.bounds = h), p.length > 0 && (g.binaries = p), m.length > 0 && (g.generals = m);
-		let _ = {
-			msglev: i.verbose ? a.GLP_MSG_ALL : a.GLP_MSG_OFF,
-			presol: i.presolve !== "off"
+		x.length > 0 && (S.bounds = x), y.length > 0 && (S.binaries = y), b.length > 0 && (S.generals = b);
+		let C = {
+			msglev: l.verbose ? d.GLP_MSG_ALL : d.GLP_MSG_OFF,
+			presol: l.presolve !== "off"
 		};
-		typeof i.timeLimit == "number" && (_.tmlim = i.timeLimit), typeof i.mipGap == "number" && (_.mipgap = i.mipGap);
-		let v = performance.now(), y = await a.solve(g, _), b = (performance.now() - v) / 1e3, x = y?.result?.status, S;
-		if (S = x === a.GLP_OPT ? "Optimal" : x === a.GLP_FEAS ? "Feasible" : x === a.GLP_INFEAS || x === a.GLP_NOFEAS ? "Infeasible" : x === a.GLP_UNBND ? "Unbounded" : "Optimal", S === "Infeasible" || S === "Unbounded") return {
-			status: S,
+		typeof l.timeLimit == "number" && (C.tmlim = l.timeLimit);
+		let w = typeof l.mipGap == "number" ? l.mipGap : typeof l.relGap == "number" ? l.relGap : void 0;
+		w !== void 0 && (C.mipgap = w);
+		let T = typeof t.objective?.constant == "number" && Number.isFinite(t.objective.constant) ? t.objective.constant : 0, E = null;
+		if (T !== 0 && C.presol) {
+			let e = "__washi_obj_const";
+			for (; f.has(e);) e = `_${e}`;
+			E = e, g.push({
+				name: E,
+				coef: T
+			}), x.push({
+				name: E,
+				type: d.GLP_FX,
+				lb: 1,
+				ub: 1
+			}), S.bounds = x;
+		}
+		let D = E === null ? T : 0, O = performance.now(), k = 0;
+		l.onProgress && (C.cb = {
+			each: 1,
+			call: (e) => {
+				k++;
+				let t = e?.z, n = typeof t == "number" && Number.isFinite(t) && Number.isFinite(t + D) ? t + D : void 0, r = (performance.now() - O) / 1e3;
+				l.onProgress?.({
+					elapsedTime: r,
+					elapsedSeconds: r,
+					...n === void 0 ? {} : { objectiveValue: n }
+				});
+			}
+		});
+		let A = await d.solve(S, C), j = (performance.now() - O) / 1e3, M = typeof A?.time == "number" && Number.isFinite(A.time) ? A.time : j, N = A?.result?.status, P = u(N, d);
+		if (P !== "Optimal" && P !== "Feasible") return l.onProgress && k === 0 && l.onProgress({
+			elapsedTime: M,
+			elapsedSeconds: M
+		}), {
+			status: P,
+			terminationStatus: N === (d?.GLP_INFEAS ?? 3) ? "Unknown" : P,
+			hasPrimalSolution: !1,
 			objectiveValue: null,
 			values: {},
 			duals: {},
 			slacks: {},
-			runTime: b,
-			raw: y
+			runTime: M,
+			logs: [`GLPK solve finished with status: ${P}.`],
+			raw: A
 		};
-		let C = y?.result?.z, w = typeof C == "number" ? C + e.objective.constant : null, T = {}, E = y?.result?.vars || {};
-		for (let [e, t] of Object.entries(E)) {
-			let n = o.get(e), r = n ? n.name : e;
-			T[r] = typeof t == "number" ? Math.abs(t) < 1e-9 ? 0 : t : 0;
+		let F = A?.result?.z, I = A?.result?.vars, L = typeof F == "number" && Number.isFinite(F) && Number.isFinite(F + D), R = typeof I == "object" && !!I && !Array.isArray(I), z = {}, B = R;
+		if (R) {
+			for (let [e, t] of Object.entries(I)) {
+				if (e === E) continue;
+				if (typeof t != "number" || !Number.isFinite(t)) {
+					B = !1;
+					break;
+				}
+				let n = f.get(e);
+				c(z, n ? n.name : e, Math.abs(t) < 1e-9 ? 0 : t);
+			}
+			if (B) for (let e of t.variables) {
+				let t = p.get(e) || e.name;
+				if (!Object.prototype.hasOwnProperty.call(I, t) && !Object.prototype.hasOwnProperty.call(I, e.name)) {
+					B = !1;
+					break;
+				}
+			}
 		}
-		for (let t of e.variables) T[t.name] === void 0 && (T[t.name] = 0);
-		let D = {};
-		if (y?.result?.dual) for (let [e, t] of Object.entries(y.result.dual)) {
-			let n = s.get(e), r = n ? n.name : e;
-			D[r] = Number(t);
+		if (!L || !B) return {
+			status: "Error",
+			terminationStatus: "Error",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {},
+			duals: {},
+			slacks: {},
+			runTime: M,
+			logs: [`GLPK reported status ${P} (${String(N)}), but the primal solution payload was missing or malformed.`],
+			raw: A
+		};
+		let V = F + D;
+		l.onProgress && k === 0 && l.onProgress({
+			elapsedTime: M,
+			elapsedSeconds: M,
+			objectiveValue: V
+		});
+		let H = {};
+		if (A?.result?.dual && typeof A.result.dual == "object" && !Array.isArray(A.result.dual)) for (let [e, t] of Object.entries(A.result.dual)) {
+			if (typeof t != "number" || !Number.isFinite(t)) continue;
+			let n = m.get(e);
+			c(H, n ? n.name : e, Math.abs(t) < 1e-9 ? 0 : t);
 		}
 		return {
-			status: S,
-			objectiveValue: w,
-			values: T,
-			duals: D,
-			runTime: y?.time || b,
-			logs: [`GLPK solved in ${(y?.time || b) * 1e3} ms.`],
-			raw: y
+			status: P,
+			terminationStatus: P === "Feasible" ? "Unknown" : P,
+			hasPrimalSolution: !0,
+			objectiveValue: V,
+			values: z,
+			duals: H,
+			runTime: M,
+			logs: [`GLPK solved in ${M * 1e3} ms.`],
+			raw: A
 		};
 	}
 };
-function s() {
-	e("glpk", (e) => new o(e));
+function u(e, t) {
+	if (typeof e != "number") return "Unknown";
+	let n = t?.GLP_OPT ?? 5, r = t?.GLP_FEAS ?? 2, i = t?.GLP_INFEAS ?? 3, a = t?.GLP_NOFEAS ?? 4, o = t?.GLP_UNBND ?? 6;
+	return t?.GLP_UNDEF, e === n ? "Optimal" : e === r ? "Feasible" : e === i || e === a ? "Infeasible" : e === o ? "Unbounded" : "Unknown";
+}
+function d() {
+	t("glpk", (e) => new l(e));
 }
-s();
+d();
 //#endregion
-export { o as GLPKSolver, r as getGlpk, s as registerGLPKSolver, a as resetGlpkCache, i as terminateGlpk };
+export { l as GLPKSolver, a as getGlpk, u as mapGlpkStatus, d as registerGLPKSolver, s as resetGlpkCache, o as terminateGlpk };