opt Directory Reference

Directory dependency graph for opt:

Directories
	de

Files
	bisection_solver.h
	Binary search for the smallest, or largest, feasible value of ONE variable.
	decomposition.h
	Solving a large problem as a sequence of smaller ones.
	evaluator.h
	Solves the model at one point of the variable space.
	layered_variables.h
	The decision variables of a layered queueing network.
	line_opt_solver.h
	The optimizer: search the variable space for the best feasible point.
	objectives.h
	The objectives to minimize and the constraints to respect.
	pareto.h
	The epsilon-constraint sweep: one Pareto front from a sequence of solves.
	problem.h
	The optimization problem: a model, the decision variables to search over, an objective, and the constraints a solution must satisfy.
	results.h
	What an evaluation and a solve return.
	sensitivity.h
	Parametric sensitivities of a solved network, as optimizer input.
	variables.h
	The decision variables of a flat queueing network.