Decomposition of uniform resource allocation problems

zbMATH Open0542.90085MaRDI QIDQ795743

Yu. B. Maksimov

Publication date: 1983

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

decompositiondimensionality reductionsequential application of the minimax criterionuniform resource allocation among independent processes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35)

Related Items (5)

On Resource Allocation Problems with Interval-Scale Coefficients ⋮ Allocation of jobs and identical resources with two pooling centers ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Resource-distribution via Boolean constraints

Recommendations

• Algorithms for separable nonlinear resource allocation problems 👍 👎
• A decomposition algorithm for nested resource allocation problems 👍 👎
• On a Reduction for a Class of Resource Allocation Problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Decomposition of uniform resource allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795743)