 |
Visual Servoing Platform
version 3.3.0
|
45 #include <visp3/core/vpConfig.h>
46 #include <visp3/core/vpColVector.h>
47 #include <visp3/core/vpMatrix.h>
70 #if (VISP_CXX_STANDARD >= VISP_CXX_STANDARD_11)
131 std::vector<BoundedIndex> l = {},
132 std::vector<BoundedIndex> u = {},
133 const double &tol = 1e-6);
140 static bool colReduction(
vpMatrix &A,
vpColVector &b,
bool full_rank =
false,
const double &tol = 1e-6);
157 for(
unsigned int i = 0; i < x.
getRows(); ++i)
159 if(std::abs(x[i]) > tol)
177 for(
unsigned int i = 0; i < b.
getRows(); ++i)
179 if(std::abs(A.
getRow(i)*x - b[i]) > tol)
196 for(
unsigned int i = 0; i < d.getRows(); ++i)
198 if(C.
getRow(i)*x - d[i] > thr)
214 for(
unsigned int i = 0; i < x.
getRows(); ++i)
232 for(
unsigned int i = 0; i < x.
getRows(); ++i)
vpRowVector getRow(unsigned int i) const
static bool allLesser(const vpMatrix &C, const vpColVector &x, const vpColVector &d, const double &thr=1e-6)
This class provides two solvers for Linear Programs.
static bool allZero(const vpColVector &x, const double &tol=1e-6)
Implementation of column vector and the associated operations.
Implementation of a matrix and operations on matrices.
static bool allGreater(const vpColVector &x, const double &thr=1e-6)
static bool allLesser(const vpColVector &x, const double &thr=1e-6)
std::pair< unsigned int, double > BoundedIndex
static bool allClose(const vpMatrix &A, const vpColVector &x, const vpColVector &b, const double &tol=1e-6)
unsigned int getRows() const