Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method

A. Karakitsiou () and A. Migdalas ()
Additional contact information
A. Karakitsiou: Technological Educational Institute of Central Macedonia
A. Migdalas: Luleå University of Technology

Operational Research, 2016, vol. 16, issue 3, No 2, 421 pages

Abstract: Abstract Many problems in supply chain optimization concern the minimization of a differentiable convex objective function subject to a set of linear constraints. The aim of this work is to present a number of such problems and to propose an efficient method for their solution. The proposed method is based on improvements of the well known Frank–Wolfe algorithm. The computational results of the proposed algorithm demonstrate its effectiveness and efficiency.

Keywords: Supply chain management; Convex flow problem; Frank–Wolfe algorithm; Regularized Frank–Wolfe; Simplicial decomposition (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12351-015-0205-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:16:y:2016:i:3:d:10.1007_s12351-015-0205-x

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-015-0205-x

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().