Sage Reference Manual: Numerical Optimization - Mirrors

More documents

Recommendations

Info

Sage Reference Manual: Numerical Optimization, Release 6.1.1 ncols() Return the number of columns/variables. EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.ncols() 0 sage: p.add_variables(2) 1 sage: p.ncols() 2 nrows() Return the number of rows/constraints. EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.nrows() 0 sage: p.add_linear_constraints(2, 2.0, None) sage: p.nrows() 2 objective_coefficient(variable, coeff=None) Set or get the coefficient of a variable in the objective function INPUT: •variable (integer) – the variable’s id •coeff (integer) – its coefficient EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.add_variable() 0 sage: p.objective_coefficient(0) 0 sage: p.objective_coefficient(0,2) sage: p.objective_coefficient(0) 2 problem_name(name=’NULL’) Return or define the problem’s name INPUT: •name (char *) – the problem’s name. When set to NULL (default), the method returns the problem’s name. EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.problem_name("There once was a french fry") sage: print p.problem_name() There once was a french fry 98 Chapter 5. LP Solver backends
Sage Reference Manual: Numerical Optimization, Release 6.1.1 row(i) Return a row INPUT: •index (integer) – the constraint’s id. OUTPUT: A pair (indices, coeffs) where indices lists the entries whose coefficient is nonzero, and to which coeffs associates their coefficient on the model of the add_linear_constraint method. EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.add_variables(5) 4 sage: p.add_linear_constraint(zip(range(5), range(5)), 2, 2) sage: p.row(0) ([1, 2, 3, 4], [1, 2, 3, 4]) sage: p.row_bounds(0) (2, 2) row_bounds(index) Return the bounds of a specific constraint. INPUT: •index (integer) – the constraint’s id. OUTPUT: A pair (lower_bound, upper_bound). Each of them can be set to None if the constraint is not bounded in the corresponding direction, and is a real value otherwise. EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.add_variables(5) 4 sage: p.add_linear_constraint(zip(range(5), range(5)), 2, 2) sage: p.row(0) ([1, 2, 3, 4], [1, 2, 3, 4]) sage: p.row_bounds(0) (2, 2) row_name(index) Return the index th row name INPUT: •index (integer) – the row’s id EXAMPLE: sage: from sage.numerical.backends.generic_backend import get_solver sage: p = get_solver(solver = "PPL") sage: p.add_linear_constraints(1, 2, None, names="Empty constraint 1") sage: p.row_name(0) ’Empty constraint 1’ 5.4. PPL Backend 99
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:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
CHAPTER FOUR NUMERICAL ROOT FINDING
Page 47 and 48:
Page 49 and 50:
Page 51 and 52: Sage Reference Manual: Numerical Op
Page 53 and 54: CHAPTER FIVE LP SOLVER BACKENDS 5.1
Page 101: 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?