@stevenvo780/st-lang 4.5.1 → 4.6.0

package/dist/tests/optimization/ilp.test.js

@@ -0,0 +1,204 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const optimization_1 = require("../../optimization");
+(0, vitest_1.describe)('ILP — Branch-and-bound sobre relajación LP', () => {
+    (0, vitest_1.it)('ILP trivial: max x s.t. x ≤ 5.7, x entero → x = 5', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 5.7 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBe(5);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(5, 6);
+    });
+    (0, vitest_1.it)('ILP knapsack 0-1: 4 items, capacidad 10', () => {
+        // valor:  [10, 40, 30, 50], peso: [5, 4, 6, 3]
+        // capacidad 10. Óptimo conocido: item 2 (peso 4, valor 40) +
+        // item 4 (peso 3, valor 50) + item 1 (peso 5? no, supera). Probemos:
+        //  {2,4}: peso=7, valor=90.   {1,2,4}: 5+4+3=12>10 no.
+        //  {2,3}: 4+6=10, valor=70.   {2,4,3}: 4+3+6=13 no.
+        //  {4,1}: 3+5=8, valor=60.    Mejor: {2,4} con valor 90.
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [10, 40, 30, 50] },
+            constraints: [{ coefficients: [5, 4, 6, 3], operator: '<=', rhs: 10 }],
+            integerVars: [0, 1, 2, 3],
+            binaryVars: [0, 1, 2, 3],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(90, 6);
+        (0, vitest_1.expect)(sol.variables[1]).toBe(1);
+        (0, vitest_1.expect)(sol.variables[3]).toBe(1);
+    });
+    (0, vitest_1.it)('ILP infeasible: 2x = 1, x entero', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [2], operator: '=', rhs: 1 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        // LP relaxation: x=0.5. ILP: ningún entero satisface 2x=1.
+        (0, vitest_1.expect)(sol.status).toBe('infeasible');
+    });
+    (0, vitest_1.it)('ILP con relajación ya entera (B&B inmediato)', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1, 1] },
+            constraints: [
+                { coefficients: [1, 0], operator: '<=', rhs: 3 },
+                { coefficients: [0, 1], operator: '<=', rhs: 4 },
+            ],
+            integerVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBe(3);
+        (0, vitest_1.expect)(sol.variables[1]).toBe(4);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(7, 6);
+        (0, vitest_1.expect)(sol.nodesExplored).toBeGreaterThanOrEqual(1);
+    });
+    (0, vitest_1.it)('ILP: max 5x + 4y s.t. 6x+4y≤24, x+2y≤6, x,y enteros ≥ 0', () => {
+        // Caso clásico. Relajación LP: óptimo en (3, 1.5) con val 21.
+        // ILP: (3,1)=19, (2,2)=18, (4,0)=20. Óptimo: (4,0)=20.
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [5, 4] },
+            constraints: [
+                { coefficients: [6, 4], operator: '<=', rhs: 24 },
+                { coefficients: [1, 2], operator: '<=', rhs: 6 },
+            ],
+            integerVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(20, 5);
+        (0, vitest_1.expect)(sol.variables[0]).toBe(4);
+        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(0, 6);
+    });
+    (0, vitest_1.it)('Assignment problem 3x3 binario', () => {
+        // 3 trabajadores, 3 tareas. Coste c[i][j]. Variables x_ij ∈ {0,1}.
+        // Minimizar Σ c·x s.t. Σ_j x_ij = 1 ∀i, Σ_i x_ij = 1 ∀j.
+        // Matriz coste:
+        //   T1 T2 T3
+        // W1 9  2  7
+        // W2 6  4  3
+        // W3 5  8  1
+        // Asignación óptima: W1→T2 (2), W2→T1 (6), W3→T3 (1) = 9.
+        // Otra: W1→T2, W2→T3, W3→T1 = 2+3+5=10. La primera es mejor.
+        const c = [9, 2, 7, 6, 4, 3, 5, 8, 1]; // x11,x12,x13,x21,x22,x23,x31,x32,x33
+        const ilp = {
+            objective: { kind: 'minimize', coefficients: c },
+            constraints: [
+                // sumas por trabajador = 1
+                { coefficients: [1, 1, 1, 0, 0, 0, 0, 0, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 0, 0, 1, 1, 1, 0, 0, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 0, 0, 0, 0, 0, 1, 1, 1], operator: '=', rhs: 1 },
+                // sumas por tarea = 1
+                { coefficients: [1, 0, 0, 1, 0, 0, 1, 0, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 1, 0, 0, 1, 0, 0, 1, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 0, 1, 0, 0, 1, 0, 0, 1], operator: '=', rhs: 1 },
+            ],
+            integerVars: [0, 1, 2, 3, 4, 5, 6, 7, 8],
+            binaryVars: [0, 1, 2, 3, 4, 5, 6, 7, 8],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp, { maxNodes: 5000, timeoutMs: 15000 });
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(9, 5);
+    });
+    (0, vitest_1.it)('ILP binario simple: max x+y s.t. x+y≤1', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1, 1] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 1 }],
+            integerVars: [0, 1],
+            binaryVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(1, 6);
+        // Solución: una de las dos es 1, la otra 0.
+        const [x, y] = sol.variables;
+        (0, vitest_1.expect)((x === 1 && y === 0) || (x === 0 && y === 1)).toBe(true);
+    });
+    (0, vitest_1.it)('lpRelaxation produce LP válido (sin integerVars)', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [3, 2] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 5 }],
+            integerVars: [0],
+        };
+        const lp = (0, optimization_1.lpRelaxation)(ilp);
+        (0, vitest_1.expect)(lp.objective.coefficients).toEqual([3, 2]);
+        (0, vitest_1.expect)(lp.constraints).toHaveLength(1);
+        // No deberían existir integerVars en LPProblem
+        (0, vitest_1.expect)('integerVars' in lp).toBe(false);
+    });
+    (0, vitest_1.it)('lpRelaxation inyecta cotas [0,1] para binarios', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [10, 20] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 1.5 }],
+            integerVars: [0, 1],
+            binaryVars: [0, 1],
+        };
+        const lp = (0, optimization_1.lpRelaxation)(ilp);
+        (0, vitest_1.expect)(lp.variableBounds?.[0]?.upper).toBe(1);
+        (0, vitest_1.expect)(lp.variableBounds?.[1]?.upper).toBe(1);
+    });
+    (0, vitest_1.it)('ILP reporta nodesExplored ≥ 1', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 3.5 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.nodesExplored).toBeGreaterThanOrEqual(1);
+    });
+    (0, vitest_1.it)('ILP reporta gap = 0 cuando relajación es entera', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 4 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.gap).toBe(0);
+    });
+    (0, vitest_1.it)('ILP set-covering pequeño (3 sets, 4 elementos)', () => {
+        // Cubrir {1,2,3,4} con mínimo número de sets.
+        // S1={1,2}, S2={2,3}, S3={3,4}. Variables x1,x2,x3 binarias.
+        // min x1+x2+x3 s.t.
+        //   x1 ≥ 1 (cubre 1)         → x1 = 1
+        //   x1+x2 ≥ 1 (cubre 2)
+        //   x2+x3 ≥ 1 (cubre 3)
+        //   x3 ≥ 1 (cubre 4)         → x3 = 1
+        // Óptimo: x1=1, x3=1, x2=0. Valor 2.
+        const ilp = {
+            objective: { kind: 'minimize', coefficients: [1, 1, 1] },
+            constraints: [
+                { coefficients: [1, 0, 0], operator: '>=', rhs: 1 },
+                { coefficients: [1, 1, 0], operator: '>=', rhs: 1 },
+                { coefficients: [0, 1, 1], operator: '>=', rhs: 1 },
+                { coefficients: [0, 0, 1], operator: '>=', rhs: 1 },
+            ],
+            integerVars: [0, 1, 2],
+            binaryVars: [0, 1, 2],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(2, 5);
+        (0, vitest_1.expect)(sol.variables[0]).toBe(1);
+        (0, vitest_1.expect)(sol.variables[2]).toBe(1);
+    });
+    (0, vitest_1.it)('ILP rounding gap explícito: max 4x+3y s.t. 3x+2y≤8, x,y enteros', () => {
+        // Relajación: max en (8/3, 0) = 32/3 ≈ 10.67 o (0, 4) = 12. → (0,4)=12 entera.
+        // Pero verificamos otras esquinas: óptimo es (0,4)=12.
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [4, 3] },
+            constraints: [{ coefficients: [3, 2], operator: '<=', rhs: 8 }],
+            integerVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(12, 5);
+    });
+});
+//# sourceMappingURL=ilp.test.js.map

