pub struct ContinuousOptimizationProblem { /* private fields */ }Expand description
Continuous optimization problem
Implementations§
Source§impl ContinuousOptimizationProblem
impl ContinuousOptimizationProblem
Sourcepub fn new(objective: ObjectiveFunction) -> Self
pub fn new(objective: ObjectiveFunction) -> Self
Create a new continuous optimization problem
Sourcepub fn add_variable(
&mut self,
variable: ContinuousVariable,
) -> ContinuousVariableResult<()>
pub fn add_variable( &mut self, variable: ContinuousVariable, ) -> ContinuousVariableResult<()>
Add a variable to the problem
Sourcepub fn add_constraint(&mut self, constraint: ContinuousConstraint)
pub fn add_constraint(&mut self, constraint: ContinuousConstraint)
Add a constraint to the problem
Sourcepub const fn set_default_penalty_weight(&mut self, weight: f64)
pub const fn set_default_penalty_weight(&mut self, weight: f64)
Set default penalty weight
Sourcepub fn total_binary_variables(&self) -> usize
pub fn total_binary_variables(&self) -> usize
Get total number of binary variables needed
Sourcepub fn create_binary_mapping(&self) -> HashMap<String, Vec<usize>>
pub fn create_binary_mapping(&self) -> HashMap<String, Vec<usize>>
Create binary variable mapping
Sourcepub fn binary_to_continuous_solution(
&self,
binary_solution: &[i8],
) -> ContinuousVariableResult<HashMap<String, f64>>
pub fn binary_to_continuous_solution( &self, binary_solution: &[i8], ) -> ContinuousVariableResult<HashMap<String, f64>>
Convert binary solution to continuous values
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ContinuousOptimizationProblem
impl !RefUnwindSafe for ContinuousOptimizationProblem
impl Send for ContinuousOptimizationProblem
impl Sync for ContinuousOptimizationProblem
impl Unpin for ContinuousOptimizationProblem
impl !UnwindSafe for ContinuousOptimizationProblem
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.