@stevenvo780/st-lang 4.5.0 → 4.5.2

package/dist/optimization/branch-and-bound.js

@@ -0,0 +1,311 @@
+"use strict";
+// ============================================================
+// Branch-and-bound para Integer Linear Programming.
+// ============================================================
+// Estrategia clásica:
+//   1. Resolver la relajación LP. Si infactible/unbounded, salir.
+//   2. Si la solución LP es entera en `integerVars`, es óptima
+//      del ILP y devolvemos.
+//   3. Elegir la variable entera más fraccional (closest-to-0.5).
+//      Generar dos subproblemas añadiendo x ≤ ⌊x*⌋ y x ≥ ⌈x*⌉ a
+//      las restricciones originales y descender (DFS con pila).
+//   4. Mantener mejor incumbent (mejor entero encontrado). Podar
+//      cuando el bound de la relajación es peor que el incumbent
+//      (más una tolerancia).
+//
+// Para problemas binarios (variables 0/1) las cotas adicionales
+// son innecesarias porque ya están restringidas por
+// `variableBounds`; aún así, la lógica B&B funciona idéntica.
+//
+// Limitación conocida: no detecta optimalidad por GAP=0 sin
+// explorar toda la rama; el `gap` reportado es relativo al
+// bound del root LP.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.lpRelaxation = lpRelaxation;
+exports.solveILP = solveILP;
+const simplex_1 = require("./simplex");
+const DEFAULT_MAX_NODES = 10000;
+const DEFAULT_TIMEOUT_MS = 30000;
+const INTEGER_TOL = 1e-6;
+/**
+ * Genera el LP relajado: descarta integerVars/binaryVars pero
+ * mantiene `variableBounds` (los binarios ya tienen [0,1] ahí).
+ */
+function lpRelaxation(ilp) {
+    // Si hay binarios sin cotas explícitas, las inyectamos.
+    const bounds = ilp.variableBounds
+        ? ilp.variableBounds.map((b) => ({ ...b }))
+        : new Array(ilp.objective.coefficients.length)
+            .fill({})
+            .map(() => ({}));
+    if (ilp.binaryVars) {
+        for (const idx of ilp.binaryVars) {
+            const existing = bounds[idx] ?? {};
+            bounds[idx] = {
+                lower: existing.lower ?? 0,
+                upper: existing.upper !== undefined ? Math.min(existing.upper, 1) : 1,
+            };
+        }
+    }
+    return {
+        objective: {
+            kind: ilp.objective.kind,
+            coefficients: ilp.objective.coefficients.slice(),
+        },
+        constraints: ilp.constraints.map((c) => ({
+            coefficients: c.coefficients.slice(),
+            operator: c.operator,
+            rhs: c.rhs,
+        })),
+        variableBounds: bounds,
+        variableNames: ilp.variableNames ? ilp.variableNames.slice() : undefined,
+    };
+}
+/**
+ * Comprueba qué variable de `integerVars` es la más fraccional en
+ * `x`. Devuelve `-1` si todas son enteras (dentro de la tolerancia).
+ */
+function pickBranchVariable(x, integerVars) {
+    let bestIdx = -1;
+    let bestFrac = -1;
+    for (const i of integerVars) {
+        const v = x[i] ?? 0;
+        const frac = Math.abs(v - Math.round(v));
+        if (frac > INTEGER_TOL && frac > bestFrac) {
+            bestFrac = frac;
+            bestIdx = i;
+        }
+    }
+    return bestIdx;
+}
+/**
+ * Construye un nuevo LP con una restricción adicional sobre la
+ * variable `idx`: si `direction='floor'`, x_idx ≤ value; si
+ * `direction='ceil'`, x_idx ≥ value.
+ */
+function branch(lp, idx, value, direction) {
+    const row = new Array(lp.objective.coefficients.length).fill(0);
+    row[idx] = 1;
+    return {
+        objective: {
+            kind: lp.objective.kind,
+            coefficients: lp.objective.coefficients.slice(),
+        },
+        constraints: [
+            ...lp.constraints.map((c) => ({
+                coefficients: c.coefficients.slice(),
+                operator: c.operator,
+                rhs: c.rhs,
+            })),
+            {
+                coefficients: row,
+                operator: direction === 'floor' ? '<=' : '>=',
+                rhs: value,
+            },
+        ],
+        variableBounds: lp.variableBounds ? lp.variableBounds.map((b) => ({ ...b })) : undefined,
+        variableNames: lp.variableNames ? lp.variableNames.slice() : undefined,
+    };
+}
+/**
+ * ¿La solución LP es entera (en `integerVars`) y respeta los
+ * binarios (en {0,1})?
+ */
+function isIntegerSolution(x, integerVars) {
+    for (const i of integerVars) {
+        const v = x[i] ?? 0;
+        if (Math.abs(v - Math.round(v)) > INTEGER_TOL)
+            return false;
+    }
+    return true;
+}
+/**
+ * Redondea las componentes enteras de `x` (ya verificadas como
+ * casi-enteras) para limpiar ruido numérico.
+ */
+function roundIntegers(x, integerVars) {
+    const out = x.slice();
+    for (const i of integerVars) {
+        const v = out[i];
+        if (v !== undefined)
+            out[i] = Math.round(v);
+    }
+    return out;
+}
+/**
+ * ¿`a` es mejor que `b` según la dirección de optimización?
+ * Para 'maximize': a > b. Para 'minimize': a < b.
+ */
+function isBetter(a, b, kind) {
+    if (kind === 'maximize')
+        return a > b + INTEGER_TOL;
+    return a < b - INTEGER_TOL;
+}
+/**
+ * El bound del nodo (valor LP relajado) ¿puede mejorar al
+ * incumbent? Si no, podamos.
+ */
+function canImprove(bound, incumbent, kind, hasIncumbent) {
+    if (!hasIncumbent)
+        return true;
+    if (kind === 'maximize')
+        return bound > incumbent + INTEGER_TOL;
+    return bound < incumbent - INTEGER_TOL;
+}
+/**
+ * Solver ILP principal. Estrategia DFS con pila explícita.
+ */
+function solveILP(problem, opts = {}) {
+    const maxNodes = opts.maxNodes ?? DEFAULT_MAX_NODES;
+    const timeoutMs = opts.timeoutMs ?? DEFAULT_TIMEOUT_MS;
+    const lpOpts = opts.lpOptions ?? {};
+    const kind = problem.objective.kind;
+    const startTime = Date.now();
+    // integerVars unificado (incluye binarios)
+    const integerVarsSet = new Set(problem.integerVars);
+    if (problem.binaryVars) {
+        for (const b of problem.binaryVars)
+            integerVarsSet.add(b);
+    }
+    const integerVars = Array.from(integerVarsSet);
+    const rootLP = lpRelaxation(problem);
+    const rootSol = (0, simplex_1.solveLP)(rootLP, lpOpts);
+    if (rootSol.status === 'infeasible' || rootSol.status === 'unbounded') {
+        return {
+            ...rootSol,
+            nodesExplored: 1,
+        };
+    }
+    if (rootSol.status === 'iteration_limit') {
+        return {
+            ...rootSol,
+            nodesExplored: 1,
+        };
+    }
+    // Si la relajación ya es entera, listo
+    if (isIntegerSolution(rootSol.variables, integerVars)) {
+        return {
+            ...rootSol,
+            variables: roundIntegers(rootSol.variables, integerVars),
+            nodesExplored: 1,
+            gap: 0,
+        };
+    }
+    let bestValue = kind === 'maximize' ? -Infinity : Infinity;
+    let bestVars = null;
+    let nodesExplored = 1;
+    const rootBound = rootSol.objectiveValue;
+    // Stack para DFS. Cada nodo lleva su LP y el bound padre para
+    // pruning agresivo (la LP de los hijos no puede mejorar al padre).
+    const stack = [{ lp: rootLP, parentBound: rootBound }];
+    while (stack.length > 0) {
+        if (Date.now() - startTime > timeoutMs) {
+            // Timeout: devolvemos el incumbent (si existe) como mejor esfuerzo
+            if (bestVars) {
+                return {
+                    status: 'iteration_limit',
+                    variables: bestVars,
+                    objectiveValue: bestValue,
+                    iterations: 0,
+                    nodesExplored,
+                    gap: Math.abs(rootBound - bestValue),
+                };
+            }
+            return {
+                status: 'iteration_limit',
+                variables: rootSol.variables,
+                objectiveValue: NaN,
+                iterations: rootSol.iterations,
+                nodesExplored,
+            };
+        }
+        if (nodesExplored >= maxNodes) {
+            if (bestVars) {
+                return {
+                    status: 'iteration_limit',
+                    variables: bestVars,
+                    objectiveValue: bestValue,
+                    iterations: 0,
+                    nodesExplored,
+                    gap: Math.abs(rootBound - bestValue),
+                };
+            }
+            return {
+                status: 'iteration_limit',
+                variables: rootSol.variables,
+                objectiveValue: NaN,
+                iterations: rootSol.iterations,
+                nodesExplored,
+            };
+        }
+        const node = stack.pop();
+        if (!node)
+            break;
+        // Pruning preliminar contra el bound del padre
+        if (!canImprove(node.parentBound, bestValue, kind, bestVars !== null)) {
+            continue;
+        }
+        const sol = (0, simplex_1.solveLP)(node.lp, lpOpts);
+        nodesExplored++;
+        if (sol.status === 'infeasible' || sol.status === 'unbounded')
+            continue;
+        if (sol.status === 'iteration_limit')
+            continue;
+        // Pruning por bound: si el LP relajado de este nodo no mejora al
+        // incumbent, podamos.
+        if (!canImprove(sol.objectiveValue, bestValue, kind, bestVars !== null)) {
+            continue;
+        }
+        if (isIntegerSolution(sol.variables, integerVars)) {
+            // Candidato entero. Actualizar incumbent si mejora.
+            if (bestVars === null || isBetter(sol.objectiveValue, bestValue, kind)) {
+                bestValue = sol.objectiveValue;
+                bestVars = roundIntegers(sol.variables, integerVars);
+            }
+            continue;
+        }
+        // Branch
+        const branchIdx = pickBranchVariable(sol.variables, integerVars);
+        if (branchIdx === -1)
+            continue; // todas enteras: ya manejado arriba
+        const value = sol.variables[branchIdx] ?? 0;
+        const floor = Math.floor(value);
+        const ceil = Math.ceil(value);
+        // DFS: empujamos primero el de menor prioridad. Para max,
+        // exploramos primero la rama ceil (suele tener mejor bound).
+        if (kind === 'maximize') {
+            stack.push({
+                lp: branch(node.lp, branchIdx, floor, 'floor'),
+                parentBound: sol.objectiveValue,
+            });
+            stack.push({ lp: branch(node.lp, branchIdx, ceil, 'ceil'), parentBound: sol.objectiveValue });
+        }
+        else {
+            stack.push({ lp: branch(node.lp, branchIdx, ceil, 'ceil'), parentBound: sol.objectiveValue });
+            stack.push({
+                lp: branch(node.lp, branchIdx, floor, 'floor'),
+                parentBound: sol.objectiveValue,
+            });
+        }
+    }
+    if (bestVars === null) {
+        // No se encontró ningún entero factible
+        return {
+            status: 'infeasible',
+            variables: new Array(problem.objective.coefficients.length).fill(0),
+            objectiveValue: NaN,
+            iterations: rootSol.iterations,
+            nodesExplored,
+        };
+    }
+    return {
+        status: 'optimal',
+        variables: bestVars,
+        objectiveValue: bestValue,
+        iterations: rootSol.iterations,
+        nodesExplored,
+        gap: Math.abs(rootBound - bestValue),
+    };
+}
+//# sourceMappingURL=branch-and-bound.js.map

