A decomposition method for structured linear and nonlinear programs

DOI10.1016/S0022-0000(69)80026-7zbMath0184.44402OpenAlexW2021036157MaRDI QIDQ2535943

Yanyan Li

Publication date: 1969

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(69)80026-7

zbMATH Keywords

operations research

Related Items (5)

A generalized upper bounding method for doubly coupled linear programs ⋮ A projective method for structured nonlinear programs ⋮ A partitioning algorithm for the multicommodity network flow problem ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ A decomposition method for structured linear and nonlinear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Primal partition programming for block diagonal matrices
• Minmax and duality in nonlinear programming
• A decomposition method for structured quadratic programming problems
• A decomposition method for structured linear and nonlinear programs
• Decomposition Principle for Linear Programs
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• A duality theorem for non-linear programming
• A Nonlinear Decomposition Principle

This page was built for publication: A decomposition method for structured linear and nonlinear programs