![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
The decision variables of a flat queueing network. More...
#include <algorithm>#include <cmath>#include <memory>#include <optional>#include <string>#include <vector>#include "line/lang/lqn/lqn_reader.h"#include "line/lang/qn/network_builder.h"#include "line/opt/results.h"#include "line/util/error.h"Go to the source code of this file.
Classes | |
| class | line::opt::DecisionVariable |
| class | line::opt::ServerAllocation |
| class | line::opt::StationReplicas |
| class | line::opt::ServiceRate |
| class | line::opt::JobPopulation |
| class | line::opt::RoutingProbabilities |
| class | line::opt::ClassPriority |
| class | line::opt::ClassServiceMapping |
Namespaces | |
| namespace | line |
| namespace | line::opt |
Typedefs | |
| using | line::opt::VariablePtr = std::shared_ptr<DecisionVariable> |
The decision variables of a flat queueing network.
A DecisionVariable is a named box with a dimension and a bounded domain. The search works in a normalized [0,1] space and decode maps a point of that space onto the model quantity, so an integer variable, a rate and a probability simplex are all the same thing to the optimizer.
ServerAllocation and StationReplicas are integer counts, ServiceRate and JobPopulation continuous, RoutingProbabilities a simplex whose decode renormalizes, ClassPriority an integer ranking, and ClassServiceMapping an assignment. The layered counterparts live in layered_variables.h.
Definition in file variables.h.