HomeSort by: relevance | last modified time | path
    Searched refs:simplex (Results 1 - 3 of 3) sorted by relevancy

  /src/external/mit/isl/dist/
isl_vertices_private.h 62 isl_stat (*fn)(__isl_take isl_cell *simplex, void *user), void *user);
isl_vertices.c 1447 /* Construct a simplex isl_cell spanned by the vertices with indices in
1452 isl_stat (*fn)(__isl_take isl_cell *simplex, void *user), void *user)
1456 struct isl_cell *simplex; local
1460 simplex = isl_calloc_type(ctx, struct isl_cell);
1461 if (!simplex)
1463 simplex->vertices = isl_vertices_copy(cell->vertices);
1464 if (!simplex->vertices)
1466 simplex->dom = isl_basic_set_copy(cell->dom);
1467 if (!simplex->dom)
1469 simplex->n_vertices = n_simplex + n_other
    [all...]
  /src/external/mit/isl/dist/doc/
implementation.tex 175 In the following sections, we briefly recall the dual simplex
183 \subsection{The Dual Simplex Method}
186 In {\tt isl}, the dual simplex method uses the same representation
188 simplex method. The implementation of this LP solver is based
213 The dual simplex method starts from an initial sample value that
270 The solution found by the dual simplex method may have
369 of the actual dual simplex method with Gomory cuts.
474 the dual simplex method.
562 implementation uses a recursive call to the dual simplex with Gomory
618 \subsubsection{Dual Simplex + Gomory Cuts
    [all...]

Completed in 18 milliseconds