Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 27, 1993 - Issue 3
Submit an article Journal homepage
34
Views
12
CrossRef citations to date
0
Altmetric
Original Articles

Strongly polynomial algorithm for a production-transportation problem with concave production cost

H. Tuy Department of Mathematics, Linköping Institute of Technology, Linköping, S-581, Sweden
,
S. Ghannadan Department of Mathematics, Linköping Institute of Technology, Linköping, S-581, Sweden
,
A. Migdalas Department of Mathematics, Linköping Institute of Technology, Linköping, S-581, Sweden
&
P.V. VÄarbrand Department of Mathematics, Linköping Institute of Technology, Linköping, S-581, Sweden
Pages 205-227 | Published online: 20 Mar 2007

Citations (12)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

H. Tuy, S. Ghannadan, A. Migdalas & P. VÄrbrand. (1995) Strongly polynomial algorithm for two special minimum concave cost network flow problems. Optimization 32:1, pages 23-43.
Read now

Articles from other publishers (11)

Ankur Sinha, Arka Das, Guneshwar Anand & Sachin Jayaswal. (2023) A general purpose exact solution method for mixed integer concave minimization problems. European Journal of Operational Research 309:3, pages 977-992.
Crossref
Yuli Zhang, Zuo‐Jun Max Shen & Shiji Song. (2016) Distributionally Robust Optimization of Two‐Stage Lot‐Sizing Problems. Production and Operations Management 25:12, pages 2116-2131.
Crossref
Hoang TuyHoang Tuy. 2016. Convex Analysis and Global Optimization. Convex Analysis and Global Optimization 283 336 .
Hidetoshi Nagai & Takahito Kuno. (2005) A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST. Journal of the Operations Research Society of Japan 48:2, pages 97-110.
Crossref
Hoang Tuy. 2000. Progress in Optimization. Progress in Optimization 3 20 .
Takahito Kuno & Takahiro Utsunomiya. (1997) Minimizing a linear multiplicative-type function under network flow constraints. Operations Research Letters 20:3, pages 141-148.
Crossref
K. Holmqvist, A. Migdalas & P. M. Pardalos. 1997. Developments in Global Optimization. Developments in Global Optimization 301 313 .
Hoang Tuy, Saied Ghannadan, Athanasios Migdalas & Peter Värbrand. (1996) A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables. Mathematical Programming 72:3, pages 229-258.
Crossref
Takahito Kuno. (1996) A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE. Journal of the Operations Research Society of Japan 39:1, pages 63-76.
Crossref
Hoang Tuy, Saied Ghannadan, Athanasios Migdalas & Peter V�rbrand. (1995) The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs. Journal of Global Optimization 6:2, pages 135-151.
Crossref
Hoang Tuy. 1995. Handbook of Global Optimization. Handbook of Global Optimization 149 216 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.