@stevenvo780/st-lang 4.5.0 → 4.5.2

package/dist/optimization/simplex.js

@@ -0,0 +1,408 @@
+"use strict";
+// ============================================================
+// Simplex de dos fases sobre tableau denso.
+// ============================================================
+// Implementa el método simplex revisado (forma tableau) con Bland's
+// rule para evitar ciclos. Fase 1 construye una solución básica
+// factible (BFS) introduciendo variables artificiales y minimizando
+// su suma; si el óptimo de Fase 1 no es cero, el problema original
+// es infactible. Fase 2 optimiza la función objetivo real partiendo
+// de la BFS obtenida.
+//
+// Convenciones internas (DESPUÉS de pasar por `standardForm`):
+//   - Maximizar c·x s.t. Ax ≤ b, x ≥ 0.
+//   - Añadimos slacks s_i para cada restricción: Ax + Is = b.
+//   - Si algún b_i < 0, multiplicamos la fila por -1 (invierte el
+//     operador). Tras ese arreglo, si una fila no es naturalmente
+//     básica (slack negativo no nos sirve), introducimos artificial
+//     y entramos a Fase 1.
+//
+// El tableau se almacena como Float64Array por filas en un arreglo
+// de length (m+1) * (n+m+a+1), donde m = #restricciones, n = #vars
+// originales, a = #artificiales y la última columna es el RHS. La
+// fila final es el costo reducido (objetivo).
+//
+// Tolerancia numérica: epsilon configurable. Bland's rule selecciona
+// la columna entrante de menor índice con costo reducido > 0
+// (estrictamente). Esto garantiza terminación finita aunque sea más
+// lento que Dantzig en problemas degenerados.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.solveLP = solveLP;
+const standard_form_1 = require("./standard-form");
+const DEFAULT_EPS = 1e-9;
+const DEFAULT_MAX_ITER = 5000;
+function buildTableau(std, _eps) {
+    const m = std.constraints.length;
+    const n = std.objective.coefficients.length;
+    // Detectar filas con RHS negativo y reflejarlas. Aún así, los
+    // slacks no nos darán siempre una BFS positiva (si reflejamos,
+    // el slack queda con coeficiente -1 en su fila, ya no sirve como
+    // básico). En esas filas necesitamos artificial.
+    const rows = [];
+    for (const c of std.constraints) {
+        if (c.operator !== '<=') {
+            throw new Error('buildTableau: se esperaban solo ≤ tras standardForm');
+        }
+        if (c.rhs >= 0) {
+            rows.push({ a: c.coefficients.slice(), b: c.rhs, needsArtificial: false });
+        }
+        else {
+            rows.push({
+                a: c.coefficients.map((v) => -v),
+                b: -c.rhs,
+                needsArtificial: true,
+            });
+        }
+    }
+    const artificialRows = [];
+    for (let i = 0; i < m; i++) {
+        const row = rows[i];
+        if (row && row.needsArtificial)
+            artificialRows.push(i);
+    }
+    const a = artificialRows.length;
+    const ncols = n + m + a + 1; // vars + slacks + artificiales + RHS
+    const T = [];
+    const basis = new Array(m).fill(-1);
+    const artificialCols = [];
+    // Filas del tableau
+    for (let i = 0; i < m; i++) {
+        const row = new Array(ncols).fill(0);
+        const src = rows[i];
+        if (!src)
+            throw new Error('buildTableau: fila no inicializada');
+        for (let j = 0; j < n; j++) {
+            row[j] = src.a[j] ?? 0;
+        }
+        // Slack en columna n + i. Si la fila se reflejó, el "slack"
+        // realmente tiene signo -1 (es un excedente). Para mantener
+        // base inicial limpia, usamos artificial.
+        row[n + i] = src.needsArtificial ? -1 : 1;
+        row[ncols - 1] = src.b;
+        T.push(row);
+        if (!src.needsArtificial) {
+            basis[i] = n + i; // slack como básico inicial
+        }
+    }
+    // Columnas artificiales
+    let artIdx = 0;
+    for (const i of artificialRows) {
+        const col = n + m + artIdx;
+        const rowI = T[i];
+        if (!rowI)
+            throw new Error('buildTableau: fila artificial inexistente');
+        rowI[col] = 1;
+        basis[i] = col;
+        artificialCols.push(col);
+        artIdx++;
+    }
+    // Fila objetivo (placeholder; phase1/phase2 la sobrescriben).
+    T.push(new Array(ncols).fill(0));
+    return { T, basis, ncols, m, n, artificialCols };
+}
+/**
+ * Pivot reducido sobre fila r, columna c. La columna c se vuelve
+ * columna unidad con 1 en la fila r y 0 en las demás (incluida la
+ * fila objetivo, que es la última).
+ */
+function pivot(T, r, c, eps) {
+    const rowR = T[r];
+    if (!rowR)
+        throw new Error('pivot: fila inexistente');
+    const piv = rowR[c];
+    if (piv === undefined || Math.abs(piv) < eps) {
+        throw new Error('pivot: elemento pivote degenerado');
+    }
+    const ncols = rowR.length;
+    // Normalizar fila pivote
+    for (let j = 0; j < ncols; j++) {
+        rowR[j] = (rowR[j] ?? 0) / piv;
+    }
+    // Eliminar columna c en las demás filas
+    for (let i = 0; i < T.length; i++) {
+        if (i === r)
+            continue;
+        const rowI = T[i];
+        if (!rowI)
+            continue;
+        const factor = rowI[c] ?? 0;
+        if (Math.abs(factor) < eps)
+            continue;
+        for (let j = 0; j < ncols; j++) {
+            rowI[j] = (rowI[j] ?? 0) - factor * (rowR[j] ?? 0);
+        }
+    }
+}
+/**
+ * Selecciona la columna entrante con Bland's rule: el menor índice
+ * j tal que el costo reducido z_j - c_j sea estrictamente negativo
+ * (es decir, c_j - z_j > 0 en formulación de maximización; aquí
+ * almacenamos en la última fila el "reduced cost" con signo tal
+ * que <0 significa "entra"). Devuelve -1 si todos son ≥ -eps
+ * (óptimo alcanzado).
+ */
+function selectEnteringBland(state, eps) {
+    const T = state.T;
+    const objRow = T[state.m];
+    if (!objRow)
+        return -1;
+    const limit = state.ncols - 1; // excluye RHS
+    for (let j = 0; j < limit; j++) {
+        if ((objRow[j] ?? 0) < -eps)
+            return j;
+    }
+    return -1;
+}
+/**
+ * Selecciona la fila saliente por la regla del cociente mínimo.
+ * Devuelve -1 si la columna no tiene ningún coeficiente positivo
+ * (problema unbounded).
+ */
+function selectLeaving(state, col, eps) {
+    const T = state.T;
+    let bestRow = -1;
+    let bestRatio = Infinity;
+    for (let i = 0; i < state.m; i++) {
+        const row = T[i];
+        if (!row)
+            continue;
+        const aij = row[col] ?? 0;
+        if (aij > eps) {
+            const ratio = (row[state.ncols - 1] ?? 0) / aij;
+            if (ratio < bestRatio - eps) {
+                bestRatio = ratio;
+                bestRow = i;
+            }
+            else if (Math.abs(ratio - bestRatio) <= eps && bestRow !== -1) {
+                // Bland's tie-break: menor índice de variable básica saliente.
+                const curBasic = state.basis[bestRow] ?? Number.POSITIVE_INFINITY;
+                const newBasic = state.basis[i] ?? Number.POSITIVE_INFINITY;
+                if (newBasic < curBasic)
+                    bestRow = i;
+            }
+        }
+    }
+    return bestRow;
+}
+/**
+ * Ejecuta iteraciones simplex sobre el tableau hasta que no haya
+ * columna entrante (óptimo) o se exceda el límite. Retorna:
+ *  - 'optimal' si terminó normal,
+ *  - 'unbounded' si una columna sin razón positiva fue elegida,
+ *  - 'iteration_limit' si excedió maxIter.
+ */
+function runSimplex(state, maxIter, eps) {
+    let iterations = 0;
+    while (iterations < maxIter) {
+        const col = selectEnteringBland(state, eps);
+        if (col === -1)
+            return { status: 'optimal', iterations };
+        const row = selectLeaving(state, col, eps);
+        if (row === -1)
+            return { status: 'unbounded', iterations };
+        pivot(state.T, row, col, eps);
+        state.basis[row] = col;
+        iterations++;
+    }
+    return { status: 'iteration_limit', iterations };
+}
+/**
+ * Construye la fila objetivo de Fase I: minimizar la suma de las
+ * artificiales (equivalente a maximizar -Σ a_i). En tableau de
+ * maximización, costo reducido z_j - c_j para artificiales debe
+ * ser 0 inicialmente; aplicamos eliminación gaussiana para que la
+ * fila objetivo refleje correctamente la BFS inicial.
+ */
+function setupPhase1Objective(state, eps) {
+    const objRow = state.T[state.m];
+    if (!objRow)
+        throw new Error('phase1: fila objetivo inexistente');
+    for (let j = 0; j < state.ncols; j++)
+        objRow[j] = 0;
+    // Minimizar Σ a_i ≡ maximizar -Σ a_i. En forma "reduced cost <0
+    // entra" para maximización, ponemos +1 en columnas artificiales
+    // (queremos que entren si reducen ese coste). Tras restar las
+    // filas básicas correspondientes, la fila quedará en forma
+    // canónica respecto de la base.
+    for (const col of state.artificialCols) {
+        objRow[col] = 1;
+    }
+    // Convertir a forma canónica: para cada artificial básica en la
+    // fila i, restamos la fila i de la objetivo (eliminando el 1).
+    for (let i = 0; i < state.m; i++) {
+        const basicCol = state.basis[i] ?? -1;
+        if (state.artificialCols.includes(basicCol)) {
+            const rowI = state.T[i];
+            if (!rowI)
+                continue;
+            for (let j = 0; j < state.ncols; j++) {
+                objRow[j] = (objRow[j] ?? 0) - (rowI[j] ?? 0);
+            }
+        }
+    }
+    void eps;
+}
+/**
+ * Construye la fila objetivo de Fase II a partir de la BFS de
+ * Fase I. Maximiza c·x, donde x son las variables originales
+ * (columnas 0..n-1). Pone las artificiales con coste prohibitivo
+ * (lo cual es innecesario si Fase I las dejó en 0; las anulamos).
+ */
+function setupPhase2Objective(state, c, eps) {
+    const objRow = state.T[state.m];
+    if (!objRow)
+        throw new Error('phase2: fila objetivo inexistente');
+    for (let j = 0; j < state.ncols; j++)
+        objRow[j] = 0;
+    // En convención "reduced cost <0 entra" para maximización,
+    // la fila objetivo inicial es -c en las columnas de variables
+    // originales (y 0 en slacks/artificiales).
+    for (let j = 0; j < c.length; j++) {
+        objRow[j] = -(c[j] ?? 0);
+    }
+    // Las artificiales deben evitarse: les ponemos cost reducido
+    // positivo grande. Ya están en base con valor 0 (asumido); si
+    // por degeneración no lo están, los pivots de Fase II no las
+    // elegirán porque su columna no aporta valor real.
+    for (const col of state.artificialCols) {
+        objRow[col] = 1e9;
+    }
+    // Convertir a forma canónica respecto de la base actual.
+    for (let i = 0; i < state.m; i++) {
+        const basicCol = state.basis[i] ?? -1;
+        const coeff = objRow[basicCol] ?? 0;
+        if (Math.abs(coeff) > eps) {
+            const rowI = state.T[i];
+            if (!rowI)
+                continue;
+            for (let j = 0; j < state.ncols; j++) {
+                objRow[j] = (objRow[j] ?? 0) - coeff * (rowI[j] ?? 0);
+            }
+        }
+    }
+}
+/**
+ * Extrae la solución x ∈ ℝⁿ desde el tableau, leyendo cada
+ * variable básica de las filas. Las no básicas valen 0.
+ */
+function extractSolution(state) {
+    const x = new Array(state.n).fill(0);
+    for (let i = 0; i < state.m; i++) {
+        const col = state.basis[i] ?? -1;
+        if (col >= 0 && col < state.n) {
+            const row = state.T[i];
+            if (row)
+                x[col] = row[state.ncols - 1] ?? 0;
+        }
+    }
+    return x;
+}
+/**
+ * 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.
+ */
+function solveLP(problem, opts = {}) {
+    const eps = opts.eps ?? DEFAULT_EPS;
+    const maxIter = opts.maxIterations ?? DEFAULT_MAX_ITER;
+    const n = problem.objective.coefficients.length;
+    // Validaciones rápidas
+    for (const c of problem.constraints) {
+        if (c.coefficients.length !== n) {
+            throw new Error(`solveLP: constraint con ${String(c.coefficients.length)} coefs, esperado ${String(n)}`);
+        }
+    }
+    const wasMinimize = problem.objective.kind === 'minimize';
+    const std = (0, standard_form_1.standardForm)(problem);
+    // standardForm devuelve objective.kind = 'maximize' siempre; los
+    // coeficientes ya están negados si era minimización. Guardamos
+    // wasMinimize para negar el resultado al reportar.
+    const state = buildTableau(std, eps);
+    let totalIterations = 0;
+    // Fase I si hay artificiales
+    if (state.artificialCols.length > 0) {
+        setupPhase1Objective(state, eps);
+        const ph1 = runSimplex(state, maxIter, eps);
+        totalIterations += ph1.iterations;
+        if (ph1.status === 'iteration_limit') {
+            return {
+                status: 'iteration_limit',
+                variables: extractSolution(state),
+                objectiveValue: NaN,
+                iterations: totalIterations,
+            };
+        }
+        // El valor óptimo de Fase I es -RHS de la fila objetivo (negado
+        // por nuestra convención). Si > eps, infactible.
+        const objRow = state.T[state.m];
+        const phase1Val = objRow ? -(objRow[state.ncols - 1] ?? 0) : 0;
+        if (phase1Val > 1e-6) {
+            return {
+                status: 'infeasible',
+                variables: new Array(n).fill(0),
+                objectiveValue: NaN,
+                iterations: totalIterations,
+            };
+        }
+        // Si alguna artificial sigue en base con valor 0, intentamos
+        // pivotearla fuera (no es estrictamente necesario para nuestros
+        // tests pero da estabilidad). Si no se puede (fila degenerada),
+        // continuamos: Fase II la mantendrá con cost prohibitivo.
+        for (let i = 0; i < state.m; i++) {
+            const bc = state.basis[i] ?? -1;
+            if (!state.artificialCols.includes(bc))
+                continue;
+            // buscar columna no artificial con coef ≠ 0
+            const row = state.T[i];
+            if (!row)
+                continue;
+            let swapCol = -1;
+            for (let j = 0; j < state.n + state.m; j++) {
+                if (state.artificialCols.includes(j))
+                    continue;
+                if (Math.abs(row[j] ?? 0) > eps) {
+                    swapCol = j;
+                    break;
+                }
+            }
+            if (swapCol !== -1) {
+                pivot(state.T, i, swapCol, eps);
+                state.basis[i] = swapCol;
+            }
+        }
+    }
+    // Fase II
+    setupPhase2Objective(state, std.objective.coefficients, eps);
+    const ph2 = runSimplex(state, maxIter, eps);
+    totalIterations += ph2.iterations;
+    const x = extractSolution(state);
+    if (ph2.status === 'unbounded') {
+        return {
+            status: 'unbounded',
+            variables: x,
+            objectiveValue: wasMinimize ? -Infinity : Infinity,
+            iterations: totalIterations,
+        };
+    }
+    if (ph2.status === 'iteration_limit') {
+        return {
+            status: 'iteration_limit',
+            variables: x,
+            objectiveValue: NaN,
+            iterations: totalIterations,
+        };
+    }
+    // Valor objetivo respecto del problema original (no el standardForm)
+    let value = 0;
+    for (let j = 0; j < n; j++) {
+        value += (problem.objective.coefficients[j] ?? 0) * (x[j] ?? 0);
+    }
+    return {
+        status: 'optimal',
+        variables: x,
+        objectiveValue: value,
+        iterations: totalIterations,
+    };
+}
+//# sourceMappingURL=simplex.js.map

package/dist/optimization/simplex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplex.js","sourceRoot":"","sources":["../../src/optimization/simplex.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,oEAAoE;AACpE,gEAAgE;AAChE,oEAAoE;AACpE,mEAAmE;AACnE,oEAAoE;AACpE,sBAAsB;AACtB,EAAE;AACF,+DAA+D;AAC/D,wCAAwC;AACxC,8DAA8D;AAC9D,kEAAkE;AAClE,kEAAkE;AAClE,oEAAoE;AACpE,2BAA2B;AAC3B,EAAE;AACF,mEAAmE;AACnE,mEAAmE;AACnE,kEAAkE;AAClE,8CAA8C;AAC9C,EAAE;AACF,qEAAqE;AACrE,6DAA6D;AAC7D,oEAAoE;AACpE,8CAA8C;AAC9C,+DAA+D;;AAiS/D,0BA4GC;AA3YD,mDAA+C;AAG/C,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAiB9B,SAAS,YAAY,CAAC,GAAc,EAAE,IAAY;IAChD,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC;IACjC,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC;IAE5C,8DAA8D;IAC9D,+DAA+D;IAC/D,iEAAiE;IACjE,iDAAiD;IACjD,MAAM,IAAI,GAA2D,EAAE,CAAC;IACxE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;QACzE,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7E,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC;gBACR,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;gBAChC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG;gBACT,eAAe,EAAE,IAAI;aACtB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,IAAI,GAAG,CAAC,eAAe;YAAE,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,qCAAqC;IAClE,MAAM,CAAC,GAAe,EAAE,CAAC;IACzB,MAAM,KAAK,GAAa,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,4DAA4D;QAC5D,4DAA4D;QAC5D,0CAA0C;QAC1C,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC;YACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;QAChD,CAAC;IACH,CAAC;IACD,wBAAwB;IACxB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QACxE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACf,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,EAAE,CAAC;IACX,CAAC;IAED,8DAA8D;IAC9D,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC;AACnD,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,CAAa,EAAE,CAAS,EAAE,CAAS,EAAE,GAAW;IAC7D,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACtD,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,yBAAyB;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACjC,CAAC;IACD,wCAAwC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG;YAAE,SAAS;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAAC,KAAmB,EAAE,GAAW;IAC3D,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAClB,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,cAAc;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,KAAmB,EAAE,GAAW,EAAE,GAAW;IAClE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAClB,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;YAChD,IAAI,KAAK,GAAG,SAAS,GAAG,GAAG,EAAE,CAAC;gBAC5B,SAAS,GAAG,KAAK,CAAC;gBAClB,OAAO,GAAG,CAAC,CAAC;YACd,CAAC;iBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,IAAI,GAAG,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;gBAChE,+DAA+D;gBAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC;gBAClE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC;gBAC5D,IAAI,QAAQ,GAAG,QAAQ;oBAAE,OAAO,GAAG,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CACjB,KAAmB,EACnB,OAAe,EACf,GAAW;IAEX,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,UAAU,GAAG,OAAO,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,mBAAmB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5C,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;QACzD,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;QAC3D,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACvB,UAAU,EAAE,CAAC;IACf,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,iBAAiB,EAAE,UAAU,EAAE,CAAC;AACnD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,KAAmB,EAAE,GAAW;IAC5D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpD,gEAAgE;IAChE,gEAAgE;IAChE,8DAA8D;IAC9D,2DAA2D;IAC3D,gCAAgC;IAChC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IAChE,+DAA+D;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,GAAG,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,KAAmB,EAAE,CAAW,EAAE,GAAW;IACzE,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpD,2DAA2D;IAC3D,8DAA8D;IAC9D,2CAA2C;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,6DAA6D;IAC7D,8DAA8D;IAC9D,6DAA6D;IAC7D,mDAAmD;IACnD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IACD,yDAAyD;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,KAAmB;IAC1C,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG;gBAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,SAAgB,OAAO,CAAC,OAAkB,EAAE,OAAkB,EAAE;IAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,WAAW,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,IAAI,gBAAgB,CAAC;IACvD,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC;IAEhD,uBAAuB;IACvB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CACb,2BAA2B,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,oBAAoB,MAAM,CAAC,CAAC,CAAC,EAAE,CACxF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,OAAO,CAAC,SAAS,CAAC,IAAI,KAAK,UAAU,CAAC;IAC1D,MAAM,GAAG,GAAG,IAAA,4BAAY,EAAC,OAAO,CAAC,CAAC;IAClC,iEAAiE;IACjE,+DAA+D;IAC/D,mDAAmD;IAEnD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,6BAA6B;IAC7B,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,oBAAoB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QAC5C,eAAe,IAAI,GAAG,CAAC,UAAU,CAAC;QAClC,IAAI,GAAG,CAAC,MAAM,KAAK,iBAAiB,EAAE,CAAC;YACrC,OAAO;gBACL,MAAM,EAAE,iBAAiB;gBACzB,SAAS,EAAE,eAAe,CAAC,KAAK,CAAC;gBACjC,cAAc,EAAE,GAAG;gBACnB,UAAU,EAAE,eAAe;aAC5B,CAAC;QACJ,CAAC;QACD,gEAAgE;QAChE,iDAAiD;QACjD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;YACrB,OAAO;gBACL,MAAM,EAAE,YAAY;gBACpB,SAAS,EAAE,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvC,cAAc,EAAE,GAAG;gBACnB,UAAU,EAAE,eAAe;aAC5B,CAAC;QACJ,CAAC;QACD,6DAA6D;QAC7D,gEAAgE;QAChE,gEAAgE;QAChE,0DAA0D;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,SAAS;YACjD,4CAA4C;YAC5C,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;oBAChC,OAAO,GAAG,CAAC,CAAC;oBACZ,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;gBACnB,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;gBAChC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,UAAU;IACV,oBAAoB,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAC5C,eAAe,IAAI,GAAG,CAAC,UAAU,CAAC;IAClC,MAAM,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEjC,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;QAC/B,OAAO;YACL,MAAM,EAAE,WAAW;YACnB,SAAS,EAAE,CAAC;YACZ,cAAc,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;YAClD,UAAU,EAAE,eAAe;SAC5B,CAAC;IACJ,CAAC;IACD,IAAI,GAAG,CAAC,MAAM,KAAK,iBAAiB,EAAE,CAAC;QACrC,OAAO;YACL,MAAM,EAAE,iBAAiB;YACzB,SAAS,EAAE,CAAC;YACZ,cAAc,EAAE,GAAG;YACnB,UAAU,EAAE,eAAe;SAC5B,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,OAAO;QACL,MAAM,EAAE,SAAS;QACjB,SAAS,EAAE,CAAC;QACZ,cAAc,EAAE,KAAK;QACrB,UAAU,EAAE,eAAe;KAC5B,CAAC;AACJ,CAAC"}

package/dist/optimization/standard-form.d.ts

@@ -0,0 +1,11 @@
+import type { LPProblem } from './types';
+/**
+ * Convierte un LPProblem arbitrario a forma estándar:
+ * maximizar c·x sujeto a Ax ≤ b con x ≥ 0 (sin cotas explícitas).
+ * Preserva el sentido original mediante `objective.kind`:
+ * si el original era 'minimize', el resultado lo refleja con
+ * coeficientes negados (el caller debe negar el valor objetivo
+ * al interpretarlo).
+ */
+export declare function standardForm(lp: LPProblem): LPProblem;
+//# sourceMappingURL=standard-form.d.ts.map

package/dist/optimization/standard-form.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard-form.d.ts","sourceRoot":"","sources":["../../src/optimization/standard-form.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEzC;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,SAAS,GAAG,SAAS,CAiFrD"}

package/dist/optimization/standard-form.js

@@ -0,0 +1,112 @@
+"use strict";
+// ============================================================
+// Conversión a forma estándar para simplex.
+// ============================================================
+// El simplex de dos fases que implementamos opera sobre forma
+// estándar de maximización con restricciones ≤ y variables ≥ 0
+// (más slacks que se añaden internamente en el tableau).
+//
+// Reglas de conversión:
+//   - 'minimize c·x'  →  'maximize (-c)·x', se invierte el valor al
+//     final.
+//   - Restricción 'a·x ≥ b'  →  '(-a)·x ≤ -b'.
+//   - Restricción 'a·x = b' se expande a dos restricciones (≤ b y
+//     ≥ b convertida a ≤ -b). La igualdad podría implementarse con
+//     una sola variable artificial en Fase I, pero la duplicación
+//     es estable y suficiente para nuestros tamaños de problema.
+//   - Cotas inferiores l ≠ 0 se trasladan: x = x' + l, con x' ≥ 0.
+//   - Cotas superiores u se vuelven restricciones ≤ u (sobre la
+//     variable trasladada).
+//
+// Esta función devuelve un LPProblem equivalente con SOLO ≤ y
+// objetivo de maximización, sin cotas (todas pasadas a constraints).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.standardForm = standardForm;
+/**
+ * Convierte un LPProblem arbitrario a forma estándar:
+ * maximizar c·x sujeto a Ax ≤ b con x ≥ 0 (sin cotas explícitas).
+ * Preserva el sentido original mediante `objective.kind`:
+ * si el original era 'minimize', el resultado lo refleja con
+ * coeficientes negados (el caller debe negar el valor objetivo
+ * al interpretarlo).
+ */
+function standardForm(lp) {
+    const n = lp.objective.coefficients.length;
+    // Trasladamos cotas inferiores l_i (default 0) sumando l_i a la
+    // variable. Esto produce un offset constante en el objetivo y en
+    // los RHS de las restricciones que el caller necesita reaplicar
+    // al recuperar la solución. Para mantener el API simple, esta
+    // función NO traslada cotas: el solver maneja cotas inferiores
+    // ≠ 0 reescribiendo internamente. Solo expandimos = y ≥ → ≤.
+    const newCoeffs = lp.objective.kind === 'minimize'
+        ? lp.objective.coefficients.map((c) => -c)
+        : lp.objective.coefficients.slice();
+    const newConstraints = [];
+    for (const c of lp.constraints) {
+        if (c.coefficients.length !== n) {
+            throw new Error(`standardForm: constraint con ${String(c.coefficients.length)} coeficientes, esperado ${String(n)}`);
+        }
+        if (c.operator === '<=') {
+            newConstraints.push({
+                coefficients: c.coefficients.slice(),
+                operator: '<=',
+                rhs: c.rhs,
+            });
+        }
+        else if (c.operator === '>=') {
+            newConstraints.push({
+                coefficients: c.coefficients.map((v) => -v),
+                operator: '<=',
+                rhs: -c.rhs,
+            });
+        }
+        else {
+            // '=' → ≤ y ≥ (este último convertido a ≤)
+            newConstraints.push({
+                coefficients: c.coefficients.slice(),
+                operator: '<=',
+                rhs: c.rhs,
+            });
+            newConstraints.push({
+                coefficients: c.coefficients.map((v) => -v),
+                operator: '<=',
+                rhs: -c.rhs,
+            });
+        }
+    }
+    // Añadimos las cotas superiores como restricciones ≤ u.
+    if (lp.variableBounds) {
+        for (let i = 0; i < lp.variableBounds.length; i++) {
+            const b = lp.variableBounds[i];
+            if (!b)
+                continue;
+            if (b.upper !== undefined && Number.isFinite(b.upper)) {
+                const row = new Array(n).fill(0);
+                row[i] = 1;
+                newConstraints.push({ coefficients: row, operator: '<=', rhs: b.upper });
+            }
+            // Cota inferior negativa o positiva ≠ 0: a este nivel del API,
+            // el solver lo maneja como restricción adicional x_i ≥ l_i
+            // (que se convierte a -x_i ≤ -l_i). Si l_i < 0 además
+            // dividimos la variable en x⁺ - x⁻ (no implementado aquí,
+            // el solver lo asume no-negativo por defecto; el lower 0
+            // implícito ya está cubierto por la no-negatividad).
+            if (b.lower !== undefined && b.lower > 0) {
+                const row = new Array(n).fill(0);
+                row[i] = -1;
+                newConstraints.push({ coefficients: row, operator: '<=', rhs: -b.lower });
+            }
+        }
+    }
+    return {
+        objective: {
+            kind: 'maximize',
+            coefficients: newCoeffs,
+        },
+        constraints: newConstraints,
+        variableNames: lp.variableNames ? lp.variableNames.slice() : undefined,
+        // Cotas ya absorbidas en restricciones.
+    };
+}
+//# sourceMappingURL=standard-form.js.map

package/dist/optimization/standard-form.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard-form.js","sourceRoot":"","sources":["../../src/optimization/standard-form.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,8DAA8D;AAC9D,+DAA+D;AAC/D,yDAAyD;AACzD,EAAE;AACF,wBAAwB;AACxB,oEAAoE;AACpE,aAAa;AACb,+CAA+C;AAC/C,kEAAkE;AAClE,mEAAmE;AACnE,kEAAkE;AAClE,iEAAiE;AACjE,mEAAmE;AACnE,gEAAgE;AAChE,4BAA4B;AAC5B,EAAE;AACF,8DAA8D;AAC9D,qEAAqE;AACrE,+DAA+D;;AAY/D,oCAiFC;AAzFD;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAC,EAAa;IACxC,MAAM,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC;IAE3C,gEAAgE;IAChE,iEAAiE;IACjE,gEAAgE;IAChE,8DAA8D;IAC9D,+DAA+D;IAC/D,6DAA6D;IAC7D,MAAM,SAAS,GACb,EAAE,CAAC,SAAS,CAAC,IAAI,KAAK,UAAU;QAC9B,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;IAExC,MAAM,cAAc,GAA6B,EAAE,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CACb,gCAAgC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,2BAA2B,MAAM,CAAC,CAAC,CAAC,EAAE,CACpG,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YACxB,cAAc,CAAC,IAAI,CAAC;gBAClB,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE;gBACpC,QAAQ,EAAE,IAAI;gBACd,GAAG,EAAE,CAAC,CAAC,GAAG;aACX,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC/B,cAAc,CAAC,IAAI,CAAC;gBAClB,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,QAAQ,EAAE,IAAI;gBACd,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG;aACZ,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,2CAA2C;YAC3C,cAAc,CAAC,IAAI,CAAC;gBAClB,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE;gBACpC,QAAQ,EAAE,IAAI;gBACd,GAAG,EAAE,CAAC,CAAC,GAAG;aACX,CAAC,CAAC;YACH,cAAc,CAAC,IAAI,CAAC;gBAClB,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,QAAQ,EAAE,IAAI;gBACd,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG;aACZ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,IAAI,EAAE,CAAC,cAAc,EAAE,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACtD,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACX,cAAc,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,+DAA+D;YAC/D,2DAA2D;YAC3D,sDAAsD;YACtD,0DAA0D;YAC1D,yDAAyD;YACzD,qDAAqD;YACrD,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBACzC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACZ,cAAc,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,SAAS,EAAE;YACT,IAAI,EAAE,UAAU;YAChB,YAAY,EAAE,SAAS;SACxB;QACD,WAAW,EAAE,cAAc;QAC3B,aAAa,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS;QACtE,wCAAwC;KACzC,CAAC;AACJ,CAAC"}

package/dist/optimization/types.d.ts

@@ -0,0 +1,44 @@
+export type ObjectiveKind = 'minimize' | 'maximize';
+export type ConstraintOperator = '<=' | '>=' | '=';
+export interface LPConstraint {
+    coefficients: number[];
+    operator: ConstraintOperator;
+    rhs: number;
+}
+export interface LPProblem {
+    objective: {
+        kind: ObjectiveKind;
+        coefficients: number[];
+    };
+    constraints: LPConstraint[];
+    variableBounds?: Array<{
+        lower?: number;
+        upper?: number;
+    }>;
+    variableNames?: string[];
+}
+export type LPStatus = 'optimal' | 'unbounded' | 'infeasible' | 'iteration_limit';
+export interface LPSolution {
+    status: LPStatus;
+    variables: number[];
+    objectiveValue: number;
+    iterations: number;
+}
+export interface ILPProblem extends LPProblem {
+    integerVars: number[];
+    binaryVars?: number[];
+}
+export interface ILPSolution extends LPSolution {
+    nodesExplored: number;
+    gap?: number;
+}
+export interface LPOptions {
+    maxIterations?: number;
+    eps?: number;
+}
+export interface ILPOptions {
+    maxNodes?: number;
+    timeoutMs?: number;
+    lpOptions?: LPOptions;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/optimization/types.ts"],"names":[],"mappings":"AAaA,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,UAAU,CAAC;AACpD,MAAM,MAAM,kBAAkB,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;AAEnD,MAAM,WAAW,YAAY;IAC3B,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE;QACT,IAAI,EAAE,aAAa,CAAC;QACpB,YAAY,EAAE,MAAM,EAAE,CAAC;KACxB,CAAC;IACF,WAAW,EAAE,YAAY,EAAE,CAAC;IAC5B,cAAc,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3D,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED,MAAM,MAAM,QAAQ,GAAG,SAAS,GAAG,WAAW,GAAG,YAAY,GAAG,iBAAiB,CAAC;AAElF,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,QAAQ,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,UAAW,SAAQ,SAAS;IAC3C,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,WAAY,SAAQ,UAAU;IAC7C,aAAa,EAAE,MAAM,CAAC;IACtB,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,SAAS;IACxB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,SAAS,CAAC;CACvB"}

package/dist/optimization/types.js

@@ -0,0 +1,15 @@
+"use strict";
+// ============================================================
+// Linear / Integer Programming — tipos de borde.
+// ============================================================
+// Un LPProblem describe el problema en forma "natural": objetivo
+// (minimizar o maximizar) + lista de restricciones lineales con
+// operador ≤, ≥ o = y RHS escalar. Las cotas por variable son
+// opcionales (default: x ≥ 0, sin cota superior).
+//
+// Las soluciones reportan estado simbólico ('optimal' | 'unbounded'
+// | 'infeasible' | 'iteration_limit') más el vector de variables en
+// el orden original del problema y el valor objetivo evaluado.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/optimization/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/optimization/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iDAAiD;AACjD,+DAA+D;AAC/D,iEAAiE;AACjE,gEAAgE;AAChE,8DAA8D;AAC9D,kDAAkD;AAClD,EAAE;AACF,oEAAoE;AACpE,oEAAoE;AACpE,+DAA+D;AAC/D,+DAA+D"}