English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The present paper attempts to foreground a modied approach to the algorithm as conceived by Sharma et al. [1] in the paper entitled ’A cost and pipeline trade-off in a transportation problem’. In 2013, Sharma et al. [1] came up with an idea of pivotal time and consequentially evolved a convergent algorithm to determine cost pipeline trade off pairs corresponding to the chosen pivotal time. We have observed one limitation of the proposed algorithm which directly affects the global minimum character of the pipeline. In the present paper, we suggest a modication of the limitation found in the procedural formulation developed by Sharma et al. [1]. Keywords: Transportation problem, Combinatorial optimization, Bottleneck transportation problem, Bi-criteria transportation problem, Efficient points.

Limitation and modification: On a cost pipeline trade-off in a transportation problem