Block-angular linear ratio programmes (Q2627484)

From MaRDI portal
Revision as of 15:19, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Block-angular linear ratio programmes
scientific article

    Statements

    Block-angular linear ratio programmes (English)
    0 references
    0 references
    31 May 2017
    0 references
    Summary: The general form of linear ratio programmes has been discussed before. The block-angular form of linear ratio programmes is here discussed for the first time in literature. This form can be solved by modified Dantzig-Wolfe decomposition principle. If the problem has mixed continuous \(0\)-\(1\) variables, modified upper-bound simplex criteria and modified branch-and-bound algorithm are used. Computational experiment proved efficiency of the block-angular form if compared to the general form. Cargo transportation by ship, airplane, truck, or train is a good application candidate of block-angular form of linear ratio programmes. A tramp shipping model is presented to show one possible application in transportation.
    0 references
    fractional programming
    0 references
    linear ratio programming
    0 references
    integer programming
    0 references
    branch and bound
    0 references
    decomposition
    0 references
    block angular
    0 references
    cargo transport
    0 references
    tramp shipping model
    0 references
    modelling
    0 references
    freight transport
    0 references

    Identifiers