package/dist/tests/optimization/ilp.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ilp.test.js","sourceRoot":"","sources":["../../../src/tests/optimization/ilp.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,qDAA4D;AAG5D,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC9D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,+CAA+C;QAC/C,6DAA6D;QAC7D,qEAAqE;QACrE,uDAAuD;QACvD,oDAAoD;QACpD,yDAAyD;QACzD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;YAC/D,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YACtE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACzB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC3D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,2DAA2D;QAC3D,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,aAAa,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,8DAA8D;QAC9D,uDAAuD;QACvD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACjD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,mEAAmE;QACnE,yDAAyD;QACzD,gBAAgB;QAChB,aAAa;QACb,aAAa;QACb,aAAa;QACb,aAAa;QACb,0DAA0D;QAC1D,6DAA6D;QAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,sCAAsC;QAC7E,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE;YAChD,WAAW,EAAE;gBACX,2BAA2B;gBAC3B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,sBAAsB;gBACtB,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;aACrE;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACxC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACxC,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/D,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACnB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,4CAA4C;QAC5C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,EAAE,CAAC,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,+CAA+C;QAC/C,IAAA,eAAM,EAAC,aAAa,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YACvD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACjE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACnB,CAAC;QACF,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC9D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,aAAa,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC5D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,8CAA8C;QAC9C,6DAA6D;QAC7D,oBAAoB;QACpB,sCAAsC;QACtC,wBAAwB;QACxB,wBAAwB;QACxB,sCAAsC;QACtC,qCAAqC;QACrC,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YACxD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBACnD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBACnD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBACnD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACpD;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACtB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACtB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,+EAA+E;QAC/E,uDAAuD;QACvD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/D,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/optimization/lp.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=lp.test.d.ts.map

package/dist/tests/optimization/lp.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lp.test.d.ts","sourceRoot":"","sources":["../../../src/tests/optimization/lp.test.ts"],"names":[],"mappings":""}

package/dist/tests/optimization/lp.test.js

@@ -0,0 +1,224 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const optimization_1 = require("../../optimization");
+(0, vitest_1.describe)('LP — Simplex de dos fases', () => {
+    (0, vitest_1.it)('LP trivial: max x s.t. x ≤ 5 → x = 5', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 5 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(5, 6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(5, 6);
+    });
+    (0, vitest_1.it)('LP clásico: max 3x+5y s.t. x+y≤6, x≤4, y≤4 → (4,2)=22', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [3, 5] },
+            constraints: [
+                { coefficients: [1, 1], operator: '<=', rhs: 6 },
+                { coefficients: [1, 0], operator: '<=', rhs: 4 },
+                { coefficients: [0, 1], operator: '<=', rhs: 4 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Óptimo en vértice (2,4) ya que 3·2 + 5·4 = 26 > 3·4 + 5·2 = 22.
+        // Recalculamos el caso clásico: max 3x+5y s.t. x+y≤6, x≤4, y≤4
+        // Vértices factibles: (0,0)=0, (4,0)=12, (4,2)=22, (2,4)=26, (0,4)=20.
+        // El óptimo real es (2,4)=26. Ajustamos el assert al óptimo
+        // verdadero del problema (no al del prompt, que tenía un typo).
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(26, 6);
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(2, 6);
+        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(4, 6);
+    });
+    (0, vitest_1.it)('LP minimización: min x+y s.t. x+y≥3, x≥0, y≥0 → (any) = 3', () => {
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [1, 1] },
+            constraints: [{ coefficients: [1, 1], operator: '>=', rhs: 3 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(3, 6);
+    });
+    (0, vitest_1.it)('LP infeasible: x ≤ 1 AND x ≥ 5', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [
+                { coefficients: [1], operator: '<=', rhs: 1 },
+                { coefficients: [1], operator: '>=', rhs: 5 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('infeasible');
+    });
+    (0, vitest_1.it)('LP unbounded: max x sin cota superior', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [-1], operator: '<=', rhs: 0 }], // x ≥ 0
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('unbounded');
+    });
+    (0, vitest_1.it)('LP con igualdad: max x s.t. x+y=4, x≤3, y≥0', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1, 0] },
+            constraints: [
+                { coefficients: [1, 1], operator: '=', rhs: 4 },
+                { coefficients: [1, 0], operator: '<=', rhs: 3 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(3, 6);
+        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(1, 6);
+    });
+    (0, vitest_1.it)('LP dieta clásico (pequeño): min 2x+3y s.t. x+y≥1, x≥0.2, y≥0.3', () => {
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [2, 3] },
+            constraints: [
+                { coefficients: [1, 1], operator: '>=', rhs: 1 },
+                { coefficients: [1, 0], operator: '>=', rhs: 0.2 },
+                { coefficients: [0, 1], operator: '>=', rhs: 0.3 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Óptimo: x=0.7, y=0.3, cost=2·0.7+3·0.3=1.4+0.9=2.3
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(2.3, 5);
+    });
+    (0, vitest_1.it)('LP con variableBounds (upper) actúa como restricción', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [],
+            variableBounds: [{ upper: 7 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(7, 6);
+    });
+    (0, vitest_1.it)('LP con 3 variables y 3 restricciones', () => {
+        // max 4x + 5y + 6z s.t.
+        //  x +  y +  z ≤ 10
+        // 2x +  y +  z ≤ 12
+        //  x + 2y + 3z ≤ 15
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [4, 5, 6] },
+            constraints: [
+                { coefficients: [1, 1, 1], operator: '<=', rhs: 10 },
+                { coefficients: [2, 1, 1], operator: '<=', rhs: 12 },
+                { coefficients: [1, 2, 3], operator: '<=', rhs: 15 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Comprobamos solo factibilidad y consistencia del objetivo
+        const [x, y, z] = sol.variables;
+        (0, vitest_1.expect)(x + y + z).toBeLessThanOrEqual(10 + 1e-6);
+        (0, vitest_1.expect)(2 * x + y + z).toBeLessThanOrEqual(12 + 1e-6);
+        (0, vitest_1.expect)(x + 2 * y + 3 * z).toBeLessThanOrEqual(15 + 1e-6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(4 * x + 5 * y + 6 * z, 6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeGreaterThan(30);
+    });
+    (0, vitest_1.it)('standardForm: minimización pasa a maximización con coefs negados', () => {
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [3, 4] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 10 }],
+        };
+        const std = (0, optimization_1.standardForm)(lp);
+        (0, vitest_1.expect)(std.objective.kind).toBe('maximize');
+        (0, vitest_1.expect)(std.objective.coefficients).toEqual([-3, -4]);
+    });
+    (0, vitest_1.it)('standardForm: ≥ se invierte a ≤ con signos cambiados', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [2], operator: '>=', rhs: 8 }],
+        };
+        const std = (0, optimization_1.standardForm)(lp);
+        (0, vitest_1.expect)(std.constraints[0].operator).toBe('<=');
+        (0, vitest_1.expect)(std.constraints[0].coefficients).toEqual([-2]);
+        (0, vitest_1.expect)(std.constraints[0].rhs).toBe(-8);
+    });
+    (0, vitest_1.it)('standardForm: igualdad se expande a dos restricciones', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '=', rhs: 5 }],
+        };
+        const std = (0, optimization_1.standardForm)(lp);
+        (0, vitest_1.expect)(std.constraints).toHaveLength(2);
+        (0, vitest_1.expect)(std.constraints[0].operator).toBe('<=');
+        (0, vitest_1.expect)(std.constraints[1].operator).toBe('<=');
+    });
+    (0, vitest_1.it)('standardForm preserva solución óptima', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [2, 3] },
+            constraints: [
+                { coefficients: [1, 1], operator: '<=', rhs: 4 },
+                { coefficients: [1, 2], operator: '<=', rhs: 6 },
+            ],
+        };
+        const sol1 = (0, optimization_1.solveLP)(lp);
+        const sol2 = (0, optimization_1.solveLP)((0, optimization_1.standardForm)(lp));
+        (0, vitest_1.expect)(sol1.status).toBe('optimal');
+        (0, vitest_1.expect)(sol2.status).toBe('optimal');
+        (0, vitest_1.expect)(sol1.objectiveValue).toBeCloseTo(sol2.objectiveValue, 6);
+    });
+    (0, vitest_1.it)('LP con iteration_limit retorna status correcto', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1, 1] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 10 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp, { maxIterations: 0 });
+        // Con 0 iteraciones, fase II no puede avanzar; el resultado es
+        // 'iteration_limit' o 'optimal' (si el tableau inicial ya es óptimo).
+        (0, vitest_1.expect)(['optimal', 'iteration_limit']).toContain(sol.status);
+    });
+    (0, vitest_1.it)('LP con coeficientes negativos en objetivo (minimización implícita)', () => {
+        // max -x s.t. x ≥ 0, x ≤ 10 → óptimo en x=0
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [-1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 10 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(0, 6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(0, 6);
+    });
+    (0, vitest_1.it)('LP de transporte chico (4 nodos, factible)', () => {
+        // min c·x s.t. Ax = b (oferta-demanda balanceada).
+        // Oferta: o1=10, o2=15. Demanda: d1=12, d2=13.
+        // Variables: x11, x12, x21, x22.
+        // Coste: 4·x11 + 6·x12 + 5·x21 + 3·x22
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [4, 6, 5, 3] },
+            constraints: [
+                // x11 + x12 = 10 (oferta o1)
+                { coefficients: [1, 1, 0, 0], operator: '=', rhs: 10 },
+                // x21 + x22 = 15 (oferta o2)
+                { coefficients: [0, 0, 1, 1], operator: '=', rhs: 15 },
+                // x11 + x21 = 12 (demanda d1)
+                { coefficients: [1, 0, 1, 0], operator: '=', rhs: 12 },
+                // x12 + x22 = 13 (demanda d2)
+                { coefficients: [0, 1, 0, 1], operator: '=', rhs: 13 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Verificamos factibilidad (sumas) y coste positivo razonable
+        const [x11, x12, x21, x22] = sol.variables;
+        (0, vitest_1.expect)(x11 + x12).toBeCloseTo(10, 5);
+        (0, vitest_1.expect)(x21 + x22).toBeCloseTo(15, 5);
+        (0, vitest_1.expect)(x11 + x21).toBeCloseTo(12, 5);
+        (0, vitest_1.expect)(x12 + x22).toBeCloseTo(13, 5);
+    });
+    (0, vitest_1.it)('LP devuelve iterations >= 0', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1, 2] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 5 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.iterations).toBeGreaterThanOrEqual(0);
+    });
+});
+//# sourceMappingURL=lp.test.js.map

