Projections in minimax algebra

R.A. Cuninghame-Green

    Research output: Contribution to journalArticleAcademic

    16 Citations (Scopus)
    45 Downloads (Pure)

    Abstract

    An axiomatic theory of linear operators can be constructed for abstract spaces defined over (R, ⊕, ⊗), that is over the (extended) real numbersR with the binary operationsx ⊕ y = max (x,y) andx ⊗ y = x + y. Many of the features of conventional linear operator theory can be reproduced in this theory, although the proof techniques are quite different. Specialisation of the theory to spaces ofn-tuples provides techniques for analysing a number of well-known operational research problems, whilst specialisation to function spaces provides a natural formal framework for certain familiar problems of approximation, optimisation and duality.
    Original languageUndefined
    Pages (from-to)111-123
    JournalMathematical programming
    Volume10
    Issue number1
    DOIs
    Publication statusPublished - 1976

    Keywords

    • IR-85459

    Cite this

    Cuninghame-Green, R.A. / Projections in minimax algebra. In: Mathematical programming. 1976 ; Vol. 10, No. 1. pp. 111-123.
    @article{a4cef88c66b84ecb9e2a84a39213e7c6,
    title = "Projections in minimax algebra",
    abstract = "An axiomatic theory of linear operators can be constructed for abstract spaces defined over (R, ⊕, ⊗), that is over the (extended) real numbersR with the binary operationsx ⊕ y = max (x,y) andx ⊗ y = x + y. Many of the features of conventional linear operator theory can be reproduced in this theory, although the proof techniques are quite different. Specialisation of the theory to spaces ofn-tuples provides techniques for analysing a number of well-known operational research problems, whilst specialisation to function spaces provides a natural formal framework for certain familiar problems of approximation, optimisation and duality.",
    keywords = "IR-85459",
    author = "R.A. Cuninghame-Green",
    year = "1976",
    doi = "10.1007/BF01580656",
    language = "Undefined",
    volume = "10",
    pages = "111--123",
    journal = "Mathematical programming",
    issn = "0025-5610",
    publisher = "Springer",
    number = "1",

    }

    Cuninghame-Green, RA 1976, 'Projections in minimax algebra', Mathematical programming, vol. 10, no. 1, pp. 111-123. https://doi.org/10.1007/BF01580656

    Projections in minimax algebra. / Cuninghame-Green, R.A.

    In: Mathematical programming, Vol. 10, No. 1, 1976, p. 111-123.

    Research output: Contribution to journalArticleAcademic

    TY - JOUR

    T1 - Projections in minimax algebra

    AU - Cuninghame-Green, R.A.

    PY - 1976

    Y1 - 1976

    N2 - An axiomatic theory of linear operators can be constructed for abstract spaces defined over (R, ⊕, ⊗), that is over the (extended) real numbersR with the binary operationsx ⊕ y = max (x,y) andx ⊗ y = x + y. Many of the features of conventional linear operator theory can be reproduced in this theory, although the proof techniques are quite different. Specialisation of the theory to spaces ofn-tuples provides techniques for analysing a number of well-known operational research problems, whilst specialisation to function spaces provides a natural formal framework for certain familiar problems of approximation, optimisation and duality.

    AB - An axiomatic theory of linear operators can be constructed for abstract spaces defined over (R, ⊕, ⊗), that is over the (extended) real numbersR with the binary operationsx ⊕ y = max (x,y) andx ⊗ y = x + y. Many of the features of conventional linear operator theory can be reproduced in this theory, although the proof techniques are quite different. Specialisation of the theory to spaces ofn-tuples provides techniques for analysing a number of well-known operational research problems, whilst specialisation to function spaces provides a natural formal framework for certain familiar problems of approximation, optimisation and duality.

    KW - IR-85459

    U2 - 10.1007/BF01580656

    DO - 10.1007/BF01580656

    M3 - Article

    VL - 10

    SP - 111

    EP - 123

    JO - Mathematical programming

    JF - Mathematical programming

    SN - 0025-5610

    IS - 1

    ER -