#20559: InteractiveLPProblem, dictionaries: add_constraint / add_row methods
-------------------------------------+-------------------------------------
       Reporter:  mkoeppe            |        Owner:
           Type:  enhancement        |       Status:  needs_work
       Priority:  major              |    Milestone:  sage-7.2
      Component:  linear             |   Resolution:
  programming                        |    Merged in:
       Keywords:                     |    Reviewers:  Andrey Novoseltsev
        Authors:  Peijun Xiao        |  Work issues:  rebasing
Report Upstream:  N/A                |       Commit:
         Branch:                     |  2d444bc2f4c5ebca4003ce6b0e20a762e41f49b2
  
u/mkoeppe/interactivelpproblem__dictionaries__add_constraint___add_row_methods| 
    Stopgaps:
   Dependencies:  #20500             |
-------------------------------------+-------------------------------------

Comment (by mkoeppe):

 Just a quick reply to point 7:

 Replying to [comment:10 novoselt]:
 > 7. I don't think that `add_row` should be supported by abstract
 dictionaries - for the current revised dictionaries I'd say it is
 confusing what does it even mean. And the convoluted code to achieve it
 agrees with me ;-) Rather I'd suggest having it for regular dictionaries
 (perhaps `add_relation` would be a better name). For the revised ones
 `add_constraint`, the same as for the problem with more or less the same
 parameters, would make more sense - since revised dictionaries are linked
 to the problem, they can construct the new one and then based on it
 construct a new suitable dictionary.

 No, no, it's crucial that `add_row` is supported by abstract dictionaries.
 The whole point is to have a method that adds a row to the dictionary, no
 matter how the dictionary is internally represented. This is the operation
 needed by tableau cutting plane procedures.
 In the revised dictionary, one needs to do this kind of transformation to
 compute the new row of the problem, which gives the desired tableau row.
 (This is how tableau cutting planes are actually implemented in numerical
 solvers.)

--
Ticket URL: <http://trac.sagemath.org/ticket/20559#comment:11>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.

Reply via email to