Block-angular linear ratio programmes (Q2627484): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1504/ijor.2014.059508 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017810935 / rank
 
Normal rank

Latest revision as of 08:50, 30 July 2024

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