Home
last modified time | relevance | path

Searched refs:Inequalities (Results 1 – 25 of 116) sorted by relevance

12345

/dports/math/polymake/polymake-4.5/apps/polytope/src/
H A Dhypertruncated_cube.cc36 Matrix<Scalar> Inequalities(n_ineqs, d+1); in hypertruncated_cube() local
41 Inequalities(i,j) = 1; in hypertruncated_cube()
45 Inequalities(i,0) = 1; Inequalities(i,j) = -1; in hypertruncated_cube()
50 Inequalities(i,0)=k; in hypertruncated_cube()
52 Inequalities(i,jj) = -1; in hypertruncated_cube()
53 Inequalities(i,j) = d-1-k/lambda; in hypertruncated_cube()
55 Inequalities(i,jj)=-1; in hypertruncated_cube()
60 Inequalities(i,0) = lambda*(d-k); in hypertruncated_cube()
62 Inequalities(i,jj) = lambda-1; in hypertruncated_cube()
63 Inequalities(i,j)=k-1-lambda*(d-1); in hypertruncated_cube()
[all …]
H A Dprojection.cc28 Matrix<Scalar> Inequalities; in process_facets() local
32 if (p_in.lookup("FACETS | INEQUALITIES") >> Inequalities) { in process_facets()
34 Inequalities /= linear_span / (-linear_span); in process_facets()
42 for (Int i = 0; i < Inequalities.rows(); ++i) { in process_facets()
43 const Scalar x = Inequalities(i, *c); in process_facets()
52 Inequalities[i] /= abs(x); in process_facets()
55 const Set<Int> remaining_coords = range(0, Inequalities.cols()-1)-(*c); in process_facets()
56 Inequalities = Inequalities.minor(All,remaining_coords); in process_facets()
60 Combined_Ineqs /= Inequalities[*i]+Inequalities[*k]; in process_facets()
66 Inequalities = Combined_Ineqs; in process_facets()
[all …]
H A Dcore_point_algo.cc26 bool feasible(const Vector<Rational>& point, const Matrix<Rational>& Inequalities)
28 for (auto i=entire(rows(Inequalities)); !i.at_end(); ++i)
48 ListReturn find_transitive_lp_sol(const Matrix<Rational>& Inequalities) in conway_core()
50 const Int N_cols = Inequalities.cols(); in conway_core()
57 for (auto i = entire(rows(Inequalities)); !i.at_end(); ++i) { in conway_core()
92 const Matrix<Rational> Inequalities = p.give("FACETS|INEQUALITIES"); in conway_gyro()
112 if (feasible(core_point,Inequalities)) { in conway_gyro()
139 const Matrix<Rational> Inequalities=p.give("FACETS|INEQUALITIES");
158 Vector<Rational> diff_vec(Inequalities.rows());
161 for (Int i = 0; i < Inequalities.rows(); ++i) { in conway()
[all …]
H A Dmax_GC_rank.cc38 Matrix<Int> Inequalities(n_ineqs, d+1); in max_GC_rank() local
39 auto i = rows(Inequalities).begin(); in max_GC_rank()
55 p.take("INEQUALITIES") << Inequalities; in max_GC_rank()
H A Dintersection.cc36 ListMatrix< Vector<Scalar> > Inequalities(0, dim), Equations(0, dim); in intersection() local
61 Inequalities /= F; in intersection()
73 "INEQUALITIES", Inequalities, in intersection()
H A Dbeneath_beyond.cc40 BeneathBeyondConvexHullSolver<Scalar>::enumerate_vertices(const Matrix<Scalar>& Inequalities, const… in enumerate_vertices() argument
44 algo.compute(Inequalities, Equations); in enumerate_vertices()
46 …if (!isCone && result.first.rows() == 0 && result.second.rows() == 0 && (Inequalities.rows() != 0 … in enumerate_vertices()
63 …lSolver<Scalar>::get_non_redundant_inequalities(const Matrix<Scalar>& Inequalities, const Matrix<S… in get_non_redundant_inequalities() argument
67 algo.compute(Inequalities, Equations); in get_non_redundant_inequalities()
H A Dpointed_part.cc58 Matrix<Scalar> Points, Inequalities, LinealitySpace; in pointed_part() local
105 else if(p_in.lookup("FACETS | INEQUALITIES") >> Inequalities) in pointed_part()
111 p_out.take("INEQUALITIES") << Inequalities; in pointed_part()
H A Duniversal_polytope_ilps.cc67 …const SparseMatrix<Scalar> Inequalities = zero_vector<Scalar>(n_reps) | unit_matrix<Scalar>(n_reps… in universal_polytope_impl() local
73 "INEQUALITIES", Inequalities, in universal_polytope_impl()
118 Inequalities = (zero_vector<Integer>(2*n) | unit_matrix<Integer>(2*n)) / in foldable_max_signature_ilp() local
133 "INEQUALITIES", Inequalities, in foldable_max_signature_ilp()
H A Dsymmetrized_universal_polytope_ilps.cc73 Inequalities = (zero_vector<Integer>(n2) | unit_matrix<Integer>(n2)) / in symmetrized_foldable_max_signature_ilp() local
89 "INEQUALITIES", Inequalities, in symmetrized_foldable_max_signature_ilp()
H A Dquotient_space_universal_polytope_ilps.cc126 Inequalities = zero_vector<Scalar>(n) | unit_matrix<Scalar>(n), in quotient_space_simplexity_ilp() local
148 "INEQUALITIES", Inequalities, in quotient_space_simplexity_ilp()
/dports/math/polymake/polymake-4.5/apps/fan/src/
H A Dunion_of_cones.cc43 ListMatrix< Vector<Scalar> > Inequalities(0, dim), Equations(0, dim); in arrangement_from_cones() local
67 Inequalities /= F; in arrangement_from_cones()
68 Inequalities /= AH; in arrangement_from_cones()
74 Inequalities /= AH; in arrangement_from_cones()
90 Inequalities /= extra_hyperplanes; in arrangement_from_cones()
93 …HA = BigObject("HyperplaneArrangement", mlist<Scalar>(), "HYPERPLANES", Inequalities, "SUPPORT", S… in arrangement_from_cones()
95 HA = BigObject("HyperplaneArrangement", mlist<Scalar>(), "HYPERPLANES", Inequalities); in arrangement_from_cones()
98 HA = BigObject("HyperplaneArrangement", mlist<Scalar>(), "HYPERPLANES", Inequalities); in arrangement_from_cones()
/dports/math/polymake/polymake-4.5/bundled/lrs/apps/polytope/include/
H A Dlrs_interface.h57 …enumerate_vertices(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, bool i…
66 …count_vertices(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, bool only_…
82 solve(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations,
85 …bool check_feasibility(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations) co…
86 …bool check_feasibility(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, Ve…
/dports/math/polymake/polymake-4.5/apps/polytope/include/
H A Dto_interface.h46 solve(const Matrix<Coord>& Inequalities, const Matrix<Coord>& Equations,
50 solve(const Matrix<Coord>& Inequalities, const Matrix<Coord>& Equations, in solve() argument
53 return Solver::solve(Inequalities, Equations, Objective, maximize, Set<Int>()); in solve()
160 Solver<Coord>::solve(const Matrix<Coord>& Inequalities, const Matrix<Coord>& Equations, in solve() argument
165 const Int n = Inequalities.cols()-1; // beware of leading constant term in solve()
169 const Int m = Inequalities.rows() + Equations.rows(); in solve()
191 …to_dual_fill_data(Inequalities, Equations, to_obj, to_coefficients, to_colinds, to_rowbegininds, t… in solve()
207 const Int m = Inequalities.rows() + Equations.rows(); in solve()
217 Int count = Inequalities.cols()-1; in solve()
/dports/math/polymake/polymake-4.5/bundled/lrs/apps/polytope/src/
H A Dlrs_interface.cc313 if (dual && Inequalities.cols() == 0 && Equations.cols() == 0) in dictionary()
337 Q->m=Inequalities.rows()+Equations.rows(); in dictionary()
338 Q->n=Inequalities.cols(); in dictionary()
350 if (Inequalities.rows()) set_matrix(Inequalities); in dictionary()
351 if (Equations.rows()) set_matrix(Equations, Inequalities.rows(), false); in dictionary()
516 dictionary D(Inequalities, Equations, true, verbose); in enumerate_vertices()
530 dictionary D(Inequalities, Equations, true, verbose); in count_vertices()
565 dictionary D(Inequalities, Equations,true); in check_feasibility()
571 dictionary D(Inequalities, Equations,true); in check_feasibility()
584 LP_Solver::solve(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, in solve() argument
[all …]
/dports/math/polymake/polymake-4.5/bundled/ppl/apps/polytope/include/
H A Dppl_interface_impl.h157 PPL::C_Polyhedron construct_ppl_polyhedron_H(const Matrix<Scalar>& Inequalities, const Matrix<Scala… in construct_ppl_polyhedron_H() argument
165 const Int dim = std::max(Inequalities.cols(), Equations.cols())-1; in construct_ppl_polyhedron_H()
170 for (auto row_it = entire(rows(Inequalities)); !row_it.at_end(); ++row_it) { in construct_ppl_polyhedron_H()
308 ConvexHullSolver<Scalar>::enumerate_vertices(const Matrix<Scalar>& Inequalities, const Matrix<Scala… in enumerate_vertices() argument
310 const Int num_columns = std::max(Inequalities.cols(), Equations.cols()); in enumerate_vertices()
314 if (!isCone && Inequalities.rows() + Equations.rows() == 0) in enumerate_vertices()
317 PPL::C_Polyhedron polyhedron = construct_ppl_polyhedron_H(Inequalities, Equations, isCone); in enumerate_vertices()
344 LP_Solver<Scalar>::solve(const Matrix<Scalar>& Inequalities, const Matrix<Scalar>& Equations, in solve() argument
352 const Int num_columns = std::max(Inequalities.cols(), Equations.cols())-1; in solve()
358 …PPL::C_Polyhedron polyhedron = construct_ppl_polyhedron_H(Inequalities, Equations, 0); // isCone =… in solve()
H A Dppl_interface.h32 …enumerate_vertices(const Matrix<Scalar>& Inequalities, const Matrix<Scalar>& Equations, const bool…
39 …solve(const Matrix<Scalar>& Inequalities, const Matrix<Scalar>& Equations, const Vector<Scalar>& O…
/dports/math/polymake/polymake-4.5/bundled/soplex/apps/polytope/include/
H A Dsoplex_interface.h37 solve(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations,
41 solve(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations,
44 return Solver::solve(Inequalities, Equations, Objective, maximize, Set<Int>());
/dports/math/gap/gap-4.11.0/pkg/RingsForHomalg-2019.12.08/gap/
H A DMapleHomalgInvolutive.gi36 Inequalities :=
42 …algSendBlocking( [ v, "l:=PolZeroSets()" ], R, "need_command", HOMALG_IO.Pictograms.Inequalities );
44 … homalgSendBlocking( [ "nops(", v, "l)" ], R, "need_output", HOMALG_IO.Pictograms.Inequalities ) );
46 …[ 1 .. l ], i -> homalgSendBlocking( [ v, "l[", i, "]" ], R, HOMALG_IO.Pictograms.Inequalities ) );
/dports/math/polymake/polymake-4.5/bundled/soplex/apps/polytope/src/
H A Dsoplex_interface.cc44 Solver::solve(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, in solve() argument
47 const Int dim = Inequalities.cols(), num_constr = Inequalities.rows() + Equations.rows(); in solve()
130 for (int i = 0; i < Inequalities.rows(); ++i) { in solve()
133 Rational val = Inequalities(i, j+1); in solve()
140 Rational val = -Inequalities(i, 0); in solve()
/dports/science/siconos/siconos-4.4.0/docs/sphinx/users_guide/problems_and_solvers/
H A Davi.rst2 single: Affine Variational Inequalities (AVI)
8 Affine Variational Inequalities (AVI)
65 Ref: "A structure-preserving Pivotal Method for Affine Variational Inequalities" Y. Kim, O. Huber, …
/dports/math/polymake/polymake-4.5/bundled/cdd/apps/polytope/include/
H A Dcdd_interface.h62 …enumerate_vertices(const Matrix<Scalar>& Inequalities, const Matrix<Scalar>& Equations, const bool…
84 solve(const Matrix<Scalar>& Inequalities, const Matrix<Scalar>& Equations,
H A Dcdd_interface_impl.h663 ConvexHullSolver<Scalar>::enumerate_vertices(const Matrix<Scalar>& Inequalities, const Matrix<Scala…
666 cdd_matrix<Scalar> IN(Inequalities, Equations, representation::H);
714 LP_Solver<Scalar>::solve(const Matrix<Scalar>& Inequalities, const Matrix<Scalar>& Equations,
719 cdd_matrix<Scalar> IN(Inequalities, Equations, representation::H);
732 result.status = Inequalities.rows() == 0 ? LP_status::infeasible : LP_status::unbounded;
734 cdd_matrix<Scalar> IN(Inequalities, Equations, representation::H);
735 const Vector<Scalar> unit = unit_vector<Scalar>(Inequalities.cols(), 0);
/dports/math/gap/gap-4.11.0/pkg/Toric-1.9.5/lib/
H A Dtoric.gi127 local n,Inequalities,R,i,j;
130 Inequalities:=[];
133 Add(Inequalities,D[i]+Sum([1..n],j->X(Rationals,j)*Rays[i][j]));
135 return Inequalities;
152 local R,n,M,Pts,i,j,Inequalities,L0,L1,L2,v,ineq;
161 Inequalities:=[];
164 Add(Inequalities,ineq);
166 if Minimum(Inequalities) >= 0 then Add(L2,v); fi;
185 local R,n,M,Pts,i,j,Inequalities,L0,L1,L2,v,ineq,Rays;
195 Inequalities:=List([1..Size(R)],i->D[i]+Sum([1..n],j->v[j]*R[i][j]));
[all …]
/dports/math/maxima/maxima-5.43.2/tests/wester_problems/
H A Dtest_inequalities.mac2 * and retrieved from http://www.math.unm.edu/~wester/demos/Inequalities/problems.macsyma
18 /* ---------- Inequalities ---------- */
/dports/graphics/dataplot/dataplot-2c1b27601a3b7523449de612613eadeead9a8f70/lib/frmenus/dp/
H A Dresewoch.top11 Inequalities (math) : < > <= >=

12345