pareto.h File Reference

The epsilon-constraint sweep: one Pareto front from a sequence of solves. More...

#include <algorithm>
#include <functional>
#include <string>
#include <utility>
#include <vector>
#include "line/opt/bisection_solver.h"
#include "line/opt/line_opt_solver.h"

Include dependency graph for pareto.h:

Go to the source code of this file.

Classes
struct	line::opt::ParetoPoint
class	line::opt::ParetoSweep

Namespaces
namespace	line
namespace	line::opt

Detailed Description

The epsilon-constraint sweep: one Pareto front from a sequence of solves.

A second objective is turned into a constraint whose bound is swept, and the problem is re-solved at each value. ConstraintFactory builds the constraint for a given epsilon, so the caller decides which quantity is being traded away. Each ParetoPoint records its epsilon, the objective reached, whether the solve was feasible, and the full OptimizationResult behind it.

The inner solve is de (the differential evolution of line_opt_solver.h) or bisection; any other name is refused at construction rather than at the first solve.

Definition in file pareto.h.