Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Continuous modular design problem: analysis and solution algorithms

From MaRDI portal
Publication:868591
Jump to:navigation, search

DOI10.1007/s10957-006-9141-5zbMath1139.90410OpenAlexW2001219065MaRDI QIDQ868591

Harold P. Benson

Publication date: 6 March 2007

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-006-9141-5

zbMATH Keywords

separable programmingtransportation problemgeneralized Benders decompositionModular design


Mathematics Subject Classification ID

Quadratic programming (90C20) Duality theory (optimization) (49N15)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Generalized Benders decomposition
  • A duality theorem for non-linear programming
  • A monotonic passy-like algorithm for the modular design problem
  • A Simplex-Like Algorithm for the Continuous Modular Design Problem
  • Modular Design, Generalized Inverses, and Convex Programming
  • Modular Design: An Application of Structured Geometric Programming
  • Modular Design—A Special Case in Nonlinear Programming
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:868591&oldid=12814278"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 16:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki