| PPL C Language Interface
    1.2
    | 
Types and functions for MIP problems. More...
#include <ppl_c_header.h>
| Related Functions | |
| (Note that these are not member functions.) | |
| Symbolic Constants | |
| int | PPL_OPTIMIZATION_MODE_MAXIMIZATION | 
| Code of the "maximization" optimization mode. | |
| int | PPL_OPTIMIZATION_MODE_MINIMIZATION | 
| Code of the "minimization" optimization mode. | |
| int | PPL_MIP_PROBLEM_STATUS_UNFEASIBLE | 
| Code of the "unfeasible MIP problem" status. | |
| int | PPL_MIP_PROBLEM_STATUS_UNBOUNDED | 
| Code of the "unbounded MIP problem" status. | |
| int | PPL_MIP_PROBLEM_STATUS_OPTIMIZED | 
| Code of the "optimized MIP problem" status. | |
| int | PPL_MIP_PROBLEM_CONTROL_PARAMETER_NAME_PRICING | 
| Code for the MIP problem's "pricing" control parameter name. | |
| int | PPL_MIP_PROBLEM_CONTROL_PARAMETER_PRICING_TEXTBOOK | 
| Code of MIP problem's "textbook" pricing method. | |
| int | PPL_MIP_PROBLEM_CONTROL_PARAMETER_PRICING_STEEPEST_EDGE_EXACT | 
| Code of MIP problem's "exact steepest-edge" pricing method. | |
| int | PPL_MIP_PROBLEM_CONTROL_PARAMETER_PRICING_STEEPEST_EDGE_FLOAT | 
| Code of MIP problem's "float steepest-edge" pricing method. | |
| Constructors, Assignment and Destructor | |
| int | ppl_new_MIP_Problem_from_space_dimension (ppl_MIP_Problem_t *pmip, ppl_dimension_type d) | 
| Builds a trivial MIP problem of dimension dand writes a handle to it at addresspmip. | |
| int | ppl_new_MIP_Problem (ppl_MIP_Problem_t *pmip, ppl_dimension_type d, ppl_const_Constraint_System_t cs, ppl_const_Linear_Expression_t le, int m) | 
| Builds a MIP problem of space dimension dhaving feasible regioncs, objective functionleand optimization modem; writes a handle to it at addresspmip. | |
| int | ppl_new_MIP_Problem_from_MIP_Problem (ppl_MIP_Problem_t *pmip, ppl_const_MIP_Problem_t mip) | 
| Builds a MIP problem that is a copy of mip; writes a handle for the newly created system at addresspmip. | |
| int | ppl_assign_MIP_Problem_from_MIP_Problem (ppl_MIP_Problem_t dst, ppl_const_MIP_Problem_t src) | 
| Assigns a copy of the MIP problem srctodst. | |
| int | ppl_delete_MIP_Problem (ppl_const_MIP_Problem_t mip) | 
| Invalidates the handle mip:this makes sure the corresponding resources will eventually be released. | |
| Functions that Do Not Modify the MIP_Problem | |
| int | ppl_MIP_Problem_space_dimension (ppl_const_MIP_Problem_t mip, ppl_dimension_type *m) | 
| Writes to mthe dimension of the vector space enclosingmip. | |
| int | ppl_MIP_Problem_number_of_integer_space_dimensions (ppl_const_MIP_Problem_t mip, ppl_dimension_type *m) | 
| Writes to mthe number of integer space dimensions ofmip. | |
| int | ppl_MIP_Problem_integer_space_dimensions (ppl_const_MIP_Problem_t mip, ppl_dimension_type ds[]) | 
| Writes in the first positions of the array dsall the integer space dimensions of problemmip. If the array is not big enough to hold all of the integer space dimensions, the behavior is undefined. | |
| int | ppl_MIP_Problem_number_of_constraints (ppl_const_MIP_Problem_t mip, ppl_dimension_type *m) | 
| Writes to mthe number of constraints defining the feasible region ofmip. | |
| int | ppl_MIP_Problem_constraint_at_index (ppl_const_MIP_Problem_t mip, ppl_dimension_type i, ppl_const_Constraint_t *pc) | 
| Writes at address pca const handle to thei-thconstraint defining the feasible region of the MIP problemmip. | |
| int | ppl_MIP_Problem_objective_function (ppl_const_MIP_Problem_t mip, ppl_const_Linear_Expression_t *ple) | 
| Writes a const handle to the linear expression defining the objective function of the MIP problem mipat addressple. | |
| int | ppl_MIP_Problem_optimization_mode (ppl_const_MIP_Problem_t mip) | 
| Returns the optimization mode of the MIP problem mip. | |
| int | ppl_MIP_Problem_OK (ppl_const_MIP_Problem_t mip) | 
| Returns a positive integer if mipis well formed, i.e., if it satisfies all its implementation invariants; returns 0 and perhaps makes some noise ifmipis broken. Useful for debugging purposes. | |
| Functions that May Modify the MIP_Problem | |
| int | ppl_MIP_Problem_clear (ppl_MIP_Problem_t mip) | 
| Resets the MIP problem to be a trivial problem of space dimension 0. | |
| int | ppl_MIP_Problem_add_space_dimensions_and_embed (ppl_MIP_Problem_t mip, ppl_dimension_type d) | 
| Adds dnew dimensions to the space enclosing the MIP problemmipand tomipitself. | |
| int | ppl_MIP_Problem_add_to_integer_space_dimensions (ppl_MIP_Problem_t mip, ppl_dimension_type ds[], size_t n) | 
| Sets the space dimensions that are specified in first npositions of the arraydsto be integer dimensions of problemmip. The presence of duplicates indsis a waste but an innocuous one. | |
| int | ppl_MIP_Problem_add_constraint (ppl_MIP_Problem_t mip, ppl_const_Constraint_t c) | 
| Modifies the feasible region of the MIP problem mipby adding a copy of the constraintc. | |
| int | ppl_MIP_Problem_add_constraints (ppl_MIP_Problem_t mip, ppl_const_Constraint_System_t cs) | 
| Modifies the feasible region of the MIP problem mipby adding a copy of the constraints incs. | |
| int | ppl_MIP_Problem_set_objective_function (ppl_MIP_Problem_t mip, ppl_const_Linear_Expression_t le) | 
| Sets the objective function of the MIP problem mipto a copy ofle. | |
| int | ppl_MIP_Problem_set_optimization_mode (ppl_MIP_Problem_t mip, int mode) | 
| Sets the optimization mode of the MIP problem miptomode. | |
| Computing the Solution of the MIP_Problem | |
| int | ppl_MIP_Problem_is_satisfiable (ppl_const_MIP_Problem_t mip) | 
| Returns a positive integer if mipis satisfiable; returns 0 otherwise. | |
| int | ppl_MIP_Problem_solve (ppl_const_MIP_Problem_t mip) | 
| Solves the MIP problem mip, returning an exit status.  More... | |
| int | ppl_MIP_Problem_evaluate_objective_function (ppl_const_MIP_Problem_t mip, ppl_const_Generator_t g, ppl_Coefficient_t num, ppl_Coefficient_t den) | 
| Evaluates the objective function of mipon pointg.  More... | |
| int | ppl_MIP_Problem_feasible_point (ppl_const_MIP_Problem_t mip, ppl_const_Generator_t *pg) | 
| Writes a const handle to a feasible point for the MIP problem mipat addresspg. | |
| int | ppl_MIP_Problem_optimizing_point (ppl_const_MIP_Problem_t mip, ppl_const_Generator_t *pg) | 
| Writes a const handle to an optimizing point for the MIP problem mipat addresspg. | |
| int | ppl_MIP_Problem_optimal_value (ppl_const_MIP_Problem_t mip, ppl_Coefficient_t num, ppl_Coefficient_t den) | 
| Returns the optimal value for mip.  More... | |
| Querying/Setting Control Parameters | |
| int | ppl_MIP_Problem_get_control_parameter (ppl_const_MIP_Problem_t mip, int name) | 
| Returns the value of control parameter namein problemmip. | |
| int | ppl_MIP_Problem_set_control_parameter (ppl_MIP_Problem_t mip, int value) | 
| Sets control parameter valuein problemmip. | |
| int | ppl_MIP_Problem_total_memory_in_bytes (ppl_const_MIP_Problem_t mip, size_t *sz) | 
| Writes into *szthe size in bytes of the memory occupied bymip. | |
| int | ppl_MIP_Problem_external_memory_in_bytes (ppl_const_MIP_Problem_t mip, size_t *sz) | 
| Writes into *szthe size in bytes of the memory managed bymip. | |
| Input/Output Functions | |
| int | ppl_io_print_MIP_Problem (ppl_const_MIP_Problem_t x) | 
| Prints xtostdout. | |
| int | ppl_io_fprint_MIP_Problem (FILE *stream, ppl_const_MIP_Problem_t x) | 
| Prints xto the given outputstream. | |
| int | ppl_io_asprint_MIP_Problem (char **strp, ppl_const_MIP_Problem_t x) | 
| Prints xto a malloc-allocated string, a pointer to which is returned viastrp. | |
| int | ppl_MIP_Problem_ascii_dump (ppl_const_MIP_Problem_t x, FILE *stream) | 
| Dumps an ascii representation of xonstream. | |
| int | ppl_MIP_Problem_ascii_load (ppl_MIP_Problem_t x, FILE *stream) | 
| Loads an ascii representation of xfromstream. | |
Types and functions for MIP problems.
The types and functions for MIP problems provide an interface towards MIP_Problem.
| 
 | related | 
Solves the MIP problem mip, returning an exit status. 
PPL_MIP_PROBLEM_STATUS_UNFEASIBLE if the MIP problem is not satisfiable; PPL_MIP_PROBLEM_STATUS_UNBOUNDED if the MIP problem is satisfiable but there is no finite bound to the value of the objective function; PPL_MIP_PROBLEM_STATUS_OPTIMIZED if the MIP problem admits an optimal solution. | 
 | related | 
Evaluates the objective function of mip on point g. 
| mip | The MIP problem defining the objective function; | 
| g | The generator on which the objective function will be evaluated; | 
| num | Will be assigned the numerator of the objective function value; | 
| den | Will be assigned the denominator of the objective function value; | 
| 
 | related | 
Returns the optimal value for mip. 
| mip | The MIP problem; | 
| num | Will be assigned the numerator of the optimal value; | 
| den | Will be assigned the denominator of the optimal value. |