INNER CODE UNIT · JavaScript
solve_glpk
chaldea-center/chaldea · res/js/solver.js:11
function solve_glpk(data_str, params_str) {
let t0 = new Date().getTime();
let data = JSON.parse(data_str);
let params = JSON.parse(params_str);
// (default) params
// required, b in AX>=b, row-num dict
let rows = params.rows, counts = Array.from(params.rows, x => params.planItemCounts[x]);
let objective = {}
for (let i = 0; i < rows.length; i++)
objective[rows[i]] = counts[i]
// if true, use coeff, minimize eff; else coeff=1, minimize num.
let cost_minimize = get_param(params, 'costMinimize', true);
// if true, use ILP(simplex + intopt), else only simplex(now).
let integer_result = get_param(params, 'integerResult', false);
// other pre-processing should been done in main program.
let enable_log = get_param(params, ' enableLog', true)
function log(msg) {