Skip to content
Back to top
View this page
Edit this page

# Numerical Optimization

- Knapsack Problems
- Mixed Integer Linear Programming
- Semidefinite Programming
- Linear Functions and Constraints
- Matrix/Vector-Valued Linear Functions: Parents
- Matrix/Vector-Valued Linear Functions: Elements
- Constraints on Linear Functions Tensored with a Free Module
- Numerical Root Finding and Optimization
- Interactive Simplex Method
- Gauss-Legendre Integration for Vector-Valued Functions

## Linear Optimization (LP) and Mixed Integer Linear Optimization (MIP) Solver backends

- Generic Backend for LP solvers
- InteractiveLP Backend
- GLPK Backend
- GLPK/exact Backend (simplex method in exact rational arithmetic)
- GLPK Backend for access to GLPK graph functions
- PPL Backend
- CVXOPT Backend

Sage also supports, via optional packages, CBC (COIN-OR), CPLEX (ILOG), and Gurobi. In order to find out how to use them in Sage, please refer to the Thematic Tutorial on Linear Programming.

The following backend is used for debugging and testing purposes.

- Logging Backend

## Semidefinite Optimization (SDP) Solver backends

- Generic Backend for SDP solvers
- CVXOPT SDP Backend

For more details on CVXOPT, see CVXOPT documentation.

# Indices and Tables

- Index

- Module Index

- Search Page