Sage Reference Manual: Numerical Optimization - Mirrors

More documents

Recommendations

Info

Sage Reference Manual: Numerical Optimization, Release 6.1.1 TESTS: See trac ticket #12091 sage: p = MixedIntegerLinearProgram() sage: b = p.new_variable() sage: b[0]
Sage Reference Manual: Numerical Optimization, Release 6.1.1 sage: (x[1] + 1 >= 2).equals(x[1] + 1-1 >= 1-1) False equations() Iterate over the unchained(!) equations OUTPUT: An iterator over pairs (lhs, rhs) such that the individual equations are lhs == rhs. EXAMPLES: sage: p = MixedIntegerLinearProgram() sage: b = p.new_variable() sage: eqns = 1 == b[0] == b[2] == 3 == b[3]; 1 == x_0 == x_1 == 3 == x_2 sage: for lhs, rhs in eqns.equations(): ... print str(lhs) + ’ == ’ + str(rhs) 1 == x_0 x_0 == x_1 x_1 == 3 3 == x_2 inequalities() Iterate over the unchained(!) inequalities OUTPUT: eqns An iterator over pairs (lhs, rhs) such that the individual equations are lhs
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 37: 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 89 and 90:
Sage Reference Manual: Numerical Op
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?