module Ppl_ocaml_globals: sig
.. end
exception PPL_arithmetic_overflow of string
exception PPL_timeout_exception
exception PPL_internal_error of string
exception PPL_unknown_standard_exception of string
exception PPL_unexpected_error of string
type
degenerate_element =
type
linear_expression =
type
linear_constraint =
type
linear_generator =
type
linear_grid_generator =
type
poly_gen_relation =
type
poly_con_relation =
| |
Is_Disjoint |
| |
Strictly_Intersects |
| |
Is_Included |
| |
Saturates |
type
relation_with_congruence =
| |
Is_Disjoint |
| |
Strictly_Intersects |
| |
Is_Included |
type
linear_congruence = linear_expression * linear_expression *
Gmp.Z.t
type
constraint_system = linear_constraint list
type
generator_system = linear_generator list
type
grid_generator_system = linear_grid_generator list
type
congruence_system = linear_congruence list
type
relation_symbol =
| |
Less_Than_RS |
| |
Less_Or_Equal_RS |
| |
Equal_RS |
| |
Greater_Than_RS |
| |
Greater_Or_Equal_RS |
type
complexity_class =
| |
Polynomial_Complexity |
| |
Simplex_Complexity |
| |
Any_Complexity |
type
optimization_mode =
| |
Minimization |
| |
Maximization |
type
mip_problem_status =
| |
Unfeasible_Mip_Problem |
| |
Unbounded_Mip_Problem |
| |
Optimized_Mip_Problem |
type
control_parameter_name =
type
control_parameter_value =
| |
Pricing_Steepest_Edge_Float |
| |
Pricing_Steepest_Edge_Exact |
| |
Pricing_Textbook |
val ppl_version_major : unit -> int
val ppl_version_minor : unit -> int
val ppl_version_revision : unit -> int
val ppl_version_beta : unit -> int
val ppl_version : unit -> string
val ppl_banner : unit -> string
val ppl_io_wrap_string : string -> int -> int -> int -> string
val ppl_max_space_dimension : unit -> int
val ppl_Coefficient_is_bounded : unit -> bool
val ppl_Coefficient_max : unit -> Gmp.Z.t
val ppl_Coefficient_min : unit -> Gmp.Z.t
val ppl_set_rounding_for_PPL : unit -> unit
val ppl_restore_pre_PPL_rounding : unit -> unit
val ppl_set_timeout : int -> unit
val ppl_reset_timeout : unit -> unit
type
mip_problem
val ppl_new_MIP_Problem_from_space_dimension : int -> mip_problem
val ppl_new_MIP_Problem : int ->
constraint_system ->
linear_expression ->
optimization_mode -> mip_problem
val ppl_MIP_Problem_space_dimension : mip_problem -> int
val ppl_MIP_Problem_integer_space_dimensions : mip_problem -> int list
val ppl_MIP_Problem_constraints : mip_problem -> constraint_system
val ppl_MIP_Problem_add_space_dimensions_and_embed : mip_problem -> int -> unit
val ppl_MIP_Problem_add_to_integer_space_dimensions : mip_problem -> int list -> unit
val ppl_MIP_Problem_add_constraint : mip_problem -> linear_constraint -> unit
val ppl_MIP_Problem_add_constraints : mip_problem -> constraint_system -> unit
val ppl_MIP_Problem_set_objective_function : mip_problem -> linear_expression -> unit
val ppl_MIP_Problem_is_satisfiable : mip_problem -> bool
val ppl_MIP_Problem_solve : mip_problem -> mip_problem_status
val ppl_MIP_Problem_optimization_mode : mip_problem -> optimization_mode
val ppl_MIP_Problem_feasible_point : mip_problem -> linear_generator
val ppl_MIP_Problem_optimizing_point : mip_problem -> linear_generator
val ppl_MIP_Problem_objective_function : mip_problem -> linear_expression
val ppl_MIP_Problem_optimal_value : mip_problem -> Gmp.Z.t * Gmp.Z.t
val ppl_MIP_Problem_evaluate_objective_function : mip_problem ->
linear_generator -> Gmp.Z.t * Gmp.Z.t
val ppl_MIP_Problem_OK : mip_problem -> bool
val ppl_MIP_Problem_clear : mip_problem -> unit
val ppl_MIP_Problem_set_optimization_mode : mip_problem -> optimization_mode -> unit
val ppl_MIP_Problem_set_control_parameter : mip_problem ->
control_parameter_value -> unit
val ppl_MIP_Problem_get_control_parameter : mip_problem ->
control_parameter_name ->
control_parameter_value
val ppl_MIP_Problem_swap : mip_problem -> mip_problem -> unit
val ppl_MIP_Problem_ascii_dump : mip_problem -> string