package/dist/optimization/branch-and-bound.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"branch-and-bound.js","sourceRoot":"","sources":["../../src/optimization/branch-and-bound.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oDAAoD;AACpD,+DAA+D;AAC/D,sBAAsB;AACtB,kEAAkE;AAClE,+DAA+D;AAC/D,6BAA6B;AAC7B,kEAAkE;AAClE,gEAAgE;AAChE,gEAAgE;AAChE,iEAAiE;AACjE,iEAAiE;AACjE,6BAA6B;AAC7B,EAAE;AACF,gEAAgE;AAChE,oDAAoD;AACpD,8DAA8D;AAC9D,EAAE;AACF,4DAA4D;AAC5D,2DAA2D;AAC3D,qBAAqB;AACrB,+DAA+D;;AAa/D,oCA+BC;AAsGD,4BAgKC;AAhTD,uCAAoC;AAGpC,MAAM,iBAAiB,GAAG,KAAK,CAAC;AAChC,MAAM,kBAAkB,GAAG,KAAK,CAAC;AACjC,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB;;;GAGG;AACH,SAAgB,YAAY,CAAC,GAAe;IAC1C,wDAAwD;IACxD,MAAM,MAAM,GAA6C,GAAG,CAAC,cAAc;QACzE,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,IAAI,KAAK,CAAqC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC;aAC7E,IAAI,CAAC,EAAE,CAAC;aACR,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvB,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QACnB,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,GAAG;gBACZ,KAAK,EAAE,QAAQ,CAAC,KAAK,IAAI,CAAC;gBAC1B,KAAK,EAAE,QAAQ,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACtE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO;QACL,SAAS,EAAE;YACT,IAAI,EAAE,GAAG,CAAC,SAAS,CAAC,IAAI;YACxB,YAAY,EAAE,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,EAAE;SACjD;QACD,WAAW,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvC,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE;YACpC,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,GAAG,EAAE,CAAC,CAAC,GAAG;SACX,CAAC,CAAC;QACH,cAAc,EAAE,MAAM;QACtB,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS;KACzE,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,CAAW,EAAE,WAAqB;IAC5D,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,IAAI,GAAG,WAAW,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YAC1C,QAAQ,GAAG,IAAI,CAAC;YAChB,OAAO,GAAG,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,EAAa,EAAE,GAAW,EAAE,KAAa,EAAE,SAA2B;IACpF,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACb,OAAO;QACL,SAAS,EAAE;YACT,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI;YACvB,YAAY,EAAE,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,EAAE;SAChD;QACD,WAAW,EAAE;YACX,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC5B,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE;gBACpC,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,GAAG,EAAE,CAAC,CAAC,GAAG;aACX,CAAC,CAAC;YACH;gBACE,YAAY,EAAE,GAAG;gBACjB,QAAQ,EAAE,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;gBAC7C,GAAG,EAAE,KAAK;aACX;SACF;QACD,cAAc,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;QACxF,aAAa,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS;KACvE,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,CAAW,EAAE,WAAqB;IAC3D,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW;YAAE,OAAO,KAAK,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,CAAW,EAAE,WAAqB;IACvD,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,SAAS;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,IAA6B;IACnE,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;IACpD,OAAO,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CACjB,KAAa,EACb,SAAiB,EACjB,IAA6B,EAC7B,YAAqB;IAErB,IAAI,CAAC,YAAY;QAAE,OAAO,IAAI,CAAC;IAC/B,IAAI,IAAI,KAAK,UAAU;QAAE,OAAO,KAAK,GAAG,SAAS,GAAG,WAAW,CAAC;IAChE,OAAO,KAAK,GAAG,SAAS,GAAG,WAAW,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,SAAgB,QAAQ,CAAC,OAAmB,EAAE,OAAmB,EAAE;IACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACpD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,kBAAkB,CAAC;IACvD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;IACpC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,2CAA2C;IAC3C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,WAAW,CAAC,CAAC;IAC5D,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU;YAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE/C,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,IAAA,iBAAO,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,IAAI,OAAO,CAAC,MAAM,KAAK,YAAY,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;QACtE,OAAO;YACL,GAAG,OAAO;YACV,aAAa,EAAE,CAAC;SACjB,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,iBAAiB,EAAE,CAAC;QACzC,OAAO;YACL,GAAG,OAAO;YACV,aAAa,EAAE,CAAC;SACjB,CAAC;IACJ,CAAC;IAED,uCAAuC;IACvC,IAAI,iBAAiB,CAAC,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC,EAAE,CAAC;QACtD,OAAO;YACL,GAAG,OAAO;YACV,SAAS,EAAE,aAAa,CAAC,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC;YACxD,aAAa,EAAE,CAAC;YAChB,GAAG,EAAE,CAAC;SACP,CAAC;IACJ,CAAC;IAED,IAAI,SAAS,GAAG,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC3D,IAAI,QAAQ,GAAoB,IAAI,CAAC;IACrC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC;IAEzC,8DAA8D;IAC9D,mEAAmE;IACnE,MAAM,KAAK,GAA6C,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC;IAEjG,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,SAAS,EAAE,CAAC;YACvC,mEAAmE;YACnE,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO;oBACL,MAAM,EAAE,iBAAiB;oBACzB,SAAS,EAAE,QAAQ;oBACnB,cAAc,EAAE,SAAS;oBACzB,UAAU,EAAE,CAAC;oBACb,aAAa;oBACb,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;iBACrC,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,MAAM,EAAE,iBAAiB;gBACzB,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,cAAc,EAAE,GAAG;gBACnB,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa;aACd,CAAC;QACJ,CAAC;QACD,IAAI,aAAa,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO;oBACL,MAAM,EAAE,iBAAiB;oBACzB,SAAS,EAAE,QAAQ;oBACnB,cAAc,EAAE,SAAS;oBACzB,UAAU,EAAE,CAAC;oBACb,aAAa;oBACb,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;iBACrC,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,MAAM,EAAE,iBAAiB;gBACzB,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,cAAc,EAAE,GAAG;gBACnB,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa;aACd,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI;YAAE,MAAM;QAEjB,+CAA+C;QAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;YACtE,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,IAAA,iBAAO,EAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACrC,aAAa,EAAE,CAAC;QAEhB,IAAI,GAAG,CAAC,MAAM,KAAK,YAAY,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW;YAAE,SAAS;QACxE,IAAI,GAAG,CAAC,MAAM,KAAK,iBAAiB;YAAE,SAAS;QAE/C,iEAAiE;QACjE,sBAAsB;QACtB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;YACxE,SAAS;QACX,CAAC;QAED,IAAI,iBAAiB,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,EAAE,CAAC;YAClD,oDAAoD;YACpD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvE,SAAS,GAAG,GAAG,CAAC,cAAc,CAAC;gBAC/B,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YACvD,CAAC;YACD,SAAS;QACX,CAAC;QAED,SAAS;QACT,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACjE,IAAI,SAAS,KAAK,CAAC,CAAC;YAAE,SAAS,CAAC,oCAAoC;QACpE,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,0DAA0D;QAC1D,6DAA6D;QAC7D,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC;gBAC9C,WAAW,EAAE,GAAG,CAAC,cAAc;aAChC,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC;QAChG,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC;YAC9F,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC;gBAC9C,WAAW,EAAE,GAAG,CAAC,cAAc;aAChC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,wCAAwC;QACxC,OAAO;YACL,MAAM,EAAE,YAAY;YACpB,SAAS,EAAE,IAAI,KAAK,CAAS,OAAO,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3E,cAAc,EAAE,GAAG;YACnB,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,aAAa;SACd,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM,EAAE,SAAS;QACjB,SAAS,EAAE,QAAQ;QACnB,cAAc,EAAE,SAAS;QACzB,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,aAAa;QACb,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;KACrC,CAAC;AACJ,CAAC"}

package/dist/optimization/index.d.ts

@@ -0,0 +1,5 @@
+export type { LPProblem, LPSolution, LPStatus, LPConstraint, LPOptions, ILPProblem, ILPSolution, ILPOptions, ObjectiveKind, ConstraintOperator, } from './types';
+export { solveLP } from './simplex';
+export { solveILP, lpRelaxation } from './branch-and-bound';
+export { standardForm } from './standard-form';
+//# sourceMappingURL=index.d.ts.map

package/dist/optimization/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/optimization/index.ts"],"names":[],"mappings":"AAUA,YAAY,EACV,SAAS,EACT,UAAU,EACV,QAAQ,EACR,YAAY,EACZ,SAAS,EACT,UAAU,EACV,WAAW,EACX,UAAU,EACV,aAAa,EACb,kBAAkB,GACnB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/optimization/index.js

@@ -0,0 +1,20 @@
+"use strict";
+// ============================================================
+// ST Optimization — barrel público.
+// ============================================================
+// API:
+//   solveLP(problem, opts?)   → LPSolution     simplex de dos fases
+//   solveILP(problem, opts?)  → ILPSolution    branch-and-bound
+//   lpRelaxation(ilp)         → LPProblem      relajación continua
+//   standardForm(lp)          → LPProblem      forma estándar
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.standardForm = exports.lpRelaxation = exports.solveILP = exports.solveLP = void 0;
+var simplex_1 = require("./simplex");
+Object.defineProperty(exports, "solveLP", { enumerable: true, get: function () { return simplex_1.solveLP; } });
+var branch_and_bound_1 = require("./branch-and-bound");
+Object.defineProperty(exports, "solveILP", { enumerable: true, get: function () { return branch_and_bound_1.solveILP; } });
+Object.defineProperty(exports, "lpRelaxation", { enumerable: true, get: function () { return branch_and_bound_1.lpRelaxation; } });
+var standard_form_1 = require("./standard-form");
+Object.defineProperty(exports, "standardForm", { enumerable: true, get: function () { return standard_form_1.standardForm; } });
+//# sourceMappingURL=index.js.map

package/dist/optimization/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/optimization/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,OAAO;AACP,oEAAoE;AACpE,gEAAgE;AAChE,mEAAmE;AACnE,8DAA8D;AAC9D,+DAA+D;;;AAe/D,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAChB,uDAA4D;AAAnD,4GAAA,QAAQ,OAAA;AAAE,gHAAA,YAAY,OAAA;AAC/B,iDAA+C;AAAtC,6GAAA,YAAY,OAAA"}

package/dist/optimization/simplex.d.ts

@@ -0,0 +1,8 @@
+import type { LPOptions, LPProblem, LPSolution } from './types';
+/**
+ * Solver LP principal. Acepta el problema en cualquier forma
+ * (min/max, ≤/≥/=, con o sin cotas), lo lleva a standardForm y
+ * ejecuta simplex de dos fases.
+ */
+export declare function solveLP(problem: LPProblem, opts?: LPOptions): LPSolution;
+//# sourceMappingURL=simplex.d.ts.map

package/dist/optimization/simplex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplex.d.ts","sourceRoot":"","sources":["../../src/optimization/simplex.ts"],"names":[],"mappings":"AA8BA,OAAO,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAyRhE;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,GAAE,SAAc,GAAG,UAAU,CA4G5E"}