Struct smoothed_online_convex_optimization::problem::SmoothedBalancedLoadOptimization [−][src]
pub struct SmoothedBalancedLoadOptimization<'a, T> {
pub d: i32,
pub t_end: i32,
pub bounds: Vec<T>,
pub switching_cost: Vec<f64>,
pub hitting_cost: Vec<FailableCostFn<'a, f64, DataCenterModelOutputFailure>>,
pub load: Vec<T>,
}
Expand description
Smoothed Balanced-Load Optimization (SBLO).
- SSCO
- hitting costs are computed by balancing incoming loads across all dimensions each of which is described by a convex cost function
Fields
d: i32
Number of dimensions.
t_end: i32
Finite, positive time horizon.
bounds: Vec<T>
Vector of upper bounds of each dimension.
switching_cost: Vec<f64>
Vector of positive real constants resembling the switching cost of each dimension.
hitting_cost: Vec<FailableCostFn<'a, f64, DataCenterModelOutputFailure>>
Positive increasing cost functions for each dimension.
load: Vec<T>
Non-negative load at each time step.
Implementations
pub fn into_ssco(
self
) -> SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>
pub fn into_ssco(
self
) -> SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>
Convert to an instance of Simplified Smoothed Convex Optimization.
Trait Implementations
impl<'a, T> Model<T, SmoothedBalancedLoadOptimization<'a, T>, DataCenterOfflineInput, DataCenterOnlineInput, DataCenterModelOutputSuccess, DataCenterModelOutputFailure> for DataCenterModel where
T: Value<'a>,
impl<'a, T> Model<T, SmoothedBalancedLoadOptimization<'a, T>, DataCenterOfflineInput, DataCenterOnlineInput, DataCenterModelOutputSuccess, DataCenterModelOutputFailure> for DataCenterModel where
T: Value<'a>,
Notes:
- Only allows for a single location, source, and job type.
fn update(
&self,
o: &mut Online<SmoothedBalancedLoadOptimization<'a, T>>,
_: DataCenterOnlineInput
)
fn update(
&self,
o: &mut Online<SmoothedBalancedLoadOptimization<'a, T>>,
_: DataCenterOnlineInput
)
Performs an online update of the given problem instance $o$ with some $input$ (which may be uncertain).
impl<'a, T> Problem<T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure> for SmoothedBalancedLoadOptimization<'a, T> where
T: Value<'a>,
impl<'a, T> Problem<T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure> for SmoothedBalancedLoadOptimization<'a, T> where
T: Value<'a>,
fn hit_cost(
&self,
t: i32,
x: Config<T>
) -> Cost<DataCenterModelOutputSuccess, DataCenterModelOutputFailure>
fn hit_cost(
&self,
t: i32,
x: Config<T>
) -> Cost<DataCenterModelOutputSuccess, DataCenterModelOutputFailure>
Hitting cost.
Objective function. Calculates the cost of a schedule.
fn inverted_objective_function<'a>(
&self,
xs: &Schedule<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn inverted_objective_function<'a>(
&self,
xs: &Schedule<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
Inverted Objective function. Calculates the cost of a schedule. Pays the switching cost for powering down rather than powering up. Read more
$\alpha$-unfair Objective function. Calculates the cost of a schedule.
Objective function starting from an initial configuration other than $\mathbf{0}$.
fn _objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>,
alpha: f64,
inverted: bool
) -> Result<Cost<C, D>> where
T: Value<'a>,
Movement in the decision space.
Auto Trait Implementations
impl<'a, T> !RefUnwindSafe for SmoothedBalancedLoadOptimization<'a, T>
impl<'a, T> Send for SmoothedBalancedLoadOptimization<'a, T> where
T: Send,
impl<'a, T> Sync for SmoothedBalancedLoadOptimization<'a, T> where
T: Sync,
impl<'a, T> Unpin for SmoothedBalancedLoadOptimization<'a, T> where
T: Unpin,
impl<'a, T> !UnwindSafe for SmoothedBalancedLoadOptimization<'a, T>
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.