@mostajs/ro-pla 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +102 -0
- package/dist/dialects/anneal.d.ts +14 -0
- package/dist/dialects/anneal.d.ts.map +1 -0
- package/dist/dialects/anneal.js +45 -0
- package/dist/dialects/anneal.js.map +1 -0
- package/dist/dialects/csp.d.ts +14 -0
- package/dist/dialects/csp.d.ts.map +1 -0
- package/dist/dialects/csp.js +47 -0
- package/dist/dialects/csp.js.map +1 -0
- package/dist/dialects/hungarian.d.ts +13 -0
- package/dist/dialects/hungarian.d.ts.map +1 -0
- package/dist/dialects/hungarian.js +79 -0
- package/dist/dialects/hungarian.js.map +1 -0
- package/dist/dialects/lagrangian.d.ts +17 -0
- package/dist/dialects/lagrangian.d.ts.map +1 -0
- package/dist/dialects/lagrangian.js +51 -0
- package/dist/dialects/lagrangian.js.map +1 -0
- package/dist/dialects/markov.d.ts +19 -0
- package/dist/dialects/markov.d.ts.map +1 -0
- package/dist/dialects/markov.js +132 -0
- package/dist/dialects/markov.js.map +1 -0
- package/dist/dialects/mdp.d.ts +13 -0
- package/dist/dialects/mdp.d.ts.map +1 -0
- package/dist/dialects/mdp.js +59 -0
- package/dist/dialects/mdp.js.map +1 -0
- package/dist/dialects/milp.d.ts +15 -0
- package/dist/dialects/milp.d.ts.map +1 -0
- package/dist/dialects/milp.js +94 -0
- package/dist/dialects/milp.js.map +1 -0
- package/dist/dialects/min-cost-flow.d.ts +16 -0
- package/dist/dialects/min-cost-flow.d.ts.map +1 -0
- package/dist/dialects/min-cost-flow.js +94 -0
- package/dist/dialects/min-cost-flow.js.map +1 -0
- package/dist/dialects/mmc.d.ts +17 -0
- package/dist/dialects/mmc.d.ts.map +1 -0
- package/dist/dialects/mmc.js +63 -0
- package/dist/dialects/mmc.js.map +1 -0
- package/dist/dialects/monte-carlo.d.ts +14 -0
- package/dist/dialects/monte-carlo.d.ts.map +1 -0
- package/dist/dialects/monte-carlo.js +35 -0
- package/dist/dialects/monte-carlo.js.map +1 -0
- package/dist/dialects/simplex.d.ts +14 -0
- package/dist/dialects/simplex.d.ts.map +1 -0
- package/dist/dialects/simplex.js +205 -0
- package/dist/dialects/simplex.js.map +1 -0
- package/dist/index.d.ts +25 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +51 -0
- package/dist/index.js.map +1 -0
- package/dist/lib/rng.d.ts +11 -0
- package/dist/lib/rng.d.ts.map +1 -0
- package/dist/lib/rng.js +16 -0
- package/dist/lib/rng.js.map +1 -0
- package/dist/registry.d.ts +21 -0
- package/dist/registry.d.ts.map +1 -0
- package/dist/registry.js +45 -0
- package/dist/registry.js.map +1 -0
- package/dist/types.d.ts +318 -0
- package/dist/types.d.ts.map +1 -0
- package/dist/types.js +11 -0
- package/dist/types.js.map +1 -0
- package/llms.txt +115 -0
- package/package.json +46 -0
|
@@ -0,0 +1,59 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « mdp » (processus de décision markovien)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* MDP fini résolu par ITÉRATION DE LA VALEUR : V(s) ← maxₐ [R(s,a) + γ Σ_s' P(s,a,s') V(s')]
|
|
6
|
+
* jusqu'à convergence, puis extraction de la politique optimale (argmax). « Markov qui décide ».
|
|
7
|
+
*/
|
|
8
|
+
/** Itération de la valeur : renvoie V*, la politique optimale et le nombre d'itérations. */
|
|
9
|
+
export function valueIteration(transition, reward, gamma, epsilon = 1e-9, maxIter = 100000) {
|
|
10
|
+
const n = transition.length;
|
|
11
|
+
let V = new Array(n).fill(0);
|
|
12
|
+
let iterations = 0;
|
|
13
|
+
for (; iterations < maxIter; iterations++) {
|
|
14
|
+
const Vn = new Array(n).fill(0);
|
|
15
|
+
let delta = 0;
|
|
16
|
+
for (let s = 0; s < n; s++) {
|
|
17
|
+
let best = -Infinity;
|
|
18
|
+
for (let a = 0; a < reward[s].length; a++) {
|
|
19
|
+
let q = reward[s][a];
|
|
20
|
+
const ps = transition[s][a];
|
|
21
|
+
for (let sp = 0; sp < n; sp++)
|
|
22
|
+
q += gamma * ps[sp] * V[sp];
|
|
23
|
+
if (q > best)
|
|
24
|
+
best = q;
|
|
25
|
+
}
|
|
26
|
+
Vn[s] = best;
|
|
27
|
+
delta = Math.max(delta, Math.abs(Vn[s] - V[s]));
|
|
28
|
+
}
|
|
29
|
+
V = Vn;
|
|
30
|
+
if (delta < epsilon) {
|
|
31
|
+
iterations++;
|
|
32
|
+
break;
|
|
33
|
+
}
|
|
34
|
+
}
|
|
35
|
+
const policy = new Array(n).fill(0);
|
|
36
|
+
for (let s = 0; s < n; s++) {
|
|
37
|
+
let best = -Infinity;
|
|
38
|
+
for (let a = 0; a < reward[s].length; a++) {
|
|
39
|
+
let q = reward[s][a];
|
|
40
|
+
for (let sp = 0; sp < n; sp++)
|
|
41
|
+
q += gamma * transition[s][a][sp] * V[sp];
|
|
42
|
+
if (q > best) {
|
|
43
|
+
best = q;
|
|
44
|
+
policy[s] = a;
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
}
|
|
48
|
+
return { values: V, policy, iterations };
|
|
49
|
+
}
|
|
50
|
+
/** Dialecte de solveur exposant le MDP (itération de la valeur). */
|
|
51
|
+
export const mdpDialect = {
|
|
52
|
+
name: 'mdp',
|
|
53
|
+
kind: 'decision',
|
|
54
|
+
capabilities: { exact: true, online: false, maxSize: 10000 },
|
|
55
|
+
solve(problem) {
|
|
56
|
+
return valueIteration(problem.transition, problem.reward, problem.gamma, problem.epsilon, problem.maxIter);
|
|
57
|
+
},
|
|
58
|
+
};
|
|
59
|
+
//# sourceMappingURL=mdp.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"mdp.js","sourceRoot":"","sources":["../../src/dialects/mdp.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,4FAA4F;AAC5F,MAAM,UAAU,cAAc,CAAC,UAAwB,EAAE,MAAkB,EAAE,KAAa,EAAE,OAAO,GAAG,IAAI,EAAE,OAAO,GAAG,MAAM;IAC1H,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAC5B,IAAI,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,UAAU,GAAG,OAAO,EAAE,UAAU,EAAE,EAAE,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE;oBAAE,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3D,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACb,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,CAAC,GAAG,EAAE,CAAC;QACP,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;YAAC,UAAU,EAAE,CAAC;YAAC,MAAM;QAAC,CAAC;IAC/C,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE;gBAAE,CAAC,IAAI,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACzE,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AAC3C,CAAC;AAED,oEAAoE;AACpE,MAAM,CAAC,MAAM,UAAU,GAA2C;IAChE,IAAI,EAAE,KAAK;IACX,IAAI,EAAE,UAAU;IAChB,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;IAC5D,KAAK,CAAC,OAAO;QACX,OAAO,cAAc,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IAC7G,CAAC;CACF,CAAC"}
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « branch & bound » (PLNE / MIP)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Programmation linéaire en nombres entiers (mixte) par SÉPARATION & ÉVALUATION :
|
|
6
|
+
* on résout la relaxation continue via le dialecte `simplex`, puis on BRANCHE sur
|
|
7
|
+
* une variable fractionnaire (x ≤ ⌊v⌋ | x ≥ ⌈v⌉) en élaguant les nœuds dont la
|
|
8
|
+
* borne ne peut battre l'incumbent. Exact ; bornable par `maxNodes` (anti-explosion).
|
|
9
|
+
*/
|
|
10
|
+
import type { LpSolution, MilpProblem, SolveOptions, SolverDialect } from '../types.js';
|
|
11
|
+
/** Résout un PLNE/MIP par branch & bound (relaxation LP = simplexe). */
|
|
12
|
+
export declare function branchAndBound(problem: MilpProblem, opts?: SolveOptions): LpSolution;
|
|
13
|
+
/** Dialecte de solveur exposant le branch & bound (PLNE/MIP). */
|
|
14
|
+
export declare const milpDialect: SolverDialect<MilpProblem, LpSolution>;
|
|
15
|
+
//# sourceMappingURL=milp.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"milp.d.ts","sourceRoot":"","sources":["../../src/dialects/milp.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAY,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAMlG,wEAAwE;AACxE,wBAAgB,cAAc,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,YAAY,GAAG,UAAU,CA+DpF;AAED,iEAAiE;AACjE,eAAO,MAAM,WAAW,EAAE,aAAa,CAAC,WAAW,EAAE,UAAU,CAO9D,CAAC"}
|
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « branch & bound » (PLNE / MIP)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Programmation linéaire en nombres entiers (mixte) par SÉPARATION & ÉVALUATION :
|
|
6
|
+
* on résout la relaxation continue via le dialecte `simplex`, puis on BRANCHE sur
|
|
7
|
+
* une variable fractionnaire (x ≤ ⌊v⌋ | x ≥ ⌈v⌉) en élaguant les nœuds dont la
|
|
8
|
+
* borne ne peut battre l'incumbent. Exact ; bornable par `maxNodes` (anti-explosion).
|
|
9
|
+
*/
|
|
10
|
+
import { simplex } from './simplex.js';
|
|
11
|
+
const EPS = 1e-6;
|
|
12
|
+
const isInt = (v) => Math.abs(v - Math.round(v)) <= EPS;
|
|
13
|
+
/** Résout un PLNE/MIP par branch & bound (relaxation LP = simplexe). */
|
|
14
|
+
export function branchAndBound(problem, opts) {
|
|
15
|
+
const sense = problem.objective ?? 'max';
|
|
16
|
+
const n = problem.c.length;
|
|
17
|
+
const intIdx = problem.integers ?? Array.from({ length: n }, (_, j) => j);
|
|
18
|
+
const baseRel = problem.relations ?? problem.A.map(() => '<=');
|
|
19
|
+
const maxNodes = opts?.maxNodes ?? 100_000;
|
|
20
|
+
// Incumbent : initialisé à une borne « pire que tout » ; `found` distingue
|
|
21
|
+
// l'absence de solution entière de la valeur sentinelle (évite un type `| null`).
|
|
22
|
+
let best = { x: [], objective: sense === 'max' ? -Infinity : Infinity };
|
|
23
|
+
let found = false;
|
|
24
|
+
let unbounded = false;
|
|
25
|
+
let nodes = 0;
|
|
26
|
+
// Un nœud = contraintes de branchement supplémentaires (lignes ajoutées à A/b).
|
|
27
|
+
const explore = (addA, addB, addRel) => {
|
|
28
|
+
if (unbounded || nodes >= maxNodes)
|
|
29
|
+
return;
|
|
30
|
+
nodes++;
|
|
31
|
+
const sol = simplex({
|
|
32
|
+
kind: 'lp',
|
|
33
|
+
c: problem.c,
|
|
34
|
+
A: [...problem.A, ...addA],
|
|
35
|
+
b: [...problem.b, ...addB],
|
|
36
|
+
relations: [...baseRel, ...addRel],
|
|
37
|
+
objective: sense,
|
|
38
|
+
});
|
|
39
|
+
if (sol.status === 'infeasible')
|
|
40
|
+
return;
|
|
41
|
+
if (sol.status === 'unbounded') {
|
|
42
|
+
unbounded = true;
|
|
43
|
+
return;
|
|
44
|
+
}
|
|
45
|
+
// Élagage par borne : la relaxation borne le sous-arbre ; si elle ne peut
|
|
46
|
+
// pas dépasser l'incumbent, inutile de descendre.
|
|
47
|
+
if (found) {
|
|
48
|
+
if (sense === 'max' && sol.objective <= best.objective + EPS)
|
|
49
|
+
return;
|
|
50
|
+
if (sense === 'min' && sol.objective >= best.objective - EPS)
|
|
51
|
+
return;
|
|
52
|
+
}
|
|
53
|
+
// Première variable entière encore fractionnaire ?
|
|
54
|
+
let frac = -1;
|
|
55
|
+
for (const j of intIdx) {
|
|
56
|
+
if (!isInt(sol.x[j])) {
|
|
57
|
+
frac = j;
|
|
58
|
+
break;
|
|
59
|
+
}
|
|
60
|
+
}
|
|
61
|
+
if (frac === -1) {
|
|
62
|
+
// Candidat entier admissible → met à jour l'incumbent.
|
|
63
|
+
const x = sol.x.map((v) => (isInt(v) ? Math.round(v) : v));
|
|
64
|
+
const better = !found || (sense === 'max' ? sol.objective > best.objective : sol.objective < best.objective);
|
|
65
|
+
if (better) {
|
|
66
|
+
best = { x, objective: sol.objective };
|
|
67
|
+
found = true;
|
|
68
|
+
}
|
|
69
|
+
return;
|
|
70
|
+
}
|
|
71
|
+
// Branchement : x_frac ≤ ⌊v⌋ puis x_frac ≥ ⌈v⌉.
|
|
72
|
+
const v = sol.x[frac];
|
|
73
|
+
const row = new Array(n).fill(0);
|
|
74
|
+
row[frac] = 1;
|
|
75
|
+
explore([...addA, row.slice()], [...addB, Math.floor(v)], [...addRel, '<=']);
|
|
76
|
+
explore([...addA, row.slice()], [...addB, Math.ceil(v)], [...addRel, '>=']);
|
|
77
|
+
};
|
|
78
|
+
explore([], [], []);
|
|
79
|
+
if (unbounded)
|
|
80
|
+
return { status: 'unbounded', x: [], objective: NaN };
|
|
81
|
+
if (!found)
|
|
82
|
+
return { status: 'infeasible', x: [], objective: NaN };
|
|
83
|
+
return { status: 'optimal', x: best.x, objective: best.objective };
|
|
84
|
+
}
|
|
85
|
+
/** Dialecte de solveur exposant le branch & bound (PLNE/MIP). */
|
|
86
|
+
export const milpDialect = {
|
|
87
|
+
name: 'branch-and-bound',
|
|
88
|
+
kind: 'milp',
|
|
89
|
+
capabilities: { exact: true, online: false, maxSize: 50 },
|
|
90
|
+
solve(problem, opts) {
|
|
91
|
+
return branchAndBound(problem, opts);
|
|
92
|
+
},
|
|
93
|
+
};
|
|
94
|
+
//# sourceMappingURL=milp.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"milp.js","sourceRoot":"","sources":["../../src/dialects/milp.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,MAAM,GAAG,GAAG,IAAI,CAAC;AACjB,MAAM,KAAK,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;AAEzE,wEAAwE;AACxE,MAAM,UAAU,cAAc,CAAC,OAAoB,EAAE,IAAmB;IACtE,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC;IACzC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,OAAO,GAAe,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAgB,CAAC,CAAC;IACvF,MAAM,QAAQ,GAAG,IAAI,EAAE,QAAQ,IAAI,OAAO,CAAC;IAE3C,2EAA2E;IAC3E,kFAAkF;IAClF,IAAI,IAAI,GAAuC,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5G,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,gFAAgF;IAChF,MAAM,OAAO,GAAG,CAAC,IAAgB,EAAE,IAAc,EAAE,MAAkB,EAAQ,EAAE;QAC7E,IAAI,SAAS,IAAI,KAAK,IAAI,QAAQ;YAAE,OAAO;QAC3C,KAAK,EAAE,CAAC;QAER,MAAM,GAAG,GAAG,OAAO,CAAC;YAClB,IAAI,EAAE,IAAI;YACV,CAAC,EAAE,OAAO,CAAC,CAAC;YACZ,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;YAC1B,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;YAC1B,SAAS,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC;YAClC,SAAS,EAAE,KAAK;SACjB,CAAC,CAAC;QACH,IAAI,GAAG,CAAC,MAAM,KAAK,YAAY;YAAE,OAAO;QACxC,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAAC,SAAS,GAAG,IAAI,CAAC;YAAC,OAAO;QAAC,CAAC;QAE7D,0EAA0E;QAC1E,kDAAkD;QAClD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,GAAG,GAAG;gBAAE,OAAO;YACrE,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,GAAG,GAAG;gBAAE,OAAO;QACvE,CAAC;QAED,mDAAmD;QACnD,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,MAAM;YAAC,CAAC;QAC5C,CAAC;QACD,IAAI,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC;YAChB,uDAAuD;YACvD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,MAAM,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7G,IAAI,MAAM,EAAE,CAAC;gBAAC,IAAI,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;gBAAC,KAAK,GAAG,IAAI,CAAC;YAAC,CAAC;YACrE,OAAO;QACT,CAAC;QAED,kDAAkD;QAClD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QAC7E,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9E,CAAC,CAAC;IAEF,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAEpB,IAAI,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;IACrE,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;IACnE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;AACrE,CAAC;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,WAAW,GAA2C;IACjE,IAAI,EAAE,kBAAkB;IACxB,IAAI,EAAE,MAAM;IACZ,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE;IACzD,KAAK,CAAC,OAAO,EAAE,IAAI;QACjB,OAAO,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;CACF,CAAC"}
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « min-cost-flow » (flot de coût minimal)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Flot de coût minimal par PLUS COURTS CHEMINS SUCCESSIFS (SSP) : on augmente le
|
|
6
|
+
* flot le long du chemin résiduel le moins cher (Bellman-Ford/SPFA, qui tolère
|
|
7
|
+
* les arcs inverses de coût négatif), jusqu'à atteindre `value` ou le flot
|
|
8
|
+
* maximal. Généralise l'affectation hongroise (capacités unitaires). Exact pour
|
|
9
|
+
* des coûts d'arcs ≥ 0 (aucun cycle de coût négatif).
|
|
10
|
+
*/
|
|
11
|
+
import type { FlowProblem, FlowSolution, SolverDialect } from '../types.js';
|
|
12
|
+
/** Résout un flot de coût minimal (SSP / Bellman-Ford). */
|
|
13
|
+
export declare function minCostFlow(problem: FlowProblem): FlowSolution;
|
|
14
|
+
/** Dialecte de solveur exposant le flot de coût minimal. */
|
|
15
|
+
export declare const minCostFlowDialect: SolverDialect<FlowProblem, FlowSolution>;
|
|
16
|
+
//# sourceMappingURL=min-cost-flow.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"min-cost-flow.d.ts","sourceRoot":"","sources":["../../src/dialects/min-cost-flow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAI5E,2DAA2D;AAC3D,wBAAgB,WAAW,CAAC,OAAO,EAAE,WAAW,GAAG,YAAY,CAuD9D;AAED,4DAA4D;AAC5D,eAAO,MAAM,kBAAkB,EAAE,aAAa,CAAC,WAAW,EAAE,YAAY,CAOvE,CAAC"}
|
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « min-cost-flow » (flot de coût minimal)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Flot de coût minimal par PLUS COURTS CHEMINS SUCCESSIFS (SSP) : on augmente le
|
|
6
|
+
* flot le long du chemin résiduel le moins cher (Bellman-Ford/SPFA, qui tolère
|
|
7
|
+
* les arcs inverses de coût négatif), jusqu'à atteindre `value` ou le flot
|
|
8
|
+
* maximal. Généralise l'affectation hongroise (capacités unitaires). Exact pour
|
|
9
|
+
* des coûts d'arcs ≥ 0 (aucun cycle de coût négatif).
|
|
10
|
+
*/
|
|
11
|
+
const EPS = 1e-9;
|
|
12
|
+
/** Résout un flot de coût minimal (SSP / Bellman-Ford). */
|
|
13
|
+
export function minCostFlow(problem) {
|
|
14
|
+
const { arcs, source, sink } = problem;
|
|
15
|
+
const target = problem.value ?? Infinity;
|
|
16
|
+
const N = problem.nodes ??
|
|
17
|
+
arcs.reduce((mx, a) => Math.max(mx, a.from, a.to), Math.max(source, sink)) + 1;
|
|
18
|
+
// Réseau résiduel : arêtes appariées (e, e^1). e pair = aller, e impair = retour.
|
|
19
|
+
const eTo = [];
|
|
20
|
+
const eCap = [];
|
|
21
|
+
const eCost = [];
|
|
22
|
+
const graph = Array.from({ length: N }, () => []);
|
|
23
|
+
const addEdge = (u, v, cap, cost) => {
|
|
24
|
+
graph[u].push(eTo.length);
|
|
25
|
+
eTo.push(v);
|
|
26
|
+
eCap.push(cap);
|
|
27
|
+
eCost.push(cost);
|
|
28
|
+
graph[v].push(eTo.length);
|
|
29
|
+
eTo.push(u);
|
|
30
|
+
eCap.push(0);
|
|
31
|
+
eCost.push(-cost);
|
|
32
|
+
};
|
|
33
|
+
const arcEdge = [];
|
|
34
|
+
for (const a of arcs) {
|
|
35
|
+
arcEdge.push(eTo.length);
|
|
36
|
+
addEdge(a.from, a.to, a.capacity, a.cost);
|
|
37
|
+
}
|
|
38
|
+
let totalFlow = 0;
|
|
39
|
+
let totalCost = 0;
|
|
40
|
+
while (totalFlow < target - EPS) {
|
|
41
|
+
// Plus court chemin par coût dans le résiduel (SPFA : Bellman-Ford en file).
|
|
42
|
+
const dist = new Array(N).fill(Infinity);
|
|
43
|
+
const inQueue = new Array(N).fill(false);
|
|
44
|
+
const prevEdge = new Array(N).fill(-1);
|
|
45
|
+
dist[source] = 0;
|
|
46
|
+
const queue = [source];
|
|
47
|
+
inQueue[source] = true;
|
|
48
|
+
while (queue.length) {
|
|
49
|
+
const u = queue.shift();
|
|
50
|
+
inQueue[u] = false;
|
|
51
|
+
for (const e of graph[u]) {
|
|
52
|
+
if (eCap[e] > EPS && dist[u] + eCost[e] < dist[eTo[e]] - EPS) {
|
|
53
|
+
dist[eTo[e]] = dist[u] + eCost[e];
|
|
54
|
+
prevEdge[eTo[e]] = e;
|
|
55
|
+
if (!inQueue[eTo[e]]) {
|
|
56
|
+
inQueue[eTo[e]] = true;
|
|
57
|
+
queue.push(eTo[e]);
|
|
58
|
+
}
|
|
59
|
+
}
|
|
60
|
+
}
|
|
61
|
+
}
|
|
62
|
+
if (prevEdge[sink] === -1)
|
|
63
|
+
break; // plus de chemin augmentant → flot maximal atteint
|
|
64
|
+
// Goulot : min capacité résiduelle le long du chemin (borné par le reste demandé).
|
|
65
|
+
let push = target - totalFlow;
|
|
66
|
+
for (let v = sink; v !== source;) {
|
|
67
|
+
const e = prevEdge[v];
|
|
68
|
+
push = Math.min(push, eCap[e]);
|
|
69
|
+
v = eTo[e ^ 1];
|
|
70
|
+
}
|
|
71
|
+
// Augmentation.
|
|
72
|
+
for (let v = sink; v !== source;) {
|
|
73
|
+
const e = prevEdge[v];
|
|
74
|
+
eCap[e] -= push;
|
|
75
|
+
eCap[e ^ 1] += push;
|
|
76
|
+
v = eTo[e ^ 1];
|
|
77
|
+
}
|
|
78
|
+
totalFlow += push;
|
|
79
|
+
totalCost += push * dist[sink];
|
|
80
|
+
}
|
|
81
|
+
const arcFlows = arcEdge.map((ei, k) => arcs[k].capacity - eCap[ei]);
|
|
82
|
+
const status = problem.value !== undefined && totalFlow < problem.value - EPS ? 'infeasible' : 'optimal';
|
|
83
|
+
return { status, flow: totalFlow, cost: totalCost, arcFlows };
|
|
84
|
+
}
|
|
85
|
+
/** Dialecte de solveur exposant le flot de coût minimal. */
|
|
86
|
+
export const minCostFlowDialect = {
|
|
87
|
+
name: 'min-cost-flow',
|
|
88
|
+
kind: 'flow',
|
|
89
|
+
capabilities: { exact: true, online: true, maxSize: 5000 },
|
|
90
|
+
solve(problem) {
|
|
91
|
+
return minCostFlow(problem);
|
|
92
|
+
},
|
|
93
|
+
};
|
|
94
|
+
//# sourceMappingURL=min-cost-flow.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"min-cost-flow.js","sourceRoot":"","sources":["../../src/dialects/min-cost-flow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,2DAA2D;AAC3D,MAAM,UAAU,WAAW,CAAC,OAAoB;IAC9C,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IACvC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC;IACzC,MAAM,CAAC,GACL,OAAO,CAAC,KAAK;QACb,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjF,kFAAkF;IAClF,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW,EAAE,IAAY,EAAQ,EAAE;QACxE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1E,CAAC,CAAC;IACF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC;IAE9F,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,SAAS,GAAG,MAAM,GAAG,GAAG,EAAE,CAAC;QAChC,6EAA6E;QAC7E,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;YAClC,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;oBAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAClC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;wBAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,CAAC;gBACvE,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,MAAM,CAAC,mDAAmD;QAErF,mFAAmF;QACnF,IAAI,IAAI,GAAG,MAAM,GAAG,SAAS,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,MAAM,GAAI,CAAC;YAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAAC,CAAC;QAC7G,gBAAgB;QAChB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,MAAM,GAAI,CAAC;YAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC;YAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAAC,CAAC;QACnH,SAAS,IAAI,IAAI,CAAC;QAClB,SAAS,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,MAAM,MAAM,GACV,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5F,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;AAChE,CAAC;AAED,4DAA4D;AAC5D,MAAM,CAAC,MAAM,kBAAkB,GAA6C;IAC1E,IAAI,EAAE,eAAe;IACrB,IAAI,EAAE,MAAM;IACZ,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE;IAC1D,KAAK,CAAC,OAAO;QACX,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;CACF,CAAC"}
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « mmc » (file d'attente M/M/c, théorie des files)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* File M/M/c : arrivées de Poisson (λ), service exponentiel (μ par serveur), c
|
|
6
|
+
* serveurs. Évalue les métriques (occupation, Erlang C, attente moyenne) et
|
|
7
|
+
* DIMENSIONNE (plus petit c satisfaisant un objectif de service). Utile pour
|
|
8
|
+
* estimer l'attente et dimensionner des guichets.
|
|
9
|
+
*/
|
|
10
|
+
import type { QueueMetrics, QueueProblem, QueueSolution, QueueTarget, SolverDialect } from '../types.js';
|
|
11
|
+
/** Métriques M/M/c pour λ, μ et c serveurs (formules d'Erlang). */
|
|
12
|
+
export declare function mmc(lambda: number, mu: number, c: number): QueueMetrics;
|
|
13
|
+
/** Dimensionnement : plus petit c stable satisfaisant l'objectif `target`. */
|
|
14
|
+
export declare function mmcSizing(lambda: number, mu: number, target: QueueTarget): QueueSolution;
|
|
15
|
+
/** Dialecte de solveur exposant la file M/M/c (évaluation + dimensionnement). */
|
|
16
|
+
export declare const mmcDialect: SolverDialect<QueueProblem, QueueSolution>;
|
|
17
|
+
//# sourceMappingURL=mmc.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"mmc.d.ts","sourceRoot":"","sources":["../../src/dialects/mmc.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEzG,mEAAmE;AACnE,wBAAgB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,YAAY,CAoBvE;AAOD,8EAA8E;AAC9E,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,aAAa,CAUxF;AAED,iFAAiF;AACjF,eAAO,MAAM,UAAU,EAAE,aAAa,CAAC,YAAY,EAAE,aAAa,CASjE,CAAC"}
|
|
@@ -0,0 +1,63 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « mmc » (file d'attente M/M/c, théorie des files)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* File M/M/c : arrivées de Poisson (λ), service exponentiel (μ par serveur), c
|
|
6
|
+
* serveurs. Évalue les métriques (occupation, Erlang C, attente moyenne) et
|
|
7
|
+
* DIMENSIONNE (plus petit c satisfaisant un objectif de service). Utile pour
|
|
8
|
+
* estimer l'attente et dimensionner des guichets.
|
|
9
|
+
*/
|
|
10
|
+
/** Métriques M/M/c pour λ, μ et c serveurs (formules d'Erlang). */
|
|
11
|
+
export function mmc(lambda, mu, c) {
|
|
12
|
+
const offered = lambda / mu; // a = λ/μ (Erlangs)
|
|
13
|
+
const rho = offered / c; // taux d'occupation
|
|
14
|
+
const base = { c, offered, rho };
|
|
15
|
+
if (!(mu > 0) || !(lambda >= 0) || c < 1 || rho >= 1) {
|
|
16
|
+
return { ...base, stable: false, probWait: 1, avgQueue: Infinity, avgWait: Infinity, avgSystem: Infinity, avgTime: Infinity };
|
|
17
|
+
}
|
|
18
|
+
// Σ_{n=0}^{c-1} aⁿ/n! (calcul itératif, sans factorielle explicite).
|
|
19
|
+
let term = 1; // a⁰/0!
|
|
20
|
+
let sum = 1;
|
|
21
|
+
for (let n = 1; n <= c - 1; n++) {
|
|
22
|
+
term *= offered / n;
|
|
23
|
+
sum += term;
|
|
24
|
+
}
|
|
25
|
+
const ac = (term * offered) / c; // a^c / c!
|
|
26
|
+
const erlangCnum = ac / (1 - rho);
|
|
27
|
+
const p0 = 1 / (sum + erlangCnum);
|
|
28
|
+
const probWait = erlangCnum * p0; // C(c, a) = P(attente)
|
|
29
|
+
const avgQueue = (probWait * rho) / (1 - rho); // Lq
|
|
30
|
+
const avgWait = avgQueue / lambda; // Wq
|
|
31
|
+
const avgSystem = avgQueue + offered; // L
|
|
32
|
+
const avgTime = avgWait + 1 / mu; // W
|
|
33
|
+
return { ...base, stable: true, probWait, avgQueue, avgWait, avgSystem, avgTime };
|
|
34
|
+
}
|
|
35
|
+
const meets = (m, t) => m.stable &&
|
|
36
|
+
(t.maxWait == null || m.avgWait <= t.maxWait) &&
|
|
37
|
+
(t.maxProbWait == null || m.probWait <= t.maxProbWait);
|
|
38
|
+
/** Dimensionnement : plus petit c stable satisfaisant l'objectif `target`. */
|
|
39
|
+
export function mmcSizing(lambda, mu, target) {
|
|
40
|
+
const minC = Math.max(1, Math.floor(lambda / mu) + 1); // c > a requis pour la stabilité
|
|
41
|
+
const cap = minC + 1000;
|
|
42
|
+
let last = mmc(lambda, mu, minC);
|
|
43
|
+
for (let c = minC; c <= cap; c++) {
|
|
44
|
+
const m = mmc(lambda, mu, c);
|
|
45
|
+
last = m;
|
|
46
|
+
if (meets(m, target))
|
|
47
|
+
return { ...m, feasible: true };
|
|
48
|
+
}
|
|
49
|
+
return { ...last, feasible: false };
|
|
50
|
+
}
|
|
51
|
+
/** Dialecte de solveur exposant la file M/M/c (évaluation + dimensionnement). */
|
|
52
|
+
export const mmcDialect = {
|
|
53
|
+
name: 'mmc',
|
|
54
|
+
kind: 'queue',
|
|
55
|
+
capabilities: { exact: true, online: true },
|
|
56
|
+
solve(problem) {
|
|
57
|
+
if (problem.target && problem.c == null)
|
|
58
|
+
return mmcSizing(problem.lambda, problem.mu, problem.target);
|
|
59
|
+
const m = mmc(problem.lambda, problem.mu, problem.c ?? 1);
|
|
60
|
+
return { ...m, feasible: m.stable };
|
|
61
|
+
},
|
|
62
|
+
};
|
|
63
|
+
//# sourceMappingURL=mmc.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"mmc.js","sourceRoot":"","sources":["../../src/dialects/mmc.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,mEAAmE;AACnE,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,EAAU,EAAE,CAAS;IACvD,MAAM,OAAO,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,oBAAoB;IACjD,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,oBAAoB;IAC7C,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IACjC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;QACrD,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;IAChI,CAAC;IACD,sEAAsE;IACtE,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ;IACtB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,IAAI,IAAI,OAAO,GAAG,CAAC,CAAC;QAAC,GAAG,IAAI,IAAI,CAAC;IAAC,CAAC;IACtE,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW;IAC5C,MAAM,UAAU,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,UAAU,GAAG,EAAE,CAAC,CAAC,uBAAuB;IACzD,MAAM,QAAQ,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK;IACpD,MAAM,OAAO,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,KAAK;IACxC,MAAM,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC,CAAC,IAAI;IAC1C,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI;IACtC,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACpF,CAAC;AAED,MAAM,KAAK,GAAG,CAAC,CAAe,EAAE,CAAc,EAAW,EAAE,CACzD,CAAC,CAAC,MAAM;IACR,CAAC,CAAC,CAAC,OAAO,IAAI,IAAI,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IAC7C,CAAC,CAAC,CAAC,WAAW,IAAI,IAAI,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC;AAEzD,8EAA8E;AAC9E,MAAM,UAAU,SAAS,CAAC,MAAc,EAAE,EAAU,EAAE,MAAmB;IACvE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,iCAAiC;IACxF,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC;IACxB,IAAI,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAI,GAAG,CAAC,CAAC;QACT,IAAI,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC;YAAE,OAAO,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IACxD,CAAC;IACD,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC;AAED,iFAAiF;AACjF,MAAM,CAAC,MAAM,UAAU,GAA+C;IACpE,IAAI,EAAE,KAAK;IACX,IAAI,EAAE,OAAO;IACb,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;IAC3C,KAAK,CAAC,OAAO;QACX,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,IAAI,IAAI;YAAE,OAAO,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACtG,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,OAAO,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;IACtC,CAAC;CACF,CAAC"}
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « monte-carlo » (simulation)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Estimateur Monte-Carlo : moyenne d'un tirage `sample(rng)` sur `trials` essais,
|
|
6
|
+
* avec variance et erreur-type. RNG reproductible (graine) → tests déterministes.
|
|
7
|
+
* Sert à valider les modèles (ex. file M/M/c) au-delà des formules fermées.
|
|
8
|
+
*/
|
|
9
|
+
import type { MonteCarloProblem, MonteCarloSolution, SolverDialect } from '../types.js';
|
|
10
|
+
/** Estimation Monte-Carlo : moyenne, variance, erreur-type sur `trials` essais. */
|
|
11
|
+
export declare function monteCarlo(problem: MonteCarloProblem): MonteCarloSolution;
|
|
12
|
+
/** Dialecte de solveur exposant l'estimation Monte-Carlo. */
|
|
13
|
+
export declare const monteCarloDialect: SolverDialect<MonteCarloProblem, MonteCarloSolution>;
|
|
14
|
+
//# sourceMappingURL=monte-carlo.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"monte-carlo.d.ts","sourceRoot":"","sources":["../../src/dialects/monte-carlo.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAGxF,mFAAmF;AACnF,wBAAgB,UAAU,CAAC,OAAO,EAAE,iBAAiB,GAAG,kBAAkB,CAczE;AAED,6DAA6D;AAC7D,eAAO,MAAM,iBAAiB,EAAE,aAAa,CAAC,iBAAiB,EAAE,kBAAkB,CAOlF,CAAC"}
|
|
@@ -0,0 +1,35 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « monte-carlo » (simulation)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Estimateur Monte-Carlo : moyenne d'un tirage `sample(rng)` sur `trials` essais,
|
|
6
|
+
* avec variance et erreur-type. RNG reproductible (graine) → tests déterministes.
|
|
7
|
+
* Sert à valider les modèles (ex. file M/M/c) au-delà des formules fermées.
|
|
8
|
+
*/
|
|
9
|
+
import { makeRng } from '../lib/rng.js';
|
|
10
|
+
/** Estimation Monte-Carlo : moyenne, variance, erreur-type sur `trials` essais. */
|
|
11
|
+
export function monteCarlo(problem) {
|
|
12
|
+
const rng = makeRng(problem.seed ?? 12345);
|
|
13
|
+
const n = problem.trials;
|
|
14
|
+
let sum = 0;
|
|
15
|
+
let sumSq = 0;
|
|
16
|
+
for (let i = 0; i < n; i++) {
|
|
17
|
+
const x = problem.sample(rng);
|
|
18
|
+
sum += x;
|
|
19
|
+
sumSq += x * x;
|
|
20
|
+
}
|
|
21
|
+
const mean = n > 0 ? sum / n : 0;
|
|
22
|
+
const variance = n > 0 ? Math.max(0, sumSq / n - mean * mean) : 0;
|
|
23
|
+
const stdError = n > 0 ? Math.sqrt(variance / n) : 0;
|
|
24
|
+
return { mean, variance, stdError, n };
|
|
25
|
+
}
|
|
26
|
+
/** Dialecte de solveur exposant l'estimation Monte-Carlo. */
|
|
27
|
+
export const monteCarloDialect = {
|
|
28
|
+
name: 'monte-carlo',
|
|
29
|
+
kind: 'simulation',
|
|
30
|
+
capabilities: { exact: false, online: true },
|
|
31
|
+
solve(problem) {
|
|
32
|
+
return monteCarlo(problem);
|
|
33
|
+
},
|
|
34
|
+
};
|
|
35
|
+
//# sourceMappingURL=monte-carlo.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"monte-carlo.js","sourceRoot":"","sources":["../../src/dialects/monte-carlo.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAExC,mFAAmF;AACnF,MAAM,UAAU,UAAU,CAAC,OAA0B;IACnD,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;IAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,GAAG,IAAI,CAAC,CAAC;QACT,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AACzC,CAAC;AAED,6DAA6D;AAC7D,MAAM,CAAC,MAAM,iBAAiB,GAAyD;IACrF,IAAI,EAAE,aAAa;IACnB,IAAI,EAAE,YAAY;IAClB,YAAY,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE;IAC5C,KAAK,CAAC,OAAO;QACX,OAAO,UAAU,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;CACF,CAAC"}
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @mostajs/ro-pla — Dialecte « simplexe » (programmation linéaire)
|
|
3
|
+
* @author Dr Hamid MADANI <drmdh@msn.com>
|
|
4
|
+
*
|
|
5
|
+
* Résout `optimise cᵀx s.c. A·x {≤,=,≥} b, x ≥ 0` par la méthode du SIMPLEXE en
|
|
6
|
+
* DEUX PHASES (variables artificielles), avec la règle de Bland (indice le plus
|
|
7
|
+
* petit) pour garantir la terminaison sans cyclage. Exact pour les LP rationnels.
|
|
8
|
+
*/
|
|
9
|
+
import type { LpProblem, LpSolution, SolverDialect } from '../types.js';
|
|
10
|
+
/** Résout un programme linéaire ; renvoie statut + solution. */
|
|
11
|
+
export declare function simplex(problem: LpProblem): LpSolution;
|
|
12
|
+
/** Dialecte de solveur exposant le simplexe (programmation linéaire). */
|
|
13
|
+
export declare const simplexDialect: SolverDialect<LpProblem, LpSolution>;
|
|
14
|
+
//# sourceMappingURL=simplex.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"simplex.d.ts","sourceRoot":"","sources":["../../src/dialects/simplex.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAY,aAAa,EAAE,MAAM,aAAa,CAAC;AAIlF,gEAAgE;AAChE,wBAAgB,OAAO,CAAC,OAAO,EAAE,SAAS,GAAG,UAAU,CA6ItD;AAED,yEAAyE;AACzE,eAAO,MAAM,cAAc,EAAE,aAAa,CAAC,SAAS,EAAE,UAAU,CAO/D,CAAC"}
|