A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems

DOI10.1007/S11766-004-0013-1MaRDI QIDQ1769575zbMATH OpenOpenAlexFDO

Authors Detong Zhu

Publication date 4 April 2005

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-004-0013-1

zbMATH Keywords

duality theorygeneral multicommodity minimal cost flow problemsgeneralized directional derivativetrust region method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A trust region algorithm for bilevel programming problems
• A trust region algorithm for solving bilevel programming problems
• A trust region algorithm for nonlinear bilevel programming
• scientific article; zbMATH DE number 3928682
• A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost

Cites work

• A Nonmonotone Line Search Technique for Newton’s Method
• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• Superlinear convergence of a trust region type successive linear programming method

Cited in

(1)

• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems

This page was built for publication: A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769575)