octave-nkf: src/DLD-FUNCTIONS/__glpk_

comparison src/DLD-FUNCTIONS/glpk.cc @ 10154:40dfc0c99116

DLD-FUNCTIONS/*.cc: untabify

author	John W. Eaton <jwe@octave.org>
date	Wed, 20 Jan 2010 17:33:41 -0500
parents	0631d397fbe0
children	12884915a8e4

comparison

equal deleted inserted replaced

-:2c28f9d0360f
+:40dfc0c99116
 lpx_add_cols (lp, n);
 for (int i = 0; i < n; i++)
 {
 //-- Define type of the structural variables
 if (! freeLB[i] && ! freeUB[i])
-	{
+{
-	  if (lb[i] != ub[i])
+if (lb[i] != ub[i])
-	    lpx_set_col_bnds (lp, i+1, LPX_DB, lb[i], ub[i]);
+lpx_set_col_bnds (lp, i+1, LPX_DB, lb[i], ub[i]);
-	  else
+else
-	    lpx_set_col_bnds (lp, i+1, LPX_FX, lb[i], ub[i]);
+lpx_set_col_bnds (lp, i+1, LPX_FX, lb[i], ub[i]);
-	}
+}
 else
-	{
+{
-	  if (! freeLB[i] && freeUB[i])
+if (! freeLB[i] && freeUB[i])
 lpx_set_col_bnds (lp, i+1, LPX_LO, lb[i], ub[i]);
-	  else
+else
-	    {
+{
-	      if (freeLB[i] && ! freeUB[i])
+if (freeLB[i] && ! freeUB[i])
-		lpx_set_col_bnds (lp, i+1, LPX_UP, lb[i], ub[i]);
+lpx_set_col_bnds (lp, i+1, LPX_UP, lb[i], ub[i]);
-	      else
+else
-		lpx_set_col_bnds (lp, i+1, LPX_FR, lb[i], ub[i]);
+lpx_set_col_bnds (lp, i+1, LPX_FR, lb[i], ub[i]);
-	    }
+}
-	}
+}
 // -- Set the objective coefficient of the corresponding
 // -- structural variable. No constant term is assumed.
 lpx_set_obj_coef(lp,i+1,c[i]);
 if (isMIP)
-	lpx_set_col_kind (lp, i+1, vartype[i]);
+lpx_set_col_kind (lp, i+1, vartype[i]);
 }
 lpx_add_rows (lp, m);
 for (int i = 0; i < m; i++)
 If the i-th row is of S type, the i-th LB is used, but
 the i-th UB is ignored.
 */
 switch (ctype[i])
