Block-angular linear ratio programmes
by Said El Noshokaty
International Journal of Operational Research (IJOR), Vol. 19, No. 3, 2014

Abstract: 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.

Online publication date: Tue, 17-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com