move the document "Linear Programming in Sage" to "Thematic Tutorials"

[sagetrac-mvngu]

Move the document "Linear Programming in Sage", found here and here, to the classification "Thematic Tutorials". The original proposal can be found on sage-devel and sage-combinat-devel.

Notes: The current ticket needs to be coordinated with #8470.

Depends on #7311

The methods detailed in this Howto, along with some features used, makes it dependent also on :

• Add a traveling salesman problem solver #2203
• Improve the add_constraint method from MixedIntegerLinearProgram #7311
• Edge-disjoint spanning trees #7476
• Maximum Average Degree of a graph #7529
• Steiner Tree #8403
• Computing a H-minor #8404
• Linear Arboricity, Acyclic edge coloring #8405

Nathann

CC: @nathanncohen @jasongrout

Component: documentation

Issue created by migration from https://trac.sagemath.org/ticket/8467

[nathanncohen]

comment:2

Here is where I have for the moment. I still need to rewrite LP examples for some problems, but at least I reformatted everything for Sphinx.

It will require the new LP patch enabling a new syntax for constraints #7311

Nathann

[nathanncohen]

comment:3

Oh yes, and there is also something to take care of : the new patch for CPLEX support brings changes to the current LP document in the Constructions manual... Only a few lines concerning CPLEX at the end of it, and some fixes, but we should not lose it when deleting the current document and replacing it with this one in the HOWTO manual :-)

Nathann

[nathanncohen]

comment:5

this version passes doctests !

Nathann

[nathanncohen]

comment:6

Here it is ! :-)

[jasongrout]

comment:7

Attachment: linear_programming2.rst.gz

[sagetrac-pang]

comment:8

I've read up to the "Maximum average degree" problem, and I have some found some errata:

• line 63: Errata on example LP
• line 161: maximization instead of minimization
• line 177: missing objective function
• line 200-204: problem not written properly
• line 204: alternative formulation with only one variable for each edge

I adjoint a rst file with corrections. The example on "Maximum average degree" is correct but I find it harder to follow than the previous ones, for a non-expert in graph-theory. I don't know which is the target audience...

[nathanncohen]

comment:9

Attachment: linear_programming2_some_changes.rst.gz

Thank you very much for reading it until then !!! Actually, I will need to change some parts of it now that GLPK is a standard SPKG. I will also update the end of it, to give more natural examples :-)

I am setting it to "needs work" until this is done !!

Nathann

[jhpalmieri]

comment:10

When this is ready, could you produce it as a Mercurial patch file?

[nathanncohen]

comment:11

Of course of course ! :-)

[nathanncohen]

comment:12

This ticket should be closed as a duplicate of #9836 :-)

Nathann

[sagetrac-mvngu]

comment:13

Close as duplicate of #9836.