/usr/include/polymake/polytope/lrs_interface.h is in libpolymake-dev-common 3.2r2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 | /* Copyright (c) 1997-2018
Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany)
http://www.polymake.org
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
--------------------------------------------------------------------------------
*/
#ifndef POLYMAKE_POLYTOPE_LRS_INTERFACE_H
#define POLYMAKE_POLYTOPE_LRS_INTERFACE_H
#include "polymake/Rational.h"
#include "polymake/Matrix.h"
#include "polymake/Vector.h"
#include "polymake/Bitset.h"
#include "polymake/polytope/lpch_dispatcher.h"
namespace polymake { namespace polytope { namespace lrs_interface {
class solver {
public:
typedef Rational coord_type;
typedef std::pair< Matrix<Rational>, Matrix<Rational> > matrix_pair;
/// @retval first: facets, second: affine hull
matrix_pair
enumerate_facets(const Matrix<Rational>& Points, const Matrix<Rational>& Lineality, const bool isCone = false, const bool primal = false);
// only used for lrs
long
count_facets(const Matrix<Rational>& Points,const Matrix<Rational>& Lineality, const bool isCone = false);
// FIXME argument 3 unused, for consitency with cdd_interface
// as cdd does not return the origin for cones represented as polyhedra
matrix_pair
enumerate_vertices(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, bool isCone = false, const bool primal = true);
// verts: pair of integers: first: number of vertices
// second: number of bounded vertices
// the first entry is 0 if only N_BOUNDED_VERTICES is requested
// (doing this for a cone leads to an error
// lin: dimension (== num of generators) for lineality space
// only used for lrs
struct vertex_count { std::pair<long,long> verts; long lin; };
// only used for lrs
vertex_count
count_vertices(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations,
bool only_bounded=false);
typedef std::pair<Bitset, Matrix<Rational> > non_redundant;
/// @retval first: indices of vertices, second: affine hull (primal)
/// @retval first: indices of facets, second: lineality space (dual)
// function only works for pointed objects: lrs does not remove generators in the lineality space from input
non_redundant find_irredundant_representation(const Matrix<Rational>& Points, const Matrix<Rational>& Lineality, const bool dual);
Vector<Rational>
find_a_vertex(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations);
bool check_feasibility(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations);
bool check_feasibility(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations, Vector<Rational>& ValidPoint);
typedef std::pair<Rational, Vector<Rational> > lp_solution;
/// @retval first: objective value, second: solution
lp_solution
solve_lp(const Matrix<Rational>& Inequalities, const Matrix<Rational>& Equations,
const Vector<Rational>& Objective, bool maximize, int* linearity_dim_p = 0);
private:
struct dictionary;
};
} } }
#endif // POLYMAKE_POLYTOPE_LRS_INTERFACE_H
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|