Sage Reference Manual: Numerical Optimization - Mirrors

More documents

Recommendations

Info

Sage Reference Manual: Numerical Optimization, Release 6.1.1 sage: p = MixedIntegerLinearProgram(solver = "GLPK") sage: p.solver_parameter("timelimit", 60) sage: p.solver_parameter("timelimit") 60.0 sum(L) Efficiently computes the sum of a sequence of LinearFunction elements INPUT: •mip – the MixedIntegerLinearProgram parent. •L – list of LinearFunction instances. Note: The use of the regular sum function is not recommended as it is much less efficient than this one EXAMPLES: sage: p = MixedIntegerLinearProgram() sage: v = p.new_variable() The following command: sage: s = p.sum([v[i] for i in xrange(90)]) is much more efficient than: sage: s = sum([v[i] for i in xrange(90)]) write_lp(filename) Write the linear program as a LP file. This function export the problem as a LP file. INPUT: •filename – The file in which you want the problem to be written. EXAMPLE: sage: p = MixedIntegerLinearProgram(solver="GLPK") sage: x = p.new_variable() sage: p.set_objective(x[1] + x[2]) sage: p.add_constraint(-3*x[1] + 2*x[2], max=2) sage: p.write_lp(os.path.join(SAGE_TMP, "lp_problem.lp")) Writing problem data to ... 9 lines were written For more information about the LP file format : http://lpsolve.sourceforge.net/5.5/lp-format.htm write_mps(filename, modern=True) Write the linear program as a MPS file. This function export the problem as a MPS file. INPUT: •filename – The file in which you want the problem to be written. •modern – Lets you choose between Fixed MPS and Free MPS –True – Outputs the problem in Free MPS –False – Outputs the problem in Fixed MPS 30 Chapter 2. Mixed integer linear programming
Sage Reference Manual: Numerical Optimization, Release 6.1.1 EXAMPLE: sage: p = MixedIntegerLinearProgram(solver="GLPK") sage: x = p.new_variable() sage: p.set_objective(x[1] + x[2]) sage: p.add_constraint(-3*x[1] + 2*x[2], max=2,name="OneConstraint") sage: p.write_mps(os.path.join(SAGE_TMP, "lp_problem.mps")) Writing problem data to ... 17 records were written For information about the MPS file format : http://en.wikipedia.org/wiki/MPS_%28format%29 sage.numerical.mip.Sum(x) Only for legacy support, use MixedIntegerLinearProgram.sum() instead. EXAMPLES: sage: from sage.numerical.mip import Sum sage: Sum([]) doctest:...: DeprecationWarning: use MixedIntegerLinearProgram.sum() instead See http://trac.sagemath.org/13646 for details. sage: p = MixedIntegerLinearProgram() sage: x = p.new_variable() sage: Sum([ x[0]+x[1], x[1]+x[2], x[2]+x[3] ]) x_0 + 2*x_1 + 2*x_2 + x_3 # deprecation is only shown once 2.2. Classes and methods 31
Page 1: Sage Reference Manual: Numerical Op
Page 5 and 6: CHAPTER ONE KNAPSACK PROBLEMS This
Page 7 and 8: Sage Reference Manual: Numerical Op
Page 13 and 14: CHAPTER TWO MIXED INTEGER LINEAR PR
Page 33: Sage Reference Manual: Numerical Op
Page 37 and 38: CHAPTER THREE LINEAR FUNCTIONS AND
Page 45 and 46: CHAPTER FOUR NUMERICAL ROOT FINDING
Page 53 and 54: CHAPTER FIVE LP SOLVER BACKENDS 5.1
Page 85 and 86:
Sage Reference Manual: Numerical Op
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
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
Page 115 and 116:
Page 117 and 118:
show all

Sage Reference Manual: Numerical Optimization - Mirrors

Create successful ePaper yourself

Delete template?

Save as template?