package/dist/tests/optimization/lp.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lp.test.js","sourceRoot":"","sources":["../../../src/tests/optimization/lp.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,qDAA2D;AAG3D,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAC7D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,kEAAkE;QAClE,+DAA+D;QAC/D,uEAAuE;QACvE,4DAA4D;QAC5D,gEAAgE;QAChE,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC7C,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aAC9C;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ;SACxE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC/C,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;gBAClD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;aACnD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,qDAAqD;QACrD,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,EAAE;YACf,cAAc,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;SAC/B,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,wBAAwB;QACxB,oBAAoB;QACpB,oBAAoB;QACpB,oBAAoB;QACpB,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YACxD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACpD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACpD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;aACrD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,4DAA4D;QAC5D,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAC7D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAC5D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,+DAA+D;QAC/D,sEAAsE;QACtE,IAAA,eAAM,EAAC,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,4CAA4C;QAC5C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;YACnD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SAC9D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,mDAAmD;QACnD,+CAA+C;QAC/C,iCAAiC;QACjC,uCAAuC;QACvC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YAC3D,WAAW,EAAE;gBACX,6BAA6B;gBAC7B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,6BAA6B;gBAC7B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,8BAA8B;gBAC9B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,8BAA8B;gBAC9B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;aACvD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,8DAA8D;QAC9D,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/agm.property.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=agm.property.test.d.ts.map

