lpx_constants              package:glpk              R Documentation

_C_o_n_s_t_a_n_t _o_r _r_e_t_u_r_n _c_o_d_e_s _f_o_r _t_h_e _G_L_P_K _l_p_x _c_l_a_s_s.

_D_e_s_c_r_i_p_t_i_o_n:

     These are constants or return codes used in the GLPK API.

     The function 'glpk_strerror' may be used to convert these values
     into a string.

     The global data frame 'lpx_constants' contains symbolic, string,
     and numeric values associated with these variables.

     Please see the GLPK documentation for more info.

_D_e_t_a_i_l_s:

     'LPX_LP' =  linear programming (LP)  = 100

     'LPX_MIP' =  mixed integer programming (MIP)  = 101

     'LPX_MIN' =  minimization  = 120

     'LPX_MAX' =  maximization  = 121

     'LPX_B_UNDEF' =  current basis is undefined  = 130

     'LPX_B_VALID' =  current basis is valid  = 131

     'LPX_P_UNDEF' =  primal solution is undefined  = 132

     'LPX_P_FEAS' =  solution is primal feasible  = 133

     'LPX_P_INFEAS' =  solution is primal infeasible  = 134

     'LPX_P_NOFEAS' =  no primal feasible solution exists  = 135

     'LPX_D_UNDEF' =  dual solution is undefined  = 136

     'LPX_D_FEAS' =  solution is dual feasible  = 137

     'LPX_D_INFEAS' =  solution is dual infeasible  = 138

     'LPX_D_NOFEAS' =  no dual feasible solution exists  = 139

     'LPX_T_UNDEF' =  interior solution is undefined  = 150

     'LPX_T_OPT' =  interior solution is optimal  = 151

     'LPX_I_UNDEF' =  integer solution is undefined  = 170

     'LPX_I_OPT' =  integer solution is optimal  = 171

     'LPX_I_FEAS' =  integer solution is feasible  = 172

     'LPX_I_NOFEAS' =  no integer solution exists  = 173

     'LPX_FR' =  free variable  = 110

     'LPX_LO' =  variable with lower bound  = 111

     'LPX_UP' =  variable with upper bound  = 112

     'LPX_DB' =  double-bounded variable  = 113

     'LPX_FX' =  fixed variable  = 114

     'LPX_BS' =  basic variable  = 140

     'LPX_NL' =  non-basic variable on lower bound  = 141

     'LPX_NU' =  non-basic variable on upper bound  = 142

     'LPX_NF' =  non-basic free variable  = 143

     'LPX_NS' =  non-basic fixed variable  = 144

     'LPX_CV' =  continuous variable  = 160

     'LPX_IV' =  integer variable  = 161

     'LPX_FR' =  free variable  = 110

     'LPX_LO' =  variable with lower bound  = 111

     'LPX_UP' =  variable with upper bound  = 112

     'LPX_DB' =  double-bounded variable  = 113

     'LPX_FX' =  fixed variable  = 114

     'LPX_BS' =  basic variable  = 140

     'LPX_NL' =  non-basic variable on lower bound  = 141

     'LPX_NU' =  non-basic variable on upper bound  = 142

     'LPX_NF' =  non-basic free variable  = 143

     'LPX_NS' =  non-basic fixed variable  = 144

     'LPX_OPT' =  optimal  = 180

     'LPX_FEAS' =  feasible  = 181

     'LPX_INFEAS' =  infeasible  = 182

     'LPX_NOFEAS' =  no feasible  = 183

     'LPX_UNBND' =  unbounded  = 184

     'LPX_UNDEF' =  undefined  = 185

     'LPX_E_OK' =  success  = 200

     'LPX_E_EMPTY' =  empty problem  = 201

     'LPX_E_BADB' =  invalid initial basis  = 202

     'LPX_E_INFEAS' =  infeasible initial solution  = 203

     'LPX_E_FAULT' =  unable to start the search  = 204

     'LPX_E_OBJLL' =  objective lower limit reached  = 205

     'LPX_E_OBJUL' =  objective upper limit reached  = 206

     'LPX_E_ITLIM' =  iterations limit exhausted  = 207

     'LPX_E_TMLIM' =  time limit exhausted  = 208

     'LPX_E_NOFEAS' =  no feasible solution  = 209

     'LPX_E_INSTAB' =  numerical instability  = 210

     'LPX_E_SING' =  problems with basis matrix  = 211

     'LPX_E_NOCONV' =  no convergence (interior)  = 212

     'LPX_E_NOPFS' =  no primal feas. sol. (LP presolver)  = 213

     'LPX_E_NODFS' =  no dual feas. sol. (LP presolver)  = 214

     'LPX_K_MSGLEV' =  lp->msg_lev  = 300

     'LPX_K_SCALE' =  lp->scale  = 301

     'LPX_K_DUAL' =  lp->dual  = 302

     'LPX_K_PRICE' =  lp->price  = 303

     'LPX_K_RELAX' =  lp->relax  = 304

     'LPX_K_TOLBND' =  lp->tol_bnd  = 305

     'LPX_K_TOLDJ' =  lp->tol_dj  = 306

     'LPX_K_TOLPIV' =  lp->tol_piv  = 307

     'LPX_K_ROUND' =  lp->round  = 308

     'LPX_K_OBJLL' =  lp->obj_ll  = 309

     'LPX_K_OBJUL' =  lp->obj_ul  = 310

     'LPX_K_ITLIM' =  lp->it_lim  = 311

     'LPX_K_ITCNT' =  lp->it_cnt  = 312

     'LPX_K_TMLIM' =  lp->tm_lim  = 313

     'LPX_K_OUTFRQ' =  lp->out_frq  = 314

     'LPX_K_OUTDLY' =  lp->out_dly  = 315

     'LPX_K_BRANCH' =  lp->branch  = 316

     'LPX_K_BTRACK' =  lp->btrack  = 317

     'LPX_K_TOLINT' =  lp->tol_int  = 318

     'LPX_K_TOLOBJ' =  lp->tol_obj  = 319

     'LPX_K_MPSINFO' =  lp->mps_info  = 320

     'LPX_K_MPSOBJ' =  lp->mps_obj  = 321

     'LPX_K_MPSORIG' =  lp->mps_orig  = 322

     'LPX_K_MPSWIDE' =  lp->mps_wide  = 323

     'LPX_K_MPSFREE' =  lp->mps_free  = 324

     'LPX_K_MPSSKIP' =  lp->mps_skip  = 325

     'LPX_K_LPTORIG' =  lp->lpt_orig  = 326

     'LPX_K_PRESOL' =  lp->presol  = 327

_N_o_t_e:

     Code should not rely on the numeric values.

     Inquiries regarding this interface (R-GLPK) should NOT be sent to
     GNU GLPK mailing lists.

_A_u_t_h_o_r(_s):

     Lopaka Lee      <rlee@fpcc.net> (R-GLPK)

     Andrew Makhorin <mao@gnu.org>   (GLPK)

_R_e_f_e_r_e_n_c_e_s:

     The GNU GLPK home page at
     http://www.gnu.org/software/glpk/glpk.html

_S_e_e _A_l_s_o:

     'glpk_strerror'

_E_x_a_m_p_l_e_s:

         lp = lpx_create_prob()
         glpk_strerror(lpx_get_status(lp))

