tla-ts 0.0.4 → 0.0.5-dev.5b2dea1
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 +38 -127
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +46 -12
- package/dist/index.d.ts +46 -12
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +76 -92
- package/dist/transfer.js +76 -92
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1153
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +115 -721
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +43 -22
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +97 -35
- package/src/evaluate.ts +361 -181
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +10 -0
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +207 -141
- package/src/liveness.ts +38 -34
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +172 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +39 -51
- package/src/parallel.ts +39 -66
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +645 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +84 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +21 -22
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +39 -23
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -190
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/transfer.ts +32 -32
- package/src/values.ts +166 -111
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/canonical.ts +0 -40
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
|
@@ -0,0 +1,504 @@
|
|
|
1
|
+
// Ported from Z3 (src/math/lp/lar_core_solver.h, src/math/lp/lp_core_solver_base.h,
|
|
2
|
+
// src/math/lp/lp_primal_core_solver.h, src/math/lp/lp_primal_core_solver_tableau_def.h), MIT
|
|
3
|
+
// license, see z3-license.txt. The tableau, the column values and bounds, and the primal simplex
|
|
4
|
+
// that lar_solver runs with the tableau_rows strategy: the smallest infeasible basic column
|
|
5
|
+
// leaves, and the entering column is the one in its row that frees the fewest bounded basics.
|
|
6
|
+
import { Rational } from "../rational";
|
|
7
|
+
import { IndexedUintSet, StackedVector, VarHeap } from "./containers";
|
|
8
|
+
import type { LpSettings } from "./lp-settings";
|
|
9
|
+
import { Impq } from "./numeric-pair";
|
|
10
|
+
import { RowCell, StaticMatrix } from "./static-matrix";
|
|
11
|
+
|
|
12
|
+
export const COLUMN_FREE = 0;
|
|
13
|
+
export const COLUMN_LOWER = 1;
|
|
14
|
+
export const COLUMN_UPPER = 2;
|
|
15
|
+
export const COLUMN_BOXED = 3;
|
|
16
|
+
export const COLUMN_FIXED = 4;
|
|
17
|
+
|
|
18
|
+
// column_type: which bounds a column has.
|
|
19
|
+
export type ColumnType =
|
|
20
|
+
| typeof COLUMN_FREE
|
|
21
|
+
| typeof COLUMN_LOWER
|
|
22
|
+
| typeof COLUMN_UPPER
|
|
23
|
+
| typeof COLUMN_BOXED
|
|
24
|
+
| typeof COLUMN_FIXED;
|
|
25
|
+
|
|
26
|
+
export const LP_UNKNOWN = 0;
|
|
27
|
+
export const LP_INFEASIBLE = 1;
|
|
28
|
+
export const LP_OPTIMAL = 2;
|
|
29
|
+
export const LP_FEASIBLE = 3;
|
|
30
|
+
export const LP_CANCELLED = 4;
|
|
31
|
+
export const LP_UNBOUNDED = 5;
|
|
32
|
+
|
|
33
|
+
const BLAND_MODE_THRESHOLD = 1000;
|
|
34
|
+
|
|
35
|
+
export class CoreSolver {
|
|
36
|
+
readonly matrix = new StaticMatrix();
|
|
37
|
+
readonly columnTypes = new StackedVector<ColumnType>();
|
|
38
|
+
lowerBounds: Impq[] = [];
|
|
39
|
+
upperBounds: Impq[] = [];
|
|
40
|
+
x: Impq[] = [];
|
|
41
|
+
basis: number[] = [];
|
|
42
|
+
nbasis: number[] = [];
|
|
43
|
+
heading: number[] = [];
|
|
44
|
+
readonly infHeap = new VarHeap();
|
|
45
|
+
touchedRows: IndexedUintSet | null = null;
|
|
46
|
+
status = LP_FEASIBLE;
|
|
47
|
+
infRowIndex = -1;
|
|
48
|
+
infeasibleSumSign = 0;
|
|
49
|
+
infeasibleCombination: [Rational, number][] = [];
|
|
50
|
+
// m_d: the reduced costs while maximize_term runs the tableau_costs strategy, kept on pivots.
|
|
51
|
+
reducedCosts: Rational[] | undefined;
|
|
52
|
+
private isBlandMode = false;
|
|
53
|
+
private leftBasis = new IndexedUintSet();
|
|
54
|
+
private leftBasisRepeated = 0;
|
|
55
|
+
|
|
56
|
+
constructor(readonly settings: LpSettings) {}
|
|
57
|
+
|
|
58
|
+
getColumnCount() {
|
|
59
|
+
return this.matrix.getColumnCount();
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
// add_new_var_to_core_fields_for_mpq: a column at zero, basic in a new row or nonbasic.
|
|
63
|
+
addColumn(isBasic: boolean) {
|
|
64
|
+
const column = this.matrix.getColumnCount();
|
|
65
|
+
this.matrix.addColumn();
|
|
66
|
+
this.x.push(Impq.zero);
|
|
67
|
+
this.lowerBounds[column] = Impq.zero;
|
|
68
|
+
this.upperBounds[column] = Impq.zero;
|
|
69
|
+
if (isBasic) {
|
|
70
|
+
this.matrix.addRow();
|
|
71
|
+
this.heading.push(this.basis.length);
|
|
72
|
+
this.basis.push(column);
|
|
73
|
+
return;
|
|
74
|
+
}
|
|
75
|
+
this.heading.push(-this.nbasis.length - 1);
|
|
76
|
+
this.nbasis.push(column);
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
// remove_last_column_from_basis_tableau: the last column out of the basis or the nonbasic
|
|
80
|
+
// columns, once the tableau no longer holds it.
|
|
81
|
+
removeLastColumn(column: number) {
|
|
82
|
+
this.x.length = this.matrix.getColumnCount();
|
|
83
|
+
const position = this.heading[column];
|
|
84
|
+
if (position >= 0) {
|
|
85
|
+
const lastPosition = this.basis.length - 1;
|
|
86
|
+
if (position !== lastPosition) {
|
|
87
|
+
const moved = this.basis[lastPosition];
|
|
88
|
+
this.basis[position] = moved;
|
|
89
|
+
this.heading[moved] = position;
|
|
90
|
+
}
|
|
91
|
+
this.basis.pop();
|
|
92
|
+
} else {
|
|
93
|
+
const index = -1 - position;
|
|
94
|
+
const lastPosition = this.nbasis.length - 1;
|
|
95
|
+
if (index !== lastPosition) {
|
|
96
|
+
const moved = this.nbasis[lastPosition];
|
|
97
|
+
this.nbasis[index] = moved;
|
|
98
|
+
this.heading[moved] = -index - 1;
|
|
99
|
+
}
|
|
100
|
+
this.nbasis.pop();
|
|
101
|
+
}
|
|
102
|
+
this.heading.pop();
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
// The action, with pivots not recording the rows they touch.
|
|
106
|
+
withoutTouchedRows<T>(action: () => T) {
|
|
107
|
+
const savedTouchedRows = this.touchedRows;
|
|
108
|
+
this.touchedRows = null;
|
|
109
|
+
const result = action();
|
|
110
|
+
this.touchedRows = savedTouchedRows;
|
|
111
|
+
return result;
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
getColumnType(column: number) {
|
|
115
|
+
return this.columnTypes.get(column);
|
|
116
|
+
}
|
|
117
|
+
|
|
118
|
+
isBase(column: number) {
|
|
119
|
+
return this.heading[column] >= 0;
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
isFixed(column: number) {
|
|
123
|
+
return this.columnTypes.get(column) === COLUMN_FIXED;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
hasLowerBound(column: number) {
|
|
127
|
+
const type = this.columnTypes.get(column);
|
|
128
|
+
return type !== COLUMN_FREE && type !== COLUMN_UPPER;
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
hasUpperBound(column: number) {
|
|
132
|
+
const type = this.columnTypes.get(column);
|
|
133
|
+
return type !== COLUMN_FREE && type !== COLUMN_LOWER;
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
isFeasible() {
|
|
137
|
+
return this.infHeap.size === 0;
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
columnIsFeasible(column: number) {
|
|
141
|
+
const value = this.x[column];
|
|
142
|
+
switch (this.columnTypes.get(column)) {
|
|
143
|
+
case COLUMN_FIXED:
|
|
144
|
+
case COLUMN_BOXED:
|
|
145
|
+
return (
|
|
146
|
+
value.compare(this.upperBounds[column]) <= 0 &&
|
|
147
|
+
value.compare(this.lowerBounds[column]) >= 0
|
|
148
|
+
);
|
|
149
|
+
case COLUMN_LOWER:
|
|
150
|
+
return value.compare(this.lowerBounds[column]) >= 0;
|
|
151
|
+
case COLUMN_UPPER:
|
|
152
|
+
return value.compare(this.upperBounds[column]) <= 0;
|
|
153
|
+
default:
|
|
154
|
+
return true;
|
|
155
|
+
}
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
trackColumnFeasibility(column: number) {
|
|
159
|
+
if (this.columnIsFeasible(column)) {
|
|
160
|
+
if (this.infHeap.has(column)) this.infHeap.erase(column);
|
|
161
|
+
} else if (!this.infHeap.has(column)) this.infHeap.insert(column);
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
addDeltaToXAndTrackFeasibility(column: number, delta: Impq) {
|
|
165
|
+
this.x[column] = this.x[column].add(delta);
|
|
166
|
+
this.trackColumnFeasibility(column);
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
submulFromXAndTrackFeasibility(column: number, delta: Impq, coeff: Rational) {
|
|
170
|
+
this.x[column] = this.x[column].sub(delta.mul(coeff));
|
|
171
|
+
this.trackColumnFeasibility(column);
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
// make_column_feasible: moves the value of a column into its bounds, and returns the move.
|
|
175
|
+
makeColumnFeasible(column: number) {
|
|
176
|
+
const value = this.x[column];
|
|
177
|
+
const lower = this.lowerBounds[column];
|
|
178
|
+
const upper = this.upperBounds[column];
|
|
179
|
+
let target: Impq | undefined;
|
|
180
|
+
switch (this.columnTypes.get(column)) {
|
|
181
|
+
case COLUMN_FIXED:
|
|
182
|
+
if (!value.equals(lower)) target = lower;
|
|
183
|
+
break;
|
|
184
|
+
case COLUMN_BOXED:
|
|
185
|
+
if (value.compare(lower) < 0) target = lower;
|
|
186
|
+
else if (value.compare(upper) > 0) target = upper;
|
|
187
|
+
break;
|
|
188
|
+
case COLUMN_LOWER:
|
|
189
|
+
if (value.compare(lower) < 0) target = lower;
|
|
190
|
+
break;
|
|
191
|
+
case COLUMN_UPPER:
|
|
192
|
+
if (value.compare(upper) > 0) target = upper;
|
|
193
|
+
break;
|
|
194
|
+
}
|
|
195
|
+
if (target === undefined) return undefined;
|
|
196
|
+
const delta = target.sub(value);
|
|
197
|
+
this.x[column] = target;
|
|
198
|
+
return delta;
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
changeBasis(entering: number, leaving: number) {
|
|
202
|
+
const placeInBasis = this.heading[leaving];
|
|
203
|
+
const placeInNonBasis = -this.heading[entering] - 1;
|
|
204
|
+
this.heading[entering] = placeInBasis;
|
|
205
|
+
this.basis[placeInBasis] = entering;
|
|
206
|
+
this.heading[leaving] = -placeInNonBasis - 1;
|
|
207
|
+
this.nbasis[placeInNonBasis] = leaving;
|
|
208
|
+
}
|
|
209
|
+
|
|
210
|
+
changeBasisUnconditionally(entering: number, leaving: number) {
|
|
211
|
+
let placeInNonBasis = -1 - this.heading[entering];
|
|
212
|
+
if (placeInNonBasis >= this.nbasis.length) {
|
|
213
|
+
placeInNonBasis = this.nbasis.length;
|
|
214
|
+
this.heading[entering] = placeInNonBasis;
|
|
215
|
+
this.nbasis.push(entering);
|
|
216
|
+
}
|
|
217
|
+
const placeInBasis = this.heading[leaving];
|
|
218
|
+
this.heading[entering] = placeInBasis;
|
|
219
|
+
this.basis[placeInBasis] = entering;
|
|
220
|
+
this.heading[leaving] = -placeInNonBasis - 1;
|
|
221
|
+
this.nbasis[placeInNonBasis] = leaving;
|
|
222
|
+
}
|
|
223
|
+
|
|
224
|
+
private divideRowByPivot(pivotRow: number, pivotColumn: number) {
|
|
225
|
+
const row = this.matrix.rows[pivotRow];
|
|
226
|
+
const pivotCell = row.find((cell) => cell.column === pivotColumn);
|
|
227
|
+
if (pivotCell === undefined || pivotCell.coeff.isZero()) return false;
|
|
228
|
+
const coeff = pivotCell.coeff;
|
|
229
|
+
for (const cell of row) if (cell.column !== pivotColumn) cell.coeff = cell.coeff.div(coeff);
|
|
230
|
+
pivotCell.coeff = coeff.div(coeff);
|
|
231
|
+
return true;
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
// pivot_column_tableau: makes the column a unit column with its one in the pivot row.
|
|
235
|
+
pivotColumnTableau(column: number, pivotRow: number) {
|
|
236
|
+
if (!this.divideRowByPivot(pivotRow, column)) return false;
|
|
237
|
+
this.settings.stats.pivots++;
|
|
238
|
+
const matrix = this.matrix;
|
|
239
|
+
const columnCells = matrix.columns[column];
|
|
240
|
+
const pivotIndex = columnCells.findIndex((cell) => cell.row === pivotRow);
|
|
241
|
+
if (pivotIndex < 0) return false;
|
|
242
|
+
if (pivotIndex !== 0) {
|
|
243
|
+
const first = columnCells[0];
|
|
244
|
+
columnCells[0] = columnCells[pivotIndex];
|
|
245
|
+
columnCells[pivotIndex] = first;
|
|
246
|
+
matrix.rows[pivotRow][columnCells[0].offset].offset = 0;
|
|
247
|
+
matrix.rows[first.row][first.offset].offset = pivotIndex;
|
|
248
|
+
}
|
|
249
|
+
while (columnCells.length > 1) {
|
|
250
|
+
const cell = columnCells[columnCells.length - 1];
|
|
251
|
+
this.touchedRows?.add(cell.row);
|
|
252
|
+
matrix.pivotRowToRowGivenCell(pivotRow, cell, column);
|
|
253
|
+
}
|
|
254
|
+
if (this.reducedCosts !== undefined)
|
|
255
|
+
this.pivotToReducedCosts(this.reducedCosts, pivotRow, column);
|
|
256
|
+
return true;
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
// pivot_to_reduced_costs_tableau: eliminates the reduced cost of the column that enters.
|
|
260
|
+
private pivotToReducedCosts(reducedCosts: Rational[], pivotRow: number, column: number) {
|
|
261
|
+
const alpha = reducedCosts[column];
|
|
262
|
+
if (alpha.isZero()) return;
|
|
263
|
+
for (const cell of this.matrix.rows[pivotRow])
|
|
264
|
+
if (cell.column !== column)
|
|
265
|
+
reducedCosts[cell.column] = reducedCosts[cell.column].sub(alpha.mul(cell.coeff));
|
|
266
|
+
reducedCosts[column] = Rational.zero;
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
pivot(entering: number, leaving: number) {
|
|
270
|
+
this.pivotColumnTableau(entering, this.heading[leaving]);
|
|
271
|
+
this.changeBasis(entering, leaving);
|
|
272
|
+
}
|
|
273
|
+
|
|
274
|
+
transposeRows(first: number, second: number) {
|
|
275
|
+
const basis = this.basis;
|
|
276
|
+
const saved = basis[first];
|
|
277
|
+
basis[first] = basis[second];
|
|
278
|
+
basis[second] = saved;
|
|
279
|
+
const savedHeading = this.heading[basis[first]];
|
|
280
|
+
this.heading[basis[first]] = this.heading[basis[second]];
|
|
281
|
+
this.heading[basis[second]] = savedHeading;
|
|
282
|
+
this.matrix.transposeRows(first, second);
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
// The simplex.
|
|
286
|
+
|
|
287
|
+
private needsToGrow(basic: number) {
|
|
288
|
+
const type = this.columnTypes.get(basic);
|
|
289
|
+
return (
|
|
290
|
+
(type === COLUMN_FIXED || type === COLUMN_LOWER || type === COLUMN_BOXED) &&
|
|
291
|
+
this.x[basic].compare(this.lowerBounds[basic]) < 0
|
|
292
|
+
);
|
|
293
|
+
}
|
|
294
|
+
|
|
295
|
+
infSignOfColumn(basic: number) {
|
|
296
|
+
switch (this.columnTypes.get(basic)) {
|
|
297
|
+
case COLUMN_FREE:
|
|
298
|
+
return 0;
|
|
299
|
+
case COLUMN_LOWER:
|
|
300
|
+
return 1;
|
|
301
|
+
case COLUMN_FIXED:
|
|
302
|
+
case COLUMN_BOXED:
|
|
303
|
+
return this.x[basic].compare(this.upperBounds[basic]) > 0 ? -1 : 1;
|
|
304
|
+
default:
|
|
305
|
+
return -1;
|
|
306
|
+
}
|
|
307
|
+
}
|
|
308
|
+
|
|
309
|
+
private isAboveLower(column: number) {
|
|
310
|
+
return this.x[column].compare(this.lowerBounds[column]) > 0;
|
|
311
|
+
}
|
|
312
|
+
|
|
313
|
+
private isBelowUpper(column: number) {
|
|
314
|
+
return this.x[column].compare(this.upperBounds[column]) < 0;
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
private monoidCanDecrease(cell: RowCell) {
|
|
318
|
+
const column = cell.column;
|
|
319
|
+
switch (this.columnTypes.get(column)) {
|
|
320
|
+
case COLUMN_FREE:
|
|
321
|
+
return true;
|
|
322
|
+
case COLUMN_FIXED:
|
|
323
|
+
return false;
|
|
324
|
+
case COLUMN_LOWER:
|
|
325
|
+
return !cell.coeff.isPositive() || this.isAboveLower(column);
|
|
326
|
+
case COLUMN_UPPER:
|
|
327
|
+
return cell.coeff.isPositive() || this.isBelowUpper(column);
|
|
328
|
+
default:
|
|
329
|
+
return cell.coeff.isPositive() ? this.isAboveLower(column) : this.isBelowUpper(column);
|
|
330
|
+
}
|
|
331
|
+
}
|
|
332
|
+
|
|
333
|
+
private monoidCanIncrease(cell: RowCell) {
|
|
334
|
+
const column = cell.column;
|
|
335
|
+
switch (this.columnTypes.get(column)) {
|
|
336
|
+
case COLUMN_FREE:
|
|
337
|
+
return true;
|
|
338
|
+
case COLUMN_FIXED:
|
|
339
|
+
return false;
|
|
340
|
+
case COLUMN_LOWER:
|
|
341
|
+
return cell.coeff.isNegative() ? this.isAboveLower(column) : true;
|
|
342
|
+
case COLUMN_UPPER:
|
|
343
|
+
return cell.coeff.isNegative() ? true : this.isBelowUpper(column);
|
|
344
|
+
default:
|
|
345
|
+
return cell.coeff.isNegative() ? this.isAboveLower(column) : this.isBelowUpper(column);
|
|
346
|
+
}
|
|
347
|
+
}
|
|
348
|
+
|
|
349
|
+
private getNumOfNotFreeBasicDependentVars(column: number, bound: number, basic: number) {
|
|
350
|
+
let result = 0;
|
|
351
|
+
for (const cell of this.matrix.columns[column]) {
|
|
352
|
+
const basicForRow = this.basis[cell.row];
|
|
353
|
+
if (basicForRow === basic) continue;
|
|
354
|
+
if (this.columnTypes.get(basicForRow) !== COLUMN_FREE && result++ > bound) return result;
|
|
355
|
+
}
|
|
356
|
+
return result;
|
|
357
|
+
}
|
|
358
|
+
|
|
359
|
+
// find_beneficial_entering_tableau_rows: the cell of the entering column, or undefined.
|
|
360
|
+
private findBeneficialEntering(rowIndex: number) {
|
|
361
|
+
const row = this.matrix.rows[rowIndex];
|
|
362
|
+
const basic = this.basis[rowIndex];
|
|
363
|
+
const isGrowing = this.needsToGrow(basic);
|
|
364
|
+
const canMove = (cell: RowCell) =>
|
|
365
|
+
cell.column !== basic &&
|
|
366
|
+
(isGrowing ? this.monoidCanDecrease(cell) : this.monoidCanIncrease(cell));
|
|
367
|
+
if (this.isBlandMode) {
|
|
368
|
+
let choice: RowCell | undefined;
|
|
369
|
+
for (const cell of row)
|
|
370
|
+
if (canMove(cell) && (choice === undefined || cell.column < choice.column)) choice = cell;
|
|
371
|
+
if (choice === undefined) this.infRowIndex = rowIndex;
|
|
372
|
+
return choice;
|
|
373
|
+
}
|
|
374
|
+
let choice = -1;
|
|
375
|
+
let numChoices = 0;
|
|
376
|
+
let minNonFree = Number.MAX_SAFE_INTEGER;
|
|
377
|
+
let bestColumnSize = Number.MAX_SAFE_INTEGER;
|
|
378
|
+
for (let index = 0; index < row.length; index++) {
|
|
379
|
+
const cell = row[index];
|
|
380
|
+
if (!canMove(cell)) continue;
|
|
381
|
+
const notFree = this.getNumOfNotFreeBasicDependentVars(cell.column, minNonFree, basic);
|
|
382
|
+
const columnSize = this.matrix.columns[cell.column].length;
|
|
383
|
+
if (notFree < minNonFree || (notFree === minNonFree && columnSize < bestColumnSize)) {
|
|
384
|
+
minNonFree = notFree;
|
|
385
|
+
bestColumnSize = columnSize;
|
|
386
|
+
choice = index;
|
|
387
|
+
numChoices = 1;
|
|
388
|
+
} else if (
|
|
389
|
+
notFree === minNonFree &&
|
|
390
|
+
columnSize === bestColumnSize &&
|
|
391
|
+
this.settings.getRandomNext(++numChoices) === 0
|
|
392
|
+
)
|
|
393
|
+
choice = index;
|
|
394
|
+
}
|
|
395
|
+
if (choice === -1) {
|
|
396
|
+
this.infRowIndex = rowIndex;
|
|
397
|
+
return undefined;
|
|
398
|
+
}
|
|
399
|
+
return row[choice];
|
|
400
|
+
}
|
|
401
|
+
|
|
402
|
+
private getValForLeaving(column: number) {
|
|
403
|
+
switch (this.columnTypes.get(column)) {
|
|
404
|
+
case COLUMN_FIXED:
|
|
405
|
+
case COLUMN_UPPER:
|
|
406
|
+
return this.upperBounds[column];
|
|
407
|
+
case COLUMN_BOXED:
|
|
408
|
+
return this.x[column].compare(this.upperBounds[column]) > 0
|
|
409
|
+
? this.upperBounds[column]
|
|
410
|
+
: this.lowerBounds[column];
|
|
411
|
+
default:
|
|
412
|
+
return this.lowerBounds[column];
|
|
413
|
+
}
|
|
414
|
+
}
|
|
415
|
+
|
|
416
|
+
private oneIterationTableauRows() {
|
|
417
|
+
if (this.infHeap.size === 0) {
|
|
418
|
+
this.status = LP_OPTIMAL;
|
|
419
|
+
return;
|
|
420
|
+
}
|
|
421
|
+
const leaving = this.infHeap.getMin();
|
|
422
|
+
if (!this.isBlandMode) {
|
|
423
|
+
if (this.leftBasis.has(leaving)) {
|
|
424
|
+
if (++this.leftBasisRepeated > BLAND_MODE_THRESHOLD) this.isBlandMode = true;
|
|
425
|
+
} else this.leftBasis.add(leaving);
|
|
426
|
+
}
|
|
427
|
+
const enteringCell = this.findBeneficialEntering(this.heading[leaving]);
|
|
428
|
+
if (enteringCell === undefined) {
|
|
429
|
+
this.status = LP_INFEASIBLE;
|
|
430
|
+
return;
|
|
431
|
+
}
|
|
432
|
+
if (this.settings.isCanceled()) {
|
|
433
|
+
this.status = LP_CANCELLED;
|
|
434
|
+
return;
|
|
435
|
+
}
|
|
436
|
+
const entering = enteringCell.column;
|
|
437
|
+
const newValue = this.getValForLeaving(leaving);
|
|
438
|
+
const theta = this.x[leaving].sub(newValue).div(enteringCell.coeff);
|
|
439
|
+
this.x[leaving] = newValue;
|
|
440
|
+
this.infHeap.erase(leaving);
|
|
441
|
+
this.x[entering] = this.x[entering].add(theta);
|
|
442
|
+
for (const cell of this.matrix.columns[entering]) {
|
|
443
|
+
const basic = this.basis[cell.row];
|
|
444
|
+
if (basic !== leaving)
|
|
445
|
+
this.submulFromXAndTrackFeasibility(basic, theta, this.matrix.getVal(cell));
|
|
446
|
+
}
|
|
447
|
+
this.pivotColumnTableau(entering, this.heading[leaving]);
|
|
448
|
+
this.changeBasis(entering, leaving);
|
|
449
|
+
this.trackColumnFeasibility(entering);
|
|
450
|
+
if (this.isFeasible()) this.status = LP_OPTIMAL;
|
|
451
|
+
}
|
|
452
|
+
|
|
453
|
+
// lp_primal_core_solver::solve, looking only for a feasible solution.
|
|
454
|
+
private solveTableau() {
|
|
455
|
+
if (this.isFeasible()) {
|
|
456
|
+
this.status = LP_FEASIBLE;
|
|
457
|
+
return;
|
|
458
|
+
}
|
|
459
|
+
this.isBlandMode = false;
|
|
460
|
+
this.leftBasis.clear();
|
|
461
|
+
this.leftBasisRepeated = 0;
|
|
462
|
+
do {
|
|
463
|
+
if (this.settings.isCanceled()) {
|
|
464
|
+
this.status = LP_CANCELLED;
|
|
465
|
+
return;
|
|
466
|
+
}
|
|
467
|
+
this.oneIterationTableauRows();
|
|
468
|
+
} while (
|
|
469
|
+
this.status !== LP_OPTIMAL &&
|
|
470
|
+
this.status !== LP_INFEASIBLE &&
|
|
471
|
+
this.status !== LP_CANCELLED &&
|
|
472
|
+
!this.isFeasible()
|
|
473
|
+
);
|
|
474
|
+
}
|
|
475
|
+
|
|
476
|
+
// lar_core_solver::solve.
|
|
477
|
+
solve() {
|
|
478
|
+
if (this.isFeasible()) {
|
|
479
|
+
this.status = LP_OPTIMAL;
|
|
480
|
+
return;
|
|
481
|
+
}
|
|
482
|
+
this.status = LP_UNKNOWN;
|
|
483
|
+
this.solveTableau();
|
|
484
|
+
if (this.status === LP_INFEASIBLE) {
|
|
485
|
+
const basic = this.basis[this.infRowIndex];
|
|
486
|
+
this.infeasibleSumSign = this.infSignOfColumn(basic);
|
|
487
|
+
this.infeasibleCombination = this.matrix.rows[this.infRowIndex].map((cell) => [
|
|
488
|
+
cell.coeff,
|
|
489
|
+
cell.column,
|
|
490
|
+
]);
|
|
491
|
+
} else if (this.status !== LP_CANCELLED) this.status = LP_OPTIMAL;
|
|
492
|
+
}
|
|
493
|
+
|
|
494
|
+
pushScope() {
|
|
495
|
+
this.columnTypes.pushScope();
|
|
496
|
+
}
|
|
497
|
+
|
|
498
|
+
popScope(count: number) {
|
|
499
|
+
this.columnTypes.popScope(count);
|
|
500
|
+
const columnCount = this.matrix.getColumnCount();
|
|
501
|
+
this.x.length = columnCount;
|
|
502
|
+
this.infeasibleCombination = [];
|
|
503
|
+
}
|
|
504
|
+
}
|