Abstract
Supply chain network are considered as solution for effectively meeting customer requirements such as low cost, high product variety, quality and shorter lead times. The success of a supply chain lies in good strategic and tactical planning and monitoring at the operational level. Strategic planning is long term planning and usually consists in selecting providers and distributors, location and capacity planning of manufacturing/servicing units, among others.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Le Thi Hoai An, Pham Dinh Tao and Le Dung Muu (1999) Exact Penalty in DC Programming. Vietnam Journal of Mathematics 27:2, pp 1216–1231.
Le Thi Hoai An, Pham Dinh Tao (2001) A continuous approach for globally solving linearly constrained 0–1 programming problems, Journal of Global Optimization 50, pp. 93–120.
Le Thi Hoai An, Pham Dinh Tao (2003) Large Scale Molecular Optimization From Distance Matrices by a DC Optimization Approach. SIAM Journal on Optimization, Vol. 14, No 1 (2003), pp. 77–116.
Le Thi Hoai An, Pham Dinh Tao (2005) The DC (Difference of Convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problem. Annals of Operations Research 133: 23–46.
Satyaveer S. Chauhan, Rakesh Nagi and Jean-Marie Proth (2002) Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity. INRIA Research Report, RR-4658.
Satyaveer S. Chauhan (2003) Chaînes d’approvisionnement: approches stratégique et tactique. Thèse de Doctorat, Université de Metz.
Pham Dinh Tao, Le Thi Hoai An (1997) Convex analysis approach to DC programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday 22:1, pp 289–355.
Pham Dinh Tao and Le Thi Hoai An (1998) DC optimization algorithms for solving the trust region subproblem. SIAM J.Optimization 8:476–505.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nam, N.C., Le An, T.H., Tao, P.D. (2007). A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_82
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)