Indexing in mathematical programming languages is supported explicitly through subscripts or implicitly through vector and matrix notations. An approach that combines the best features of subscripts and implicit indexing is presented. Algebraic expressions are defined without subscripts. The indexing information is made explicit and precedes each expression. Applications are shown for dense, sparse, offset, and other forms of indexing.
展开▼
