A breakpoint search approach for convex resource allocation problems with bounded variables

DOI10.1007/S11590-011-0288-0zbMATH Open1262.90166OpenAlexW2049225325MaRDI QIDQ691476FDOQ691476

Authors: Anja De Waegenaere, Jacco L. Wielhouwer 

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0288-0

Recommendations

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• Algorithms for separable nonlinear resource allocation problems
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables
• A survey on the continuous nonlinear resource allocation problem
• The Nonlinear Resource Allocation Problem

zbMATH Keywords

multiplier searchpegging

Mathematics Subject Classification ID

Nonlinear programming (90C30) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• A survey on the continuous nonlinear resource allocation problem
• The nonlinear knapsack problem - algorithms and applications
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• A polynomially bounded algorithm for a singly constrained quadratic program
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Optimal tax depreciation lives and charges under regulatory constraints
• Production and inventory management under multiple resource constraints
• Algorithms for separable nonlinear resource allocation problems
• Resource allocation in multisite service systems with intersite customer flows
• Quasi-Newton Updates with Bounds
• Simple Ranking Methods for Allocation of One Resource
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Technical Note—Allocation of Effort Resources among Competing Activities
• Minimizing Single-Machine Completion Time Variance
• A Projection Method for the Integer Quadratic Knapsack Problem
• The Nonlinear Resource Allocation Problem
• A pegging algorithm for the nonlinear resource allocation problem
• An O(n) algorithm for quadratic knapsack problems
• Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System

Cited In (5)

• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• Constrained integer fractional programming problem with box constraints
• Bounded Linear Allocation With A Nonlinear Cost Constraint Is An Unconstrained Problem

This page was built for publication: A breakpoint search approach for convex resource allocation problems with bounded variables

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