export declare namespace Const {
    enum ObjectiveDirection {
        MIN = 1,
        MAX = 2
    }
    enum BoundType {
        FREE = 1,
        LB = 2,
        UB = 3,
        BOUNDED = 4,
        FIXED = 5
    }
    enum VariableStatus {
        BASIC = 1,
        LB = 2,
        UB = 3,
        FREE = 4,
        FIXED = 5
    }
    enum VariableType {
        CONTINUOUS = 1,
        INTEGER = 2,
        BINARY = 3
    }
    enum Scaling {
        GEOMETRIC_MEAN = 1,
        EQUILIBRATION = 16,
        POWER_TWO = 32,
        SKIP = 64,
        AUTO = 128
    }
    enum SolutionIndicator {
        BASIC = 1,
        INTERIOR_POINT = 2,
        MIXED_INTEGER = 3
    }
    enum Status {
        UNDEFINED = 1,
        FEASIBLE = 2,
        INFEASIBLE = 3,
        NO_FEASIBLE = 4,
        OPTIMAL = 5,
        UNBOUNDED = 6
    }
    enum MessageLevel {
        OFF = 0,// no output
        ERR = 1,// warning and error messages only
        ON = 2,// normal output
        ALL = 3,// full output
        DBG = 4
    }
    enum Method {
        PRIMAL = 1,// use primal simplex
        DUALP = 2,// use dual; if it fails, use primal
        DUAL = 3
    }
    enum Pricing {
        STD = 17,// standard (Dantzig's rule)
        PSE = 34
    }
    enum RatioTest {
        STD = 17,// standard (textbook)
        HAR = 34,// Harris' two-pass ratio test
        FLIP = 51
    }
    enum OrderingAlgorithm {
        NONE = 0,// natural (original) ordering
        QMD = 1,// quotient minimum degree (QMD)
        AMD = 2,// approx. minimum degree (AMD)
        SYMAMD = 3
    }
    enum ReturnCode {
        OK = 0,
        EBADB = 1,// invalid basis
        ESING = 2,// singular matrix
        ECOND = 3,// ill-conditioned matrix
        EBOUND = 4,// invalid bounds
        EFAIL = 5,// solver failed
        EOBJLL = 6,// objective lower limit reached
        EOBJUL = 7,// objective upper limit reached
        EITLIM = 8,// iteration limit exceeded
        ETMLIM = 9,// time limit exceeded
        ENOPFS = 10,// no primal feasible solution
        ENODFS = 11,// no dual feasible solution
        EROOT = 12,// root LP optimum not provided
        ESTOP = 13,// search terminated by application
        EMIPGAP = 14,// relative mip gap tolerance reached
        ENOFEAS = 15,// no primal/dual feasible solution
        ENOCVG = 16,// no convergence
        EINSTAB = 17,// numerical instability
        EDATA = 18,// invalid data
        ERANGE = 19
    }
    enum BranchingTechnique {
        FFV = 1,// first fractional variable
        LFV = 2,// last fractional variable
        MFV = 3,// most fractional variable
        DTH = 4,// heuristic by Driebeck and Tomlin
        PCH = 5
    }
    enum BacktrackingTechnique {
        DFS = 1,// depth first search
        BFS = 2,// breadth first search
        BLB = 3,// best local bound
        BPH = 4
    }
    enum PreprocessingTechnique {
        NONE = 0,// disable preprocessing
        ROOT = 1,// preprocessing only on root level
        ALL = 2
    }
    enum ConditionIndicator {
        PE = 1,// primal equalities
        PB = 2,// primal bounds
        DE = 3,// dual equalities
        DB = 4,// dual bounds
        CS = 5
    }
    enum ReasonCode {
        ROWGEN = 1,// request for row generation
        BINGO = 2,// better integer solution found
        HEUR = 3,// request for heuristic solution
        CUTGEN = 4,// request for cut generation
        BRANCH = 5,// request for branching
        SELECT = 6,// request for subproblem selection
        PREPRO = 7
    }
    enum BranchSelection {
        NO_BRNCH = 0,// select no branch
        DN_BRNCH = 1,// select down-branch
        UP_BRNCH = 2
    }
    enum RowOrigin {
        REG = 0,// regular constraint
        LAZY = 1,// "lazy" constraint
        CUT = 2
    }
    enum RowClass {
        GMI = 1,// Gomory's mixed integer cut
        MIR = 2,// mixed integer rounding cut
        COV = 3,// mixed cover cut
        CLQ = 4
    }
    enum MPSFormat {
        DECK = 1,// fixed (ancient)
        FILE = 2
    }
}