FiniteSet

Constrain each entry of an Expression to take a value in a given
finite set of real numbers.

An object-oriented modeling language for disciplined
convex programming (DCP) as described in Fu, Narasimhan, and Boyd
(2020, <doi:10.18637/jss.v094.i14>). It allows the user to
formulate convex optimization problems in a natural way following
mathematical convention and DCP rules. The system analyzes the
problem, verifies its convexity, converts it into a canonical
form, and hands it off to an appropriate solver to obtain the
solution. This version uses the S7 object system for improved
performance and maintainability.

Anqi Fu

CVXR

Disciplined Convex Optimization

Balasubramanian Narasimhan

Steven Diamond

John Miller

Stephen Boyd

FiniteSet function

<dl><dt>expre</dt>
<dd>An affine Expression.</dd>
<dt>vec</dt>
<dd>A numeric vector (or set) of allowed values.</dd>
<dt>ineq_form</dt>
<dd>Logical; controls MIP canonicalization strategy.
If <code>FALSE</code> (default), uses equality formulation (one-hot binary).
If <code>TRUE</code>, uses inequality formulation (sorted differences + ordering).</dd>
<dt>constr_id</dt>
<dd>Optional integer constraint ID (internal use).</dd></dl>

Arguments

FiniteSet Constraint — FiniteSet

<dl>

<dt>expre</dt>
<dd>An affine Expression.</dd>


<dt>vec</dt>
<dd>A numeric vector (or set) of allowed values.</dd>


<dt>ineq_form</dt>
<dd>Logical; controls MIP canonicalization strategy.
If <code>FALSE</code> (default), uses equality formulation (one-hot binary).
If <code>TRUE</code>, uses inequality formulation (sorted differences + ordering).</dd>


<dt>constr_id</dt>
<dd>Optional integer constraint ID (internal use).</dd>

</dl>

FiniteSet: FiniteSet Constraint

Description

Usage

Value

Arguments