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

An algorithm for decomposition coordination of large scale convex programming problems

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

DOI10.1016/0305-0548(88)90062-7zbMath0655.90057OpenAlexW2019902045MaRDI QIDQ1109681

Talaat H. M. Refaat, Aly K. El-Ariny, Mohamed Sayed Ali Osman

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90062-7


zbMATH Keywords

pricing mechanismadditive separable objective and constraint functionsdecomposition coordination algorithmlarge scale convex programmingstack data structure


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)


Related Items (1)

Optimality tests for partitioning and sectional search algorithms




Cites Work

  • Interactive Multiobjective Decisionmaking for Large-Scale Systems and Its Application to Environmental Systems
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: An algorithm for decomposition coordination of large scale convex programming problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1109681&oldid=13148535"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki