Sage Reference Manual: Numerical Optimization - Mirrors

More documents

Recommendations

Info

Sage Reference Manual: Numerical Optimization, Release 6.1.1 •vertices – iterator of vertex labels (str). A label can be None. OUTPUT: Generated names of new vertices if there is at least one None value present in vertices. None otherwise. EXAMPLE: sage: from sage.numerical.backends.glpk_graph_backend import GLPKGraphBackend sage: gbe = GLPKGraphBackend() sage: vertices = [None for i in range(3)] sage: gbe.add_vertices(vertices) [’0’, ’1’, ’2’] sage: gbe.add_vertices([’A’, ’B’, None]) [’5’] sage: gbe.add_vertices([’A’, ’B’, ’C’]) sage: gbe.vertices() [’0’, ’1’, ’2’, ’A’, ’B’, ’5’, ’C’] TESTS: sage: from sage.numerical.backends.glpk_graph_backend import GLPKGraphBackend sage: gbe = GLPKGraphBackend() sage: gbe.add_vertices([None, None, None, ’1’]) [’0’, ’2’, ’3’] cpp() Solves the critical path problem of a project network. OUTPUT: The length of the critical path of the network EXAMPLE: sage: from sage.numerical.backends.glpk_graph_backend import GLPKGraphBackend sage: gbe = GLPKGraphBackend() sage: gbe.add_vertices([None for i in range(3)]) [’0’, ’1’, ’2’] sage: gbe.set_vertex_demand(’0’, 3) sage: gbe.set_vertex_demand(’1’, 1) sage: gbe.set_vertex_demand(’2’, 4) sage: a = gbe.add_edge(’0’, ’2’) sage: a = gbe.add_edge(’1’, ’2’) sage: gbe.cpp() 7.0 sage: v = gbe.get_vertex(’1’) sage: print 1, v["rhs"], v["es"], v["ls"] # abs tol 1e-6 1 1.0 0.0 2.0 delete_edge(u, v, params=None) Deletes an edge from the graph. If an edge does not exist it is ignored. INPUT: •u – The name (as str) of the tail vertex of the edge •v – The name (as str) of the tail vertex of the edge 84 Chapter 5. LP Solver backends
Sage Reference Manual: Numerical Optimization, Release 6.1.1 •params – params – An optional dict containing the edge parameters (see meth:add_edge). If this parameter is not provided, all edges connecting u and v are deleted. Otherwise only edges with matching parameters are deleted. See Also: delete_edges() EXAMPLE: sage: from sage.numerical.backends.glpk_graph_backend import GLPKGraphBackend sage: gbe = GLPKGraphBackend() sage: edges = [("A", "B", {"low":0.0, "cap":10.0, "cost":5})] sage: edges.append(("A", "B", {"low":0.0, "cap":15.0, "cost":10})) sage: edges.append(("B", "C", {"low":0.0, "cap":20.0, "cost":1})) sage: edges.append(("B", "C", {"low":0.0, "cap":10.0, "cost":20})) sage: gbe.add_edges(edges) sage: gbe.delete_edge("A", "B") sage: gbe.delete_edge("B", "C", {"low":0.0, "cap":10.0, "cost":20}) sage: print gbe.edges()[0][0], gbe.edges()[0][1], gbe.edges()[0][2][’cost’] B C 1.0 delete_edges(edges) Deletes edges from the graph. Non existing edges are ignored. INPUT: •edges – An iterable container of edges. See Also: delete_edge() EXAMPLE: sage: from sage.numerical.backends.glpk_graph_backend import GLPKGraphBackend sage: gbe = GLPKGraphBackend() sage: edges = [("A", "B", {"low":0.0, "cap":10.0, "cost":5})] sage: edges.append(("A", "B", {"low":0.0, "cap":15.0, "cost":10})) sage: edges.append(("B", "C", {"low":0.0, "cap":20.0, "cost":1})) sage: edges.append(("B", "C", {"low":0.0, "cap":10.0, "cost":20})) sage: gbe.add_edges(edges) sage: gbe.delete_edges(edges[1:]) sage: len(gbe.edges()) 1 sage: print gbe.edges()[0][0], gbe.edges()[0][1], gbe.edges()[0][2][’cap’] A B 10.0 delete_vertex(vert) Removes a vertex from the graph. Trying to delete a non existing vertex will raise an exception. INPUT: •vert – The name (as str) of the vertex to delete. EXAMPLE: sage: from sage.numerical.backends.glpk_graph_backend import GLPKGraphBackend sage: gbe = GLPKGraphBackend() sage: verts = ["A", "D"] 5.3. GLPK Backend for access to GLPK graph functions 85
Page 1:
Sage Reference Manual: Numerical Op
Page 5 and 6:
CHAPTER ONE KNAPSACK PROBLEMS This
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
CHAPTER TWO MIXED INTEGER LINEAR PR
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38: CHAPTER THREE LINEAR FUNCTIONS AND
Page 39 and 40: Sage Reference Manual: Numerical Op
Page 45 and 46: CHAPTER FOUR NUMERICAL ROOT FINDING
Page 53 and 54: CHAPTER FIVE LP SOLVER BACKENDS 5.1
Page 87: Sage Reference Manual: Numerical Op
Page 107 and 108: CHAPTER SIX INDICES AND TABLES •
Page 109 and 110: BIBLIOGRAPHY [HPS08] J. Hoffstein,
Page 111 and 112: PYTHON MODULE INDEX n sage.numerica
Page 113 and 114: INDEX A add_col() (sage.numerical.b
show all

Sage Reference Manual: Numerical Optimization - Mirrors

Create successful ePaper yourself

Delete template?

Save as template?