Struct DebRules 

pub struct DebRules<P>(pub P);

Deb’s feasibility rules (Deb 2000) as a Problem adapter.

Ranking induced: feasible by objective, then infeasible by total violation — every feasible point beats every infeasible one. Works with any forge optimizer; exact whenever feasible objectives stay below FEASIBLE_CEILING.

use forge_core::constraint::{constrained_func, DebRules};
use forge_core::{De, Optimizer, Termination};

// Minimize x + y subject to x·y ≥ 1 on [0, 10]².
let p = constrained_func(
    vec![(0.0, 10.0); 2],
    |x| x[0] + x[1],
    |x| vec![(1.0 - x[0] * x[1]).max(0.0)],
);
let report = De::default().optimize(&DebRules(p), &Termination::budget(6000));
assert!((report.best_value() - 2.0).abs() < 1e-2); // optimum at (1, 1)

Tuple Fields

0: P

Trait Implementations

impl<P: ConstrainedProblem> Problem for DebRules<P>

fn dim(&self) -> usize

Number of decision variables.

fn bounds(&self) -> &[Bound]

Per-variable inclusive bounds, length Problem::dim.

fn objective(&self, x: &[f64]) -> f64

Objective value to minimize. A non-finite return marks the point as infeasible; optimizers will reject it rather than crash.