pub struct GPProblem {
pub objective: Posynomial,
pub ineq_constraints: Vec<Posynomial>,
pub eq_constraints: Vec<Monomial>,
}Expand description
A Geometric Program in standard form:
minimise objective(x)
subject to ineq_constraints[i](x) ≤ 1, i = 0 … m-1
eq_constraints[j](x) = 1, j = 0 … p-1Equality constraints are monomials (single-term posynomials).
Fields§
§objective: PosynomialObjective posynomial f₀.
ineq_constraints: Vec<Posynomial>Inequality constraints fᵢ(x) ≤ 1.
eq_constraints: Vec<Monomial>Equality constraints hⱼ(x) = 1 (must each be a single monomial).
Implementations§
Source§impl GPProblem
impl GPProblem
Sourcepub fn new(
objective: Posynomial,
ineq_constraints: Vec<Posynomial>,
eq_constraints: Vec<Monomial>,
) -> OptimizeResult<Self>
pub fn new( objective: Posynomial, ineq_constraints: Vec<Posynomial>, eq_constraints: Vec<Monomial>, ) -> OptimizeResult<Self>
Create a GP problem.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GPProblem
impl RefUnwindSafe for GPProblem
impl Send for GPProblem
impl Sync for GPProblem
impl Unpin for GPProblem
impl UnsafeUnpin for GPProblem
impl UnwindSafe for GPProblem
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.