LocalSolver’s Modeler (LSP)¶
The goal of an LSP program is to build the syntax tree of the LocalSolver model and to parametrize its resolution. The model is defined with dedicated operators and keywords (minimize, maximize, constraint). To support the definition of this model, the LSP language offers a set of functionalities for imperative and structured programming (loops, conditions, variables…).
The LocalSolver modeler is both a modeling language and a programming language: it is strongly typed and has a dynamic type system (the type is held by the value, not by the variable). It supports multiple programming paradigms (imperative, procedural and object-oriented) and many built-in features can be used both for modeling and for programming.
- Quick tour of LocalSolver’s modeler
- Syntax and lexical analysis
- Values and types
- Command line
- Main mode
- Standard library