CGAL::make_nonnegative_linear_program_from_iterators

#include <CGAL/QP_models.h>

This template function creates an instance of Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it> from given iterators. This function can be useful if the types of these iterators are too complicated (or of too little interest for you) to write them down explicitly.

template < A_it, B_it, R_it, C_it >
Nonnegative_linear_program_from_iterators <A_it, B_it, R_it, C_it>
make_nonnegative_linear_program_from_iterators ( int n,
int m,
A_it a,
B_it b,
R_it r,
C_it c,
std::iterator_traits<C_it>::value_type c0 = std::iterator_traits<C_it>::value_type(0))
returns an instance of Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>, constructed from the given iterators.

Example

QP_solver/solve_convex_hull_containment_lp2.h
QP_solver/convex_hull_containment2.cpp

See Also

Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>