Sage Reference Manual: Numerical Optimization - Mirrors

More documents

Recommendations

Info

Sage Reference Manual: Numerical Optimization, Release 6.1.1 OUTPUT: Boolean. EXAMPLES: sage: p = MixedIntegerLinearProgram() sage: b = p.new_variable() sage: (b[0] == b[1]).is_less_or_equal() False sage: (b[0]
Sage Reference Manual: Numerical Optimization, Release 6.1.1 EXAMPLES: sage: p = MixedIntegerLinearProgram() sage: LC = p.linear_constraints_parent(); LC Linear constraints over Real Double Field sage: from sage.numerical.linear_functions import LinearConstraintsParent sage: LinearConstraintsParent(p.linear_functions_parent()) is LC True linear_functions_parent() Return the parent for the linear functions EXAMPLES: sage: LC = MixedIntegerLinearProgram().linear_constraints_parent() sage: LC.linear_functions_parent() Linear functions over Real Double Field class sage.numerical.linear_functions.LinearFunction Bases: sage.structure.element.ModuleElement An elementary algebra to represent symbolic linear functions. Warning: You should never instantiate LinearFunction manually. Use the element constructor in the parent instead. For convenience, you can also call the MixedIntegerLinearProgram instance directly. EXAMPLES: For example, do this: sage: p = MixedIntegerLinearProgram() sage: p({0 : 1, 3 : -8}) x_0 - 8*x_3 or this: sage: parent = p.linear_functions_parent() sage: parent({0 : 1, 3 : -8}) x_0 - 8*x_3 instead of this: sage: from sage.numerical.linear_functions import LinearFunction sage: LinearFunction(p.linear_functions_parent(), {0 : 1, 3 : -8}) x_0 - 8*x_3 dict() Returns the dictionary corresponding to the Linear Function. OUTPUT: The linear function is represented as a dictionary. The value are the coefficient of the variable represented by the keys ( which are integers ). The key -1 corresponds to the constant term. EXAMPLE: sage: p = MixedIntegerLinearProgram() sage: lf = p({0 : 1, 3 : -8}) sage: lf.dict() {0: 1.0, 3: -8.0} 37
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 and 38: CHAPTER THREE LINEAR FUNCTIONS AND
Page 39: 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 91 and 92:
Sage Reference Manual: Numerical Op
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?