An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria

DOI10.1007/s11431-010-4168-0zbMath1243.90230OpenAlexW2086299236MaRDI QIDQ546459

Meng Xu, Zi-You Gao

Publication date: 24 June 2011

Published in: Science China. Technological Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11431-010-4168-0

zbMATH Keywords

nonlinear complementarity problemsupply chain networkssupernetworkLevenberg-Marquardt-type methodtraffic network equilibrium

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of a two-stage telecommunication supply chain with technology dependent demand
• Topological-based bottleneck analysis and improvement strategies for traffic networks
• Equilibrium model and algorithm of urban transit assignment based on augmented network
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A supply chain network equilibrium model with random demands.
• A penalized Fischer-Burmeister NCP-function
• Integrated production/distribution planning in supply chains: An invited review
• On the resolution of monotone complementarity problems
• Closed-loop supply chain network equilibrium under legislation
• Dynamics of supply chain networks with corporate social responsibility through integrated environmental decision-making
• A non-smooth optimization model for a two-tiered supply chain network
• Equilibrium analysis and corporate social responsibility for supply chain integration
• Sensitivity analysis for the asymmetric network equilibrium problem
• Strongly Regular Generalized Equations
• A special newton-type optimization method
• On a semismooth least squares formulation of complementarity problems with gap reduction
• Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems