Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"

> > > Set x(i,s,j) = y(i,s,j,i,s,j) at the start of each iteration.
> >
> > Then those y values of the form y(i,s,j,i,s,j) will be at least
> > as large as lambda.
>
> When lambda is their minimum?

You are actually correct on this point. So ignore my comment above.

>
>
> How do you handle the others? You can't
> > subtract lambda, because that could be negative. You can't leave
> > them as they are, because then constraints the proof relies upon
> > won't hold.
>
> What specific constraints are you referring to?

The question above remains: What specific constraints are you referring
to? What would cause them to stop holding (since the solution at hand
is feasible)?

>
> >
> >
> > > I believe
> > > this is indicated in the paper. But, I will try to see if it can
> > > emphasized further if/when I do a next revision of the paper.
> >
> > It's not a matter of emphasis.
>
> >
> > --
> > --Bryan

.

Relevant Pages

  • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
    ... What specific constraints are you referring ... > If you subtract lambda from all the yvalues, some ...
    (comp.theory)
  • Re: F.Y.I. - Revised paper "P=NP: LP Formulation of the TSP"
    ... >>>>When lambda is their minimum? ... You can't leave>>>them as they are, because then constraints the proof relies upon>>>won't hold. ... What specific constraints are you referring ... If you just subtract lambda from values of the form y, then constraints such as 2.21 don't hold. ...
    (comp.theory)
  • Re: Linear optimization problem
    ... The algorithm just computes the bracket when ... The corresponding lambda would change its value ... when the constraints change. ...
    (comp.soft-sys.matlab)
  • Re: deepmap?
    ... (lambda (proc filter ls) ... (lambda (prev x) ...
    (comp.lang.scheme)
  • Re: deepmap?
    ... (lambda (proc filter ls) ... (define (deepmap p f lst) ... (lambda (prev x) ...
    (comp.lang.scheme)