![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
line/opt – decision variables, objectives, constraints and the solvers that search over a model's parameters.
More...
Files | |
| file | include/line/opt/bisection_solver.h |
| Binary search for the smallest, or largest, feasible value of ONE variable. | |
| file | include/line/opt/de/differential_evolution.h |
| Port of matlab/src/opt/+opt/+de/DifferentialEvolution.m. | |
| file | include/line/opt/de/mt19937.h |
| Bit-exact port of matlab/src/opt/+opt/+de/MT19937.m. | |
| file | include/line/opt/de/numpy_random_state.h |
| Bit-exact port of matlab/src/opt/+opt/+de/NumpyRandomState.m. | |
| file | include/line/opt/decomposition.h |
| Solving a large problem as a sequence of smaller ones. | |
| file | include/line/opt/evaluator.h |
| Solves the model at one point of the variable space. | |
| file | include/line/opt/layered_variables.h |
| The decision variables of a layered queueing network. | |
| file | include/line/opt/line_opt_solver.h |
| The optimizer: search the variable space for the best feasible point. | |
| file | include/line/opt/objectives.h |
| The objectives to minimize and the constraints to respect. | |
| file | include/line/opt/pareto.h |
| The epsilon-constraint sweep: one Pareto front from a sequence of solves. | |
| file | include/line/opt/problem.h |
| The optimization problem: a model, the decision variables to search over, an objective, and the constraints a solution must satisfy. | |
| file | include/line/opt/results.h |
| What an evaluation and a solve return. | |
| file | include/line/opt/sensitivity.h |
| Parametric sensitivities of a solved network, as optimizer input. | |
| file | include/line/opt/variables.h |
| The decision variables of a flat queueing network. | |
line/opt – decision variables, objectives, constraints and the solvers that search over a model's parameters.