alpar@9: /* glpapi08.c (interior-point method routines) */
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  This code is part of GLPK (GNU Linear Programming Kit).
alpar@9: *
alpar@9: *  Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
alpar@9: *  2009, 2010, 2011 Andrew Makhorin, Department for Applied Informatics,
alpar@9: *  Moscow Aviation Institute, Moscow, Russia. All rights reserved.
alpar@9: *  E-mail: <mao@gnu.org>.
alpar@9: *
alpar@9: *  GLPK is free software: you can redistribute it and/or modify it
alpar@9: *  under the terms of the GNU General Public License as published by
alpar@9: *  the Free Software Foundation, either version 3 of the License, or
alpar@9: *  (at your option) any later version.
alpar@9: *
alpar@9: *  GLPK is distributed in the hope that it will be useful, but WITHOUT
alpar@9: *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
alpar@9: *  or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
alpar@9: *  License for more details.
alpar@9: *
alpar@9: *  You should have received a copy of the GNU General Public License
alpar@9: *  along with GLPK. If not, see <http://www.gnu.org/licenses/>.
alpar@9: ***********************************************************************/
alpar@9: 
alpar@9: #include "glpapi.h"
alpar@9: #include "glpipm.h"
alpar@9: #include "glpnpp.h"
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_interior - solve LP problem with the interior-point method
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  int glp_interior(glp_prob *P, const glp_iptcp *parm);
alpar@9: *
alpar@9: *  The routine glp_interior is a driver to the LP solver based on the
alpar@9: *  interior-point method.
alpar@9: *
alpar@9: *  The interior-point solver has a set of control parameters. Values of
alpar@9: *  the control parameters can be passed in a structure glp_iptcp, which
alpar@9: *  the parameter parm points to.
alpar@9: *
alpar@9: *  Currently this routine implements an easy variant of the primal-dual
alpar@9: *  interior-point method based on Mehrotra's technique.
alpar@9: *
alpar@9: *  This routine transforms the original LP problem to an equivalent LP
alpar@9: *  problem in the standard formulation (all constraints are equalities,
alpar@9: *  all variables are non-negative), calls the routine ipm_main to solve
alpar@9: *  the transformed problem, and then transforms an obtained solution to
alpar@9: *  the solution of the original problem.
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  0  The LP problem instance has been successfully solved. This code
alpar@9: *     does not necessarily mean that the solver has found optimal
alpar@9: *     solution. It only means that the solution process was successful.
alpar@9: *
alpar@9: *  GLP_EFAIL
alpar@9: *     The problem has no rows/columns.
alpar@9: *
alpar@9: *  GLP_ENOCVG
alpar@9: *     Very slow convergence or divergence.
alpar@9: *
alpar@9: *  GLP_EITLIM
alpar@9: *     Iteration limit exceeded.
alpar@9: *
alpar@9: *  GLP_EINSTAB
alpar@9: *     Numerical instability on solving Newtonian system. */
alpar@9: 
alpar@9: static void transform(NPP *npp)
alpar@9: {     /* transform LP to the standard formulation */
alpar@9:       NPPROW *row, *prev_row;
alpar@9:       NPPCOL *col, *prev_col;
alpar@9:       for (row = npp->r_tail; row != NULL; row = prev_row)
alpar@9:       {  prev_row = row->prev;
alpar@9:          if (row->lb == -DBL_MAX && row->ub == +DBL_MAX)
alpar@9:             npp_free_row(npp, row);
alpar@9:          else if (row->lb == -DBL_MAX)
alpar@9:             npp_leq_row(npp, row);
alpar@9:          else if (row->ub == +DBL_MAX)
alpar@9:             npp_geq_row(npp, row);
alpar@9:          else if (row->lb != row->ub)
alpar@9:          {  if (fabs(row->lb) < fabs(row->ub))
alpar@9:                npp_geq_row(npp, row);
alpar@9:             else
alpar@9:                npp_leq_row(npp, row);
alpar@9:          }
alpar@9:       }
alpar@9:       for (col = npp->c_tail; col != NULL; col = prev_col)
alpar@9:       {  prev_col = col->prev;
alpar@9:          if (col->lb == -DBL_MAX && col->ub == +DBL_MAX)
alpar@9:             npp_free_col(npp, col);
alpar@9:          else if (col->lb == -DBL_MAX)
alpar@9:             npp_ubnd_col(npp, col);
alpar@9:          else if (col->ub == +DBL_MAX)
alpar@9:          {  if (col->lb != 0.0)
alpar@9:                npp_lbnd_col(npp, col);
alpar@9:          }
alpar@9:          else if (col->lb != col->ub)
alpar@9:          {  if (fabs(col->lb) < fabs(col->ub))
alpar@9:             {  if (col->lb != 0.0)
alpar@9:                   npp_lbnd_col(npp, col);
alpar@9:             }
alpar@9:             else
alpar@9:                npp_ubnd_col(npp, col);
alpar@9:             npp_dbnd_col(npp, col);
alpar@9:          }
alpar@9:          else
alpar@9:             npp_fixed_col(npp, col);
alpar@9:       }
alpar@9:       for (row = npp->r_head; row != NULL; row = row->next)
alpar@9:          xassert(row->lb == row->ub);
alpar@9:       for (col = npp->c_head; col != NULL; col = col->next)
alpar@9:          xassert(col->lb == 0.0 && col->ub == +DBL_MAX);
alpar@9:       return;
alpar@9: }
alpar@9: 
alpar@9: int glp_interior(glp_prob *P, const glp_iptcp *parm)
alpar@9: {     glp_iptcp _parm;
alpar@9:       GLPROW *row;
alpar@9:       GLPCOL *col;
alpar@9:       NPP *npp = NULL;
alpar@9:       glp_prob *prob = NULL;
alpar@9:       int i, j, ret;
alpar@9:       /* check control parameters */
alpar@9:       if (parm == NULL)
alpar@9:          glp_init_iptcp(&_parm), parm = &_parm;
alpar@9:       if (!(parm->msg_lev == GLP_MSG_OFF ||
alpar@9:             parm->msg_lev == GLP_MSG_ERR ||
alpar@9:             parm->msg_lev == GLP_MSG_ON  ||
alpar@9:             parm->msg_lev == GLP_MSG_ALL))
alpar@9:          xerror("glp_interior: msg_lev = %d; invalid parameter\n",
alpar@9:             parm->msg_lev);
alpar@9:       if (!(parm->ord_alg == GLP_ORD_NONE ||
alpar@9:             parm->ord_alg == GLP_ORD_QMD ||
alpar@9:             parm->ord_alg == GLP_ORD_AMD ||
alpar@9:             parm->ord_alg == GLP_ORD_SYMAMD))
alpar@9:          xerror("glp_interior: ord_alg = %d; invalid parameter\n",
alpar@9:             parm->ord_alg);
alpar@9:       /* interior-point solution is currently undefined */
alpar@9:       P->ipt_stat = GLP_UNDEF;
alpar@9:       P->ipt_obj = 0.0;
alpar@9:       /* check bounds of double-bounded variables */
alpar@9:       for (i = 1; i <= P->m; i++)
alpar@9:       {  row = P->row[i];
alpar@9:          if (row->type == GLP_DB && row->lb >= row->ub)
alpar@9:          {  if (parm->msg_lev >= GLP_MSG_ERR)
alpar@9:                xprintf("glp_interior: row %d: lb = %g, ub = %g; incorre"
alpar@9:                   "ct bounds\n", i, row->lb, row->ub);
alpar@9:             ret = GLP_EBOUND;
alpar@9:             goto done;
alpar@9:          }
alpar@9:       }
alpar@9:       for (j = 1; j <= P->n; j++)
alpar@9:       {  col = P->col[j];
alpar@9:          if (col->type == GLP_DB && col->lb >= col->ub)
alpar@9:          {  if (parm->msg_lev >= GLP_MSG_ERR)
alpar@9:                xprintf("glp_interior: column %d: lb = %g, ub = %g; inco"
alpar@9:                   "rrect bounds\n", j, col->lb, col->ub);
alpar@9:             ret = GLP_EBOUND;
alpar@9:             goto done;
alpar@9:          }
alpar@9:       }
alpar@9:       /* transform LP to the standard formulation */
alpar@9:       if (parm->msg_lev >= GLP_MSG_ALL)
alpar@9:          xprintf("Original LP has %d row(s), %d column(s), and %d non-z"
alpar@9:             "ero(s)\n", P->m, P->n, P->nnz);
alpar@9:       npp = npp_create_wksp();
alpar@9:       npp_load_prob(npp, P, GLP_OFF, GLP_IPT, GLP_ON);
alpar@9:       transform(npp);
alpar@9:       prob = glp_create_prob();
alpar@9:       npp_build_prob(npp, prob);
alpar@9:       if (parm->msg_lev >= GLP_MSG_ALL)
alpar@9:          xprintf("Working LP has %d row(s), %d column(s), and %d non-ze"
alpar@9:             "ro(s)\n", prob->m, prob->n, prob->nnz);
alpar@9: #if 1
alpar@9:       /* currently empty problem cannot be solved */
alpar@9:       if (!(prob->m > 0 && prob->n > 0))
alpar@9:       {  if (parm->msg_lev >= GLP_MSG_ERR)
alpar@9:             xprintf("glp_interior: unable to solve empty problem\n");
alpar@9:          ret = GLP_EFAIL;
alpar@9:          goto done;
alpar@9:       }
alpar@9: #endif
alpar@9:       /* scale the resultant LP */
alpar@9:       {  ENV *env = get_env_ptr();
alpar@9:          int term_out = env->term_out;
alpar@9:          env->term_out = GLP_OFF;
alpar@9:          glp_scale_prob(prob, GLP_SF_EQ);
alpar@9:          env->term_out = term_out;
alpar@9:       }
alpar@9:       /* warn about dense columns */
alpar@9:       if (parm->msg_lev >= GLP_MSG_ON && prob->m >= 200)
alpar@9:       {  int len, cnt = 0;
alpar@9:          for (j = 1; j <= prob->n; j++)
alpar@9:          {  len = glp_get_mat_col(prob, j, NULL, NULL);
alpar@9:             if ((double)len >= 0.20 * (double)prob->m) cnt++;
alpar@9:          }
alpar@9:          if (cnt == 1)
alpar@9:             xprintf("WARNING: PROBLEM HAS ONE DENSE COLUMN\n");
alpar@9:          else if (cnt > 0)
alpar@9:             xprintf("WARNING: PROBLEM HAS %d DENSE COLUMNS\n", cnt);
alpar@9:       }
alpar@9:       /* solve the transformed LP */
alpar@9:       ret = ipm_solve(prob, parm);
alpar@9:       /* postprocess solution from the transformed LP */
alpar@9:       npp_postprocess(npp, prob);
alpar@9:       /* and store solution to the original LP */
alpar@9:       npp_unload_sol(npp, P);
alpar@9: done: /* free working program objects */
alpar@9:       if (npp != NULL) npp_delete_wksp(npp);
alpar@9:       if (prob != NULL) glp_delete_prob(prob);
alpar@9:       /* return to the application program */
alpar@9:       return ret;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_init_iptcp - initialize interior-point solver control parameters
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  void glp_init_iptcp(glp_iptcp *parm);
alpar@9: *
alpar@9: *  DESCRIPTION
alpar@9: *
alpar@9: *  The routine glp_init_iptcp initializes control parameters, which are
alpar@9: *  used by the interior-point solver, with default values.
alpar@9: *
alpar@9: *  Default values of the control parameters are stored in the glp_iptcp
alpar@9: *  structure, which the parameter parm points to. */
alpar@9: 
alpar@9: void glp_init_iptcp(glp_iptcp *parm)
alpar@9: {     parm->msg_lev = GLP_MSG_ALL;
alpar@9:       parm->ord_alg = GLP_ORD_AMD;
alpar@9:       return;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_ipt_status - retrieve status of interior-point solution
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  int glp_ipt_status(glp_prob *lp);
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  The routine glp_ipt_status reports the status of solution found by
alpar@9: *  the interior-point solver as follows:
alpar@9: *
alpar@9: *  GLP_UNDEF  - interior-point solution is undefined;
alpar@9: *  GLP_OPT    - interior-point solution is optimal;
alpar@9: *  GLP_INFEAS - interior-point solution is infeasible;
alpar@9: *  GLP_NOFEAS - no feasible solution exists. */
alpar@9: 
alpar@9: int glp_ipt_status(glp_prob *lp)
alpar@9: {     int ipt_stat = lp->ipt_stat;
alpar@9:       return ipt_stat;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_ipt_obj_val - retrieve objective value (interior point)
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  double glp_ipt_obj_val(glp_prob *lp);
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  The routine glp_ipt_obj_val returns value of the objective function
alpar@9: *  for interior-point solution. */
alpar@9: 
alpar@9: double glp_ipt_obj_val(glp_prob *lp)
alpar@9: {     /*struct LPXCPS *cps = lp->cps;*/
alpar@9:       double z;
alpar@9:       z = lp->ipt_obj;
alpar@9:       /*if (cps->round && fabs(z) < 1e-9) z = 0.0;*/
alpar@9:       return z;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_ipt_row_prim - retrieve row primal value (interior point)
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  double glp_ipt_row_prim(glp_prob *lp, int i);
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  The routine glp_ipt_row_prim returns primal value of the auxiliary
alpar@9: *  variable associated with i-th row. */
alpar@9: 
alpar@9: double glp_ipt_row_prim(glp_prob *lp, int i)
alpar@9: {     /*struct LPXCPS *cps = lp->cps;*/
alpar@9:       double pval;
alpar@9:       if (!(1 <= i && i <= lp->m))
alpar@9:          xerror("glp_ipt_row_prim: i = %d; row number out of range\n",
alpar@9:             i);
alpar@9:       pval = lp->row[i]->pval;
alpar@9:       /*if (cps->round && fabs(pval) < 1e-9) pval = 0.0;*/
alpar@9:       return pval;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_ipt_row_dual - retrieve row dual value (interior point)
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  double glp_ipt_row_dual(glp_prob *lp, int i);
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  The routine glp_ipt_row_dual returns dual value (i.e. reduced cost)
alpar@9: *  of the auxiliary variable associated with i-th row. */
alpar@9: 
alpar@9: double glp_ipt_row_dual(glp_prob *lp, int i)
alpar@9: {     /*struct LPXCPS *cps = lp->cps;*/
alpar@9:       double dval;
alpar@9:       if (!(1 <= i && i <= lp->m))
alpar@9:          xerror("glp_ipt_row_dual: i = %d; row number out of range\n",
alpar@9:             i);
alpar@9:       dval = lp->row[i]->dval;
alpar@9:       /*if (cps->round && fabs(dval) < 1e-9) dval = 0.0;*/
alpar@9:       return dval;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_ipt_col_prim - retrieve column primal value (interior point)
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  double glp_ipt_col_prim(glp_prob *lp, int j);
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  The routine glp_ipt_col_prim returns primal value of the structural
alpar@9: *  variable associated with j-th column. */
alpar@9: 
alpar@9: double glp_ipt_col_prim(glp_prob *lp, int j)
alpar@9: {     /*struct LPXCPS *cps = lp->cps;*/
alpar@9:       double pval;
alpar@9:       if (!(1 <= j && j <= lp->n))
alpar@9:          xerror("glp_ipt_col_prim: j = %d; column number out of range\n"
alpar@9:             , j);
alpar@9:       pval = lp->col[j]->pval;
alpar@9:       /*if (cps->round && fabs(pval) < 1e-9) pval = 0.0;*/
alpar@9:       return pval;
alpar@9: }
alpar@9: 
alpar@9: /***********************************************************************
alpar@9: *  NAME
alpar@9: *
alpar@9: *  glp_ipt_col_dual - retrieve column dual value (interior point)
alpar@9: *
alpar@9: *  SYNOPSIS
alpar@9: *
alpar@9: *  #include "glplpx.h"
alpar@9: *  double glp_ipt_col_dual(glp_prob *lp, int j);
alpar@9: *
alpar@9: *  RETURNS
alpar@9: *
alpar@9: *  The routine glp_ipt_col_dual returns dual value (i.e. reduced cost)
alpar@9: *  of the structural variable associated with j-th column. */
alpar@9: 
alpar@9: double glp_ipt_col_dual(glp_prob *lp, int j)
alpar@9: {     /*struct LPXCPS *cps = lp->cps;*/
alpar@9:       double dval;
alpar@9:       if (!(1 <= j && j <= lp->n))
alpar@9:          xerror("glp_ipt_col_dual: j = %d; column number out of range\n"
alpar@9:             , j);
alpar@9:       dval = lp->col[j]->dval;
alpar@9:       /*if (cps->round && fabs(dval) < 1e-9) dval = 0.0;*/
alpar@9:       return dval;
alpar@9: }
alpar@9: 
alpar@9: /* eof */