|
From: | Meketon, Marc |
Subject: | RE: [Help-glpk] Check for a solution |
Date: | Tue, 10 Oct 2006 10:03:05 -0400 |
Theoretically, finding a feasible solution
takes a linear programming algorithm – they have the same
complexity. You could always express a
linear program optimization problem as simply finding any feasible solution of the
primal and dual problem with the added constraint that the objective value of
the primal is less than or equal to the objective value of the dual (assuming
the standard problem description). The
point is that there is no general way of finding a feasible solution that is
inherently faster than using a linear programming algorithm because if there
was such a technique it could be used for the general linear programming
optimization algorithm. If all you are after is to find a feasible
solution you probably should just set the objective coefficients all to zero
and then solve that problem. -Marc From:
address@hidden
[mailto:address@hidden On Behalf Of F. Javier Diego Martín Hello
Is
it possible to create a LPX instance and know if the problem has a feasible
solution without solve it? Thanks
____________________________________________________________ Grupo Gesfor S.A. Avda. de Manoteras 32 Telf: 91 304 80 94 Fax: 91 754 50 52 address@hidden La información
contenida en este mensaje y en cualquiera de sus anexos es This e-mail and any attachments may be confidential or legally privileged. If you received this message in error or are not the intended recipient, you should destroy the e-mail message and any attachments or copies, and you are prohibited from retaining, distributing, disclosing or using any information contained herein. Please inform us of the erroneous delivery by return e-mail. Thank you for your cooperation. ---------------------------------------------------------------------------- |
[Prev in Thread] | Current Thread | [Next in Thread] |