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

A minimax resource allocation problem with variable resources

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

DOI10.1016/S0377-2217(01)00078-9zbMath1087.90524OpenAlexW2090932472MaRDI QIDQ5955090

Stephan Dempe, E. G. Gol'stejn

Publication date: 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00078-9


zbMATH Keywords

Convex programmingParametric programmingMinimax resource allocation


Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)


Related Items

A two-resource allocation algorithm with an application to large-scale zero-sum defensive games ⋮ Mathematical model and optimization in global production problems. ⋮ Optimization in production quota problem with convex cost function



Cites Work

  • Minimax resource allocation problems: Optimization and parametric analysis
  • New variants of bundle methods
  • A Max-Min Allocation Problem: Its Solutions and Applications
  • A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5955090&oldid=12120755"
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 02:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki