Dear Nicolas,
El jue, 08-02-2024 a las 01:39 +0300, Andrew Makhorin escribió:
> Forwarded Message
>
> Date: Wed, 7 Feb 2024 16:17:04 -0300
> Subject: GLPK doubt
> To: help-glpk@gnu.org
> From: Nicolas Herculano Pires
> > Dear esteemed GNU colleague,
> >
> > I hope this message
Hi,
El vie, 07-10-2022 a las 11:04 +1030, Prabhu Manyem escribió:
> To Andrew, Peter and Manuel,
>
> Thank you for your help on this topic.
>
> To Manuel, Why only vertices next to the starting vertex? If the
> links are A-->B-->C and B-->D, so first you go from A to B, then B to
> C, then back
Hi, Andrew:
I don't kown if it is implemented somewhere. But the problem of generating all
the optimal vertices is the same as generating all the
vertices of a new polyhedron in 1 lower dimension.
But that problem is known to be NP-complete [1], so it is very hard or almost
impossible as soon a
I agree with you, Andrew, but the problem is when the output is not a
real number.
Suppose that you have to decide which of the project that are planning
a big company will be done in the next year. Little difference in
computation may lead to a solutions that are far enough one from the
other pro
the floating computation capabilities of the system CPU.
--
Manuel Muñoz Márquez
>
