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

DOI10.1007/s11590-011-0288-0zbMath1262.90166OpenAlexW2049225325MaRDI QIDQ691476

Jacco L. Wielhouwer, Anja De Waegenaere

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

zbMATH Keywords

multiplier searchpegging

Mathematics Subject Classification ID

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

Related Items (3)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Constrained integer fractional programming problem with box constraints ⋮ Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints

Cites Work

• An O(n) algorithm for quadratic knapsack problems
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• The nonlinear knapsack problem - algorithms and applications
• Optimal tax depreciation lives and charges under regulatory constraints
• A survey on the continuous nonlinear resource allocation problem
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• 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
• A polynomially bounded algorithm for a singly constrained quadratic program
• 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
• Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
• 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

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