A revised iterative algorithm for decomposition goal programming

DOI10.1080/00207728308926537zbMath0526.90057OpenAlexW2092171133MaRDI QIDQ3040923

B. H. Rho, Sang M. Lee, Mitsuo Gen

Publication date: 1983

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728308926537

zbMATH Keywords

algorithmgoal programmingdecentralized organizationdesign of organizationslarge-scale management modelsmulticriteria decomposition

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Sensitivity, stability, parametric optimization (90C31) Operations research and management science (90B99)

Cites Work

• Unnamed Item
• The binary search decomposition in a decentralized organization
• A property of certain multistage linear programs and some applications
• Goal programming with linear fractional criteria
• Goal programming and multiple objective optimizations. Part I
• Decomposition Principle for Linear Programs
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
• The regional planning of sociosanitary services: methodologies and techniques of analysis
• Nested decomposition for dynamic models
• Two-Level Planning

This page was built for publication: A revised iterative algorithm for decomposition goal programming