Scippy

    SCIP

    Solving Constraint Integer Programs

    presol_implint.h
    Go to the documentation of this file.
    1/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
    2/* */
    3/* This file is part of the program and library */
    4/* SCIP --- Solving Constraint Integer Programs */
    5/* */
    6/* Copyright (c) 2002-2025 Zuse Institute Berlin (ZIB) */
    7/* */
    8/* Licensed under the Apache License, Version 2.0 (the "License"); */
    9/* you may not use this file except in compliance with the License. */
    10/* You may obtain a copy of the License at */
    11/* */
    12/* http://www.apache.org/licenses/LICENSE-2.0 */
    13/* */
    14/* Unless required by applicable law or agreed to in writing, software */
    15/* distributed under the License is distributed on an "AS IS" BASIS, */
    16/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
    17/* See the License for the specific language governing permissions and */
    18/* limitations under the License. */
    19/* */
    20/* You should have received a copy of the Apache-2.0 license */
    21/* along with SCIP; see the file LICENSE. If not visit scipopt.org. */
    22/* */
    23/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
    24
    25/**@file presol_implint.h
    26 * @ingroup PRESOLVERS
    27 * @brief Presolver that detects implicit integer variables
    28 * @author Rolf van der Hulst
    29 *
    30 * This presolver looks for implicit integer variables, which are variables whose integrality is implied.
    31 * The linear constraint handler handles the simple (primal) case such as 2x + 2y + z = 3, where z is implied integral by
    32 * x and y. It also handles a more complicated dual case, where we have 'dual' implied integrality if z occurs only in
    33 * inequalities of the primal form (where the equality becomes an inequality), and has integral bounds.
    34 *
    35 * In this plugin we explicitly look for the following structure in the constraint matrix:
    36 * \f[
    37 * \begin{array}{llll}
    38 * A x & + B y & & \leq c\\
    39 * D x & & + E z & \leq f\\
    40 * & & x & \in Z^{p_1} \\
    41 * & & y & \in Z^{p_2} \times R^{n_2-p_2}\\
    42 * & & z & \in Z^{p_3} \times R^{n_3-p_3}
    43 * \end{array}
    44 * \f]
    45 * where A and c are integral and B is totally unimodular. It is not difficult to see that after fixing the x variables,
    46 * that the remaining problem on the y variables is an integral polyhedron (and independent of the z variables).
    47 * Hence, y is implied integral by x.
    48 *
    49 * Note that this presolver only treats integral rows, where SCIPisIntegral() is used to check integrality.
    50 */
    51
    52#ifndef __SCIP_PRESOL_IMPLINT_H__
    53#define __SCIP_PRESOL_IMPLINT_H__
    54
    55#include "scip/def.h"
    56#include "scip/type_retcode.h"
    57#include "scip/type_scip.h"
    58
    59#ifdef __cplusplus
    60extern "C" {
    61#endif
    62
    63
    64/** creates the implicit integer presolver and includes it in SCIP
    65 *
    66 * @ingroup PresolverIncludes
    67 */
    68SCIP_EXPORT
    70 SCIP* scip /**< SCIP data structure */
    71 );
    72
    73
    74#ifdef __cplusplus
    75}
    76#endif
    77
    78#endif /* __SCIP_PRESOL_IMPLINT_H__ */
    common defines and data types used in all packages of SCIP
    SCIP_RETCODE SCIPincludePresolImplint(SCIP *scip)
    type definitions for return codes for SCIP methods
    enum SCIP_Retcode SCIP_RETCODE
    Definition: type_retcode.h:63
    type definitions for SCIP's main datastructure