splitSolutionToBins

<code>splitSolutionToBins</code> is an internal function for converting a paritioning problem solution to indices.

internal

Uses the optimal test design approach by Birnbaum (1968, ISBN:9781593119348) and
van der Linden (2018) <doi:10.1201/9781315117430> to construct fixed, adaptive, and parallel tests.
Supports the following mixed-integer programming (MIP) solver packages: 'Rsymphony',
'highs', 'gurobi', 'lpSolve', and 'Rglpk'. The 'gurobi' package is not available from CRAN; see <https://www.gurobi.com/downloads/>.

Seung W. Choi

TestDesign

Optimal Test Design Approach to Fixed and Adaptive Test
Construction

Sangdon Lim

splitSolutionToBins function

<dl><dt>solution</dt>
<dd>the solution vector from the solver.</dd>
<dt>n_bins</dt>
<dd>the number of bins (i.e., partitions)</dd>
<dt>ni_per_bin</dt>
<dd>the number of decision variables for items in each bin.
This is the number of items in the pool.</dd>
<dt>nv_per_bin</dt>
<dd>the number of decision variables for items+sets in each bin.
This is the number of items in the pool plus the number of sets.
The deviation variable is not counted here.</dd></dl>

Arguments

(Internal) Convert a partitioning problem solution to indices — splitSolutionToBins

<dl>

<dt>solution</dt>
<dd>the solution vector from the solver.</dd>


<dt>n_bins</dt>
<dd>the number of bins (i.e., partitions)</dd>


<dt>ni_per_bin</dt>
<dd>the number of decision variables for items in each bin.
This is the number of items in the pool.</dd>


<dt>nv_per_bin</dt>
<dd>the number of decision variables for items+sets in each bin.
This is the number of items in the pool plus the number of sets.
The deviation variable is not counted here.</dd>

</dl>

splitSolutionToBins: (Internal) Convert a partitioning problem solution to indices

Description

Usage

Value

Arguments