package/dist/tests/properties/agm.property.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agm.property.test.d.ts","sourceRoot":"","sources":["../../../src/tests/properties/agm.property.test.ts"],"names":[],"mappings":""}

package/dist/tests/properties/agm.property.test.js

@@ -0,0 +1,75 @@
+"use strict";
+// ============================================================
+// Property: AGM revise — preserva consistencia si φ es consistente
+// ============================================================
+//
+// ∀ K belief set, φ formula tal que isSatisfiable({φ}) === true:
+//   revise(K, φ) es consistente.
+//
+// (Postulado AGM "consistency preservation": K * φ es consistente
+//  sii φ es consistente.)
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const belief_revision_1 = require("../../belief-revision");
+const belief_revision_2 = require("../../belief-revision");
+const belief_revision_3 = require("../../belief-revision");
+(0, vitest_1.describe)('property: AGM revise consistency preservation', () => {
+    (0, vitest_1.it)('consistent(φ) ⇒ consistent(K * φ)', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.beliefSetAndFormula)(), ({ initial, phi }) => {
+            // φ siempre es un literal o ¬literal, siempre consistente.
+            // Pero validamos por seguridad.
+            let phiSat = false;
+            try {
+                phiSat = (0, belief_revision_2.isSatisfiable)([(0, belief_revision_3.parsePropFormula)(phi)]);
+            }
+            catch {
+                return true; // skip malformed
+            }
+            if (!phiSat)
+                return true; // skip — φ ya inconsistente
+            let K;
+            try {
+                K = (0, belief_revision_1.newBeliefSet)(initial);
+            }
+            catch {
+                return true; // skip — initial inválido
+            }
+            let revised;
+            try {
+                revised = (0, belief_revision_1.revise)(K, phi);
+            }
+            catch {
+                return true; // skip errores de parsing en revise
+            }
+            if (!(0, belief_revision_1.isConsistent)(revised)) {
+                throw new Error(`revise dejó K * φ inconsistente cuando φ es satisfiable. ` +
+                    `initial=[${initial.join(',')}], phi=${phi}, revised=[${[...revised.formulas].join(',')}]`);
+            }
+            return true;
+        }), { numRuns: 200 });
+    });
+    (0, vitest_1.it)('postulate success: φ ∈ K * φ', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.beliefSetAndFormula)(), ({ initial, phi }) => {
+            let K;
+            try {
+                K = (0, belief_revision_1.newBeliefSet)(initial);
+            }
+            catch {
+                return true;
+            }
+            let revised;
+            try {
+                revised = (0, belief_revision_1.revise)(K, phi);
+            }
+            catch {
+                return true;
+            }
+            if (!revised.formulas.has(phi)) {
+                throw new Error(`revise no incluye φ: K=[${[...K.formulas].join(',')}], phi=${phi}, K*phi=[${[...revised.formulas].join(',')}]`);
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=agm.property.test.js.map

package/dist/tests/properties/agm.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agm.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/agm.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mEAAmE;AACnE,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,iCAAiC;AACjC,EAAE;AACF,kEAAkE;AAClE,0BAA0B;;AAE1B,mCAAsC;AACtC,6CAAuD;AACvD,2DAA2E;AAC3E,2DAAsD;AACtD,2DAAyD;AAEzD,IAAA,iBAAQ,EAAC,+CAA+C,EAAE,GAAG,EAAE;IAC7D,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,gCAAmB,GAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;YACtD,2DAA2D;YAC3D,gCAAgC;YAChC,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,GAAG,IAAA,+BAAa,EAAC,CAAC,IAAA,kCAAgB,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,iBAAiB;YAChC,CAAC;YACD,IAAI,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAC,CAAC,4BAA4B;YACtD,IAAI,CAAC,CAAC;YACN,IAAI,CAAC;gBACH,CAAC,GAAG,IAAA,8BAAY,EAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,0BAA0B;YACzC,CAAC;YACD,IAAI,OAAO,CAAC;YACZ,IAAI,CAAC;gBACH,OAAO,GAAG,IAAA,wBAAM,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,oCAAoC;YACnD,CAAC;YACD,IAAI,CAAC,IAAA,8BAAY,EAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CACb,2DAA2D;oBACzD,YAAY,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,cAAc,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAC7F,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,gCAAmB,GAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;YACtD,IAAI,CAAC,CAAC;YACN,IAAI,CAAC;gBACH,CAAC,GAAG,IAAA,8BAAY,EAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,OAAO,CAAC;YACZ,IAAI,CAAC;gBACH,OAAO,GAAG,IAAA,wBAAM,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CACb,2BAA2B,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,YAAY,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAChH,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/anti-unification.property.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=anti-unification.property.test.d.ts.map

package/dist/tests/properties/anti-unification.property.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"anti-unification.property.test.d.ts","sourceRoot":"","sources":["../../../src/tests/properties/anti-unification.property.test.ts"],"names":[],"mappings":""}

package/dist/tests/properties/anti-unification.property.test.js

@@ -0,0 +1,43 @@
+"use strict";
+// ============================================================
+// Property: Anti-unification — generalización correcta
+// ============================================================
+//
+// ∀ términos t1, t2:
+//   lgg(t1, t2)·σL = t1   y   lgg(t1, t2)·σR = t2
+//
+// Es decir, las sustituciones devueltas reconstruyen los términos
+// originales aplicándolas sobre la generalización.
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const anti_unification_1 = require("../../runtime/anti-unification");
+(0, vitest_1.describe)('property: anti-unification reconstruction', () => {
+    (0, vitest_1.it)('substLeft(lgg) === t1 ∧ substRight(lgg) === t2', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.auTerm)(3), (0, generators_1.auTerm)(3), (t1, t2) => {
+            const result = (0, anti_unification_1.antiUnify)(t1, t2);
+            const reconstructedL = (0, anti_unification_1.applySubst)(result.generalization, result.substLeft);
+            const reconstructedR = (0, anti_unification_1.applySubst)(result.generalization, result.substRight);
+            if (!(0, anti_unification_1.termEquals)(reconstructedL, t1)) {
+                throw new Error(`substLeft(lgg) ≠ t1: lgg=${JSON.stringify(result.generalization)}, reconstructedL=${JSON.stringify(reconstructedL)}, t1=${JSON.stringify(t1)}`);
+            }
+            if (!(0, anti_unification_1.termEquals)(reconstructedR, t2)) {
+                throw new Error(`substRight(lgg) ≠ t2: lgg=${JSON.stringify(result.generalization)}, reconstructedR=${JSON.stringify(reconstructedR)}, t2=${JSON.stringify(t2)}`);
+            }
+            return true;
+        }), { numRuns: 200 });
+    });
+    (0, vitest_1.it)('antiUnify(t, t) is structurally t (no fresh vars introducidas)', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.auTerm)(3), (t) => {
+            const result = (0, anti_unification_1.antiUnify)(t, t);
+            if (!(0, anti_unification_1.termEquals)(result.generalization, t)) {
+                throw new Error(`antiUnify(t,t).gen ≠ t: t=${JSON.stringify(t)}, gen=${JSON.stringify(result.generalization)}`);
+            }
+            if (result.variables.length !== 0) {
+                throw new Error(`antiUnify(t,t) introdujo ${result.variables.length} vars frescas`);
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=anti-unification.property.test.js.map

package/dist/tests/properties/anti-unification.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"anti-unification.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/anti-unification.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;AAC/D,EAAE;AACF,qBAAqB;AACrB,kDAAkD;AAClD,EAAE;AACF,kEAAkE;AAClE,mDAAmD;;AAEnD,mCAAsC;AACtC,6CAA0C;AAC1C,qEAIwC;AAExC,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,mBAAM,EAAC,CAAC,CAAC,EAAE,IAAA,mBAAM,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;YAC3C,MAAM,MAAM,GAAG,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACjC,MAAM,cAAc,GAAG,IAAA,6BAAU,EAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3E,MAAM,cAAc,GAAG,IAAA,6BAAU,EAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC5E,IAAI,CAAC,IAAA,6BAAU,EAAC,cAAc,EAAE,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CACb,4BAA4B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,oBAAoB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAChJ,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,IAAA,6BAAU,EAAC,cAAc,EAAE,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CACb,6BAA6B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,oBAAoB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CACjJ,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,mBAAM,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAA,6BAAU,EAAC,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,KAAK,CACb,6BAA6B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAC/F,CAAC;YACJ,CAAC;YACD,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CACb,4BAA4B,MAAM,CAAC,SAAS,CAAC,MAAM,eAAe,CACnE,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/argumentation.property.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=argumentation.property.test.d.ts.map

package/dist/tests/properties/argumentation.property.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"argumentation.property.test.d.ts","sourceRoot":"","sources":["../../../src/tests/properties/argumentation.property.test.ts"],"names":[],"mappings":""}