-	{
+{
-	case 'F':
+case 'F':
-	  typx = LPX_FR;
+typx = LPX_FR;
-	  break;
+break;
-	case 'U':
+case 'U':
-	  typx = LPX_UP;
+typx = LPX_UP;
-	  break;
+break;
-	case 'L':
+case 'L':
-	  typx = LPX_LO;
+typx = LPX_LO;
-	  break;
+break;
-	case 'S':
+case 'S':
-	  typx = LPX_FX;
+typx = LPX_FX;
-	  break;
+break;
-	case 'D':
+case 'D':
-	  typx = LPX_DB;
+typx = LPX_DB;
-	  break;
+break;
-	}
+}
 lpx_set_row_bnds (lp, i+1, typx, b[i], b[i]);
 }
 if (save_pb)
 {
 static char tmp[] = "outpb.lp";
 if (lpx_write_cpxlp (lp, tmp) != 0)
-	{
+{
-	  error ("__glpk__: unable to write problem");
+error ("__glpk__: unable to write problem");
-	  longjmp (mark, -1);
+longjmp (mark, -1);
-	}
+}
 }
 //-- scale the problem data (if required)
 //-- if (scale && (!presol || method == 1)) lpx_scale_prob(lp);
 //-- LPX_K_SCALE=IParam[1]  LPX_K_PRESOL=IParam[16]
 switch (method)
 {
 case 'S':
 {
-	if (isMIP)
+if (isMIP)
-	  {
+{
-	    method = 'I';
+method = 'I';
-	    errnum = lpx_simplex (lp);
+errnum = lpx_simplex (lp);
-	    errnum = lpx_integer (lp);
+errnum = lpx_integer (lp);
-	  }
+}
-	else
+else
-	  errnum = lpx_simplex(lp);
+errnum = lpx_simplex(lp);
 }
 break;
 case 'T':
 errnum = lpx_interior(lp);
 errnum = 2 <=> Numerical problems with basis matrix.
 */
 if (errnum == LPX_E_OK)
 {
 if (isMIP)
-	{
+{
-	  *status = lpx_mip_status (lp);
+*status = lpx_mip_status (lp);
-	  *fmin = lpx_mip_obj_val (lp);
+*fmin = lpx_mip_obj_val (lp);
-	}
+}
 else
-	{
+{
-	  if (lpsolver == 1)
+if (lpsolver == 1)
-	    {
+{
-	      *status = lpx_get_status (lp);
+*status = lpx_get_status (lp);
-	      *fmin = lpx_get_obj_val (lp);
+*fmin = lpx_get_obj_val (lp);
-	    }
+}
-	  else
+else
-	    {
+{
-	      *status = lpx_ipt_status (lp);
+*status = lpx_ipt_status (lp);
-	      *fmin = lpx_ipt_obj_val (lp);
+*fmin = lpx_ipt_obj_val (lp);
-	    }
+}
-	}
+}
 if (isMIP)
-	{
+{
-	  for (int i = 0; i < n; i++)
+for (int i = 0; i < n; i++)
-	    xmin[i] = lpx_mip_col_val (lp, i+1);
+xmin[i] = lpx_mip_col_val (lp, i+1);
-	}
+}
 else
-	{
+{
-	  /* Primal values */
+/* Primal values */
-	  for (int i = 0; i < n; i++)
+for (int i = 0; i < n; i++)
-	    {
+{
-	      if (lpsolver == 1)
+if (lpsolver == 1)
-		xmin[i] = lpx_get_col_prim (lp, i+1);
+xmin[i] = lpx_get_col_prim (lp, i+1);
-	      else
+else
-		xmin[i] = lpx_ipt_col_prim (lp, i+1);
+xmin[i] = lpx_ipt_col_prim (lp, i+1);
-	    }
+}
-	  /* Dual values */
+/* Dual values */
-	  for (int i = 0; i < m; i++)
+for (int i = 0; i < m; i++)
-	    {
+{
-	      if (lpsolver == 1)
+if (lpsolver == 1)
-		lambda[i] = lpx_get_row_dual (lp, i+1);
+lambda[i] = lpx_get_row_dual (lp, i+1);
-	      else
+else
-		lambda[i] = lpx_ipt_row_dual (lp, i+1);
+lambda[i] = lpx_ipt_row_dual (lp, i+1);
-	    }
+}
-	  /* Reduced costs */
+/* Reduced costs */
-	  for (int i = 0; i < lpx_get_num_cols (lp); i++)
+for (int i = 0; i < lpx_get_num_cols (lp); i++)
-	    {
+{
-	      if (lpsolver == 1)
+if (lpsolver == 1)
-		redcosts[i] = lpx_get_col_dual (lp, i+1);
+redcosts[i] = lpx_get_col_dual (lp, i+1);
-	      else
+else
-		redcosts[i] = lpx_ipt_col_dual (lp, i+1);
+redcosts[i] = lpx_ipt_col_dual (lp, i+1);
-	    }
+}
-	}
+}
 *time = (clock () - t_start) / CLOCKS_PER_SEC;
 #ifdef GLPK_PRE_4_14
 *mem = (lib_env_ptr () -> mem_tpeak);
 #define OCTAVE_GLPK_GET_REAL_PARAM(NAME, IDX) \
 do \
 { \
 if (PARAM.contains (NAME)) \
-	{ \
+{ \
-	  Cell tmp = PARAM.contents (NAME); \
+Cell tmp = PARAM.contents (NAME); \
 \
 if (! tmp.is_empty ()) \
-	    { \
+{ \
-	      lpxRealParam[IDX] = tmp(0).scalar_value (); \
+lpxRealParam[IDX] = tmp(0).scalar_value (); \
 \
 if (error_state) \
-		{ \
+{ \
-		  error ("glpk: invalid value in param." NAME); \
+error ("glpk: invalid value in param." NAME); \
-		  return retval; \
+return retval; \
-		} \
+} \
-	    } \
+} \
-	  else \
+else \
-	    { \
+{ \
-	      error ("glpk: invalid value in param." NAME); \
+error ("glpk: invalid value in param." NAME); \
-	      return retval; \
+return retval; \
-	    } \
+} \
-	} \
+} \
 } \
 while (0)
 #define OCTAVE_GLPK_GET_INT_PARAM(NAME, VAL) \
 do \
 { \
 if (PARAM.contains (NAME)) \
-	{ \
+{ \
-	  Cell tmp = PARAM.contents (NAME); \
+Cell tmp = PARAM.contents (NAME); \
 \
 if (! tmp.is_empty ()) \
-	    { \
+{ \
-	      VAL = tmp(0).int_value (); \
+VAL = tmp(0).int_value (); \
 \
 if (error_state) \
-		{ \
+{ \
-		  error ("glpk: invalid value in param." NAME); \
+error ("glpk: invalid value in param." NAME); \
-		  return retval; \
+return retval; \
-		} \
+} \
-	    } \
+} \
-	  else \
+else \
-	    { \
+{ \
-	      error ("glpk: invalid value in param." NAME); \
+error ("glpk: invalid value in param." NAME); \
-	      return retval; \
+return retval; \
-	    } \
+} \
-	} \
+} \
 } \
 while (0)
 DEFUN_DLD (__glpk__, args, ,
 "-*- texinfo -*-\n\
 if (args(1).is_sparse_type ())
 {
 SparseMatrix A = args(1).sparse_matrix_value (); // get the sparse matrix
 if (error_state)
-	{
+{
-	  error ("__glpk__: invalid value of A");
+error ("__glpk__: invalid value of A");
-	  return retval;
+return retval;
-	}
+}
 mrowsA = A.rows ();
 octave_idx_type Anc = A.cols ();
 octave_idx_type Anz = A.nzmax ();
 rn.resize (Anz+1);
 cn.resize (Anz+1);
 a.resize (Anz+1, 0.0);
 if (Anc != mrowsc)
-	{
+{
-	  error ("__glpk__: invalid value of A");
+error ("__glpk__: invalid value of A");
-	  return retval;
+return retval;
-	}
+}
 for (octave_idx_type j = 0; j < Anc; j++)
-	for (octave_idx_type i = A.cidx(j); i < A.cidx(j+1); i++)
+for (octave_idx_type i = A.cidx(j); i < A.cidx(j+1); i++)
-	  {
+{
-	    nz++;
+nz++;
-	    rn(nz) = A.ridx(i) + 1;
+rn(nz) = A.ridx(i) + 1;
-	    cn(nz) = j + 1;
+cn(nz) = j + 1;
-	    a(nz) = A.data(i);
+a(nz) = A.data(i);
-	  }
+}
 }
 else
 {
 Matrix A (args(1).matrix_value ()); // get the matrix
 if (error_state)
-	{
+{
-	  error ("__glpk__: invalid value of A");
+error ("__glpk__: invalid value of A");
-	  return retval;
+return retval;
-	}
+}
 mrowsA = A.rows ();
 rn.resize (mrowsA*mrowsc+1);
 cn.resize (mrowsA*mrowsc+1);
 a.resize (mrowsA*mrowsc+1, 0.0);
 for (int i = 0; i < mrowsA; i++)
-	{
+{
-	  for (int j = 0; j < mrowsc; j++)
+for (int j = 0; j < mrowsc; j++)
-	    {
+{
-	      if (A(i,j) != 0)
+if (A(i,j) != 0)
-		{
+{
-		  nz++;
+nz++;
-		  rn(nz) = i + 1;
+rn(nz) = i + 1;
-		  cn(nz) = j + 1;
+cn(nz) = j + 1;
-		  a(nz) = A(i,j);
+a(nz) = A(i,j);
-		}
+}
-	    }
+}
-	}
+}
 }
 //-- 3rd Input. A column array containing the right-hand side value
-//	           for each constraint in the constraint matrix.
+//               for each constraint in the constraint matrix.
 Matrix B (args(2).matrix_value ());
 if (error_state)
 {
 error ("__glpk__: invalid value of b");
 //-- LB argument, default: Free
 Array<int> freeLB (mrowsc);
 for (int i = 0; i < mrowsc; i++)
 {
 if (xisinf (lb[i]))
-	 {
+{
-	   freeLB(i) = 1;
+freeLB(i) = 1;
-	   lb[i] = -octave_Inf;
+lb[i] = -octave_Inf;
-	 }
+}
 else
-	 freeLB(i) = 0;
+freeLB(i) = 0;
 }
 //-- 5th Input. An array of at least length numcols containing the upper
 //--            bound on each of the variables.
 Matrix UB (args(4).matrix_value ());
 Array<int> freeUB (mrowsc);
 for (int i = 0; i < mrowsc; i++)
 {
 if (xisinf (ub[i]))
-	{
+{
-	  freeUB(i) = 1;
+freeUB(i) = 1;
-	  ub[i] = octave_Inf;
+ub[i] = octave_Inf;
-	}
+}
 else
-	freeUB(i) = 0;
+freeUB(i) = 0;
 }
 //-- 6th Input. A column array containing the sense of each constraint
 //--            in the constraint matrix.
 charMatrix CTYPE (args(5).char_matrix_value ());
 Array<int> vartype (mrowsc);
 volatile int isMIP = 0;
 for (int i = 0; i < mrowsc ; i++)
 {
 if (VTYPE(i,0) == 'I')
-	{
+{
-	  isMIP = 1;
+isMIP = 1;
-	  vartype(i) = LPX_IV;
+vartype(i) = LPX_IV;
-	}
+}
 else
-	vartype(i) = LPX_CV;
+vartype(i) = LPX_CV;
 }
 //-- 8th Input. Sense of optimization.
 volatile int sense;
 double SENSE = args(7).scalar_value ();
 //-- Absolute tolerance used to check if the current basic solution
 //-- is dual feasible
 OCTAVE_GLPK_GET_REAL_PARAM ("toldj", 2);
 //-- Relative tolerance used to choose eligible pivotal elements of
-//--	the simplex table in the ratio test
+//--  the simplex table in the ratio test
 OCTAVE_GLPK_GET_REAL_PARAM ("tolpiv", 3);
 OCTAVE_GLPK_GET_REAL_PARAM ("objll", 4);
 OCTAVE_GLPK_GET_REAL_PARAM ("objul", 5);
 int jmpret = setjmp (mark);
 if (jmpret == 0)
 glpk (sense, mrowsc, mrowsA, c, nz, rn.fortran_vec (),
-	  cn.fortran_vec (), a.fortran_vec (), b, ctype,
+cn.fortran_vec (), a.fortran_vec (), b, ctype,
-	  freeLB.fortran_vec (), lb, freeUB.fortran_vec (),
+freeLB.fortran_vec (), lb, freeUB.fortran_vec (),
-	  ub, vartype.fortran_vec (), isMIP, lpsolver,
+ub, vartype.fortran_vec (), isMIP, lpsolver,
-	  save_pb, xmin.fortran_vec (), fmin.fortran_vec (),
+save_pb, xmin.fortran_vec (), fmin.fortran_vec (),
-	  status.fortran_vec (), lambda.fortran_vec (),
+status.fortran_vec (), lambda.fortran_vec (),
-	  redcosts.fortran_vec (), time.fortran_vec (),
+redcosts.fortran_vec (), time.fortran_vec (),
-	  mem.fortran_vec ());
+mem.fortran_vec ());
 Octave_map extra;
 if (! isMIP)
 {

Mercurial > octave-nkf

comparison src/DLD-FUNCTIONS/__glpk__.cc @ 10154:40dfc0c99116

comparison src/DLD-FUNCTIONS/glpk.cc @ 10154:40dfc0c99116