A survey on the continuous nonlinear resource allocation problem

DOI10.1016/j.ejor.2006.12.006zbMath1146.90493OpenAlexW1999244290MaRDI QIDQ2456404

Michael Patriksson

Publication date: 18 October 2007

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

Full work available at URL: https://research.chalmers.se/en/publication/79626

zbMATH Keywords

inventorynonlinear programmingConvex programminglogisticslarge scale optimization

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items

A method of bi-coordinate variations with tolerances and its convergence, Algorithms for separable convex optimization with linear ascending constraints, On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming, Inexact subgradient methods for quasi-convex optimization problems, Fast projection onto the simplex and the \(l_1\) ball, Decision model and analysis for investment interest expense deduction and allocation, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Decentral allocation planning in multi-stage customer hierarchies, Comparative study of two fast algorithms for projecting a point to the standard simplex, Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function, Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling, Multi-period resource allocation for estimating project costs in competitive bidding, A penalty algorithm for solving convex separable knapsack problems, A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints, An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives, On a Reduction for a Class of Resource Allocation Problems, A fast algorithm for quadratic resource allocation problems with nested constraints, Solving nested-constraint resource allocation problems with an interior point method, Selective bi-coordinate method for limit non-smooth resource allocation type problems, Fast algorithm for the quadratic knapsack problem, Stochastic optimization for real time service capacity allocation under random service demand, A centre–free approach for resource allocation with lower bounds, Allocation of limited resources under quadratic constraints, Literature reviews in operations research: a new taxonomy and a meta review, Resource allocation problems with expensive function evaluations, Minimum variance allocation among constrained intervals, On the resource allocation problem to increase reliability of transport systems, A model predictive control approach to the periodic implementation of the solutions of the optimal dynamic resource allocation problem, Resource planning and allocation problem under uncertain environment, Importance of verifying queue model assumptions before planning with simulation software, A Newton-type algorithm for solving problems of search theory, r-extreme signalling for congestion control, A two-phase method for solving continuous rank-one quadratic knapsack problems, A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming, Efficient projected gradient methods for cardinality constrained optimization, Minimizing a stochastic convex function subject to stochastic constraints and some applications, A faster algorithm for the resource allocation problem with convex cost functions, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, Multiobjective optimization of credit capital allocation in financial institutions, Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem, A breakpoint search approach for convex resource allocation problems with bounded variables, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, Simple solution methods for separable mixed linear and quadratic knapsack problem, Capacity-constrained multiple-market price discrimination, Resource allocation problems in decentralized energy management, Solving the continuous nonlinear resource allocation problem with an interior point method, Signalling and obfuscation for congestion control, A Coordinate Wise Variational Method with Tolerance Functions, A Decomposition Algorithm for Nested Resource Allocation Problems, The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming, Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty, On the optimal design of the randomized unbiased Monte Carlo estimators, A sequential updating scheme of the Lagrange multiplier for separable convex programming, Models and algorithms for energy-efficient scheduling with immediate start of jobs, Asymptotic efficiency of the proportional compensation scheme for a large number of producers, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem, A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems, On solving convex optimization problems with linear ascending constraints, A library for continuous convex separable quadratic knapsack problems

Uses Software

• NETGEN

Cites Work

• A Benders decomposition based heuristic for the hierarchical production planning problem
• A branch and search algorithm for a class of nonlinear knapsack problems
• Linear time algorithms for some separable quadratic programming problems
• A polynomial algorithm for minimum quadratic cost flow problems
• Large-scale mixed integer programming: Benders-type heuristics
• A graphical method to solve a family of allocation problems
• An O(n) algorithm for quadratic knapsack problems
• Algorithms for the solution of quadratic knapsack problems
• Relaxation methods for monotropic programs
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• A note on a general nonlinear knapsack problem
• An algorithm for the classical spatial price equilibrium problem
• Resource allocation among competing activities: A lexicographic minimax approach
• An algorithm for separable nonlinear minimax problems
• A note on multi-item inventory systems with limited capacity
• A distributed algorithm for convex network optimization problems
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• On some optimization techniques in image reconstruction from projections
• An iterative row-action method for interval convex programming
• Minimum norm problems over transportation polytopes
• Solving certain singly constrained convex optimization problems in production planning
• A nonlinear minimax allocation problem with multiple knapsack constraints
• On the continuous quadratic knapsack problem
• Minimax resource allocation problems: Optimization and parametric analysis
• Algorithms for quadratic constrained matrix problems
• On the dual coordinate ascent approach for nonlinear networks
• Theory of optimal search
• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• Conditional subgradient optimization -- theory and applications
• Capacity planning in manufacturing and computer networks
• Descent methods for convex essentially smooth minimization
• Quadratic resource allocation with generalized upper bounds
• Time bounds for selection
• An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
• The nonlinear knapsack problem - algorithms and applications
• Nonlinear integer programming for optimal allocation in stratified sampling
• The gradient projection method with exact line search
• A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
• A nonlinear knapsack problem
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• New variants of bundle methods
• Bregman proximal relaxation of large-scale 0-1 problems
• On the solution of concave knapsack problems
• Application of the dual active set algorithm to quadratic network optimization
• Constrained multi-item inventory systems: An implicit approach
• Issues in the implementation of the DSD algorithm for the traffic assignment problem
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
• A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems
• Dynamic Version of the Economic Lot Size Model
• Quadratic Programming as an Extension of Classical Quadratic Maximization
• Algorithms for Separable Nonlinear Resource Allocation Problems
• On a Class of Minimum-Cost Problems
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• The Theory of Search: Optimum Distribution of Search Effort
• A General Algorithm for the Optimal Distribution of Effort
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
• How bad is selfish routing?
• A transformation for necessary optimality conditions for systems with polynomial nonlinearities
• Multipoint methods for separable nonlinear networks
• EXTREMAL PRINCIPLES FOR SIMULATING TRAFFIC FLOW IN A NETWORK
• Optimum Allocation of Discharge to Units in a Hydro-Electric Generating Station
• On Pre-Conditioning of Matrices
• A Combined Vehicle Routing and Inventory Allocation Problem
• A Comparative Study of Algorithms for Matrix Balancing
• Optimal allocation and control problems for software-testing resources
• A Parallel Projection for the Multicommodity Network Model
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
• A lagrangean relaxation algorithm for the constrained matrix problem
• The Optimal Input Rates To A System Of Manufacturing Cells
• Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs
• CONVERGENCE PROOF OF COORDINATEWISE MINIMIZATION ALGORITHM FOR CONVEX PROGRAMMING PROBLEM WITH UPPER AND LOWER BOUNDED CONSTRAINTS
• Convex quadratic programming with one constraint and bounded variables
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Quasi-Newton Updates with Bounds
• A Max-Min Allocation Problem: Its Solutions and Applications
• Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
• Mass Screening Models for Contagious Diseases with No Latent Period
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Search and Its Optimization
• Some relationships between lagrangian and surrogate duality in integer programming
• ALGORITHMS FOR OPTIMAL ALLOCATION PROBLEMS HAVING QUADRATIC OBJECTIVE FUNCTION
• Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
• Optimal Search for a Moving Target in Discrete Time and Space
• Simple Ranking Methods for Allocation of One Resource
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Surrogate Mathematical Programming
• An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems
• The multicommodity network flow model revised to include vehicle per time period and node constraints
• Monotone solutions of the parametric linear complementarity problem
• Inventory Management in Catalog Sales Companies
• Selfish Routing in Capacitated Networks
• A Problem in Optimum Allocation
• Binding Constraint Procedures of Quadratic Programming
• A Game Theory Model of Convoy Routing
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The price of anarchy is independent of the network topology
• Convex separable minimization subject to bounded variables
• Separable programming. Theory and methods
• A pegging algorithm for the nonlinear resource allocation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques
• On Reducing a Resource Allocation Problem to a Single One-Dimensional Minimization of a Differentiable Convex Function
• AN ALGORITHM FOR THE HITCHCOCK TRANSPORTATION PROBLEMS WITH QUADRATIC COST FUNCTIONS
• Quadratic knapsack problems
• Hierarchical Production Planning: A Single Stage System
• Technical Note—Note on Constrained Maximization of a Sum
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Projection methods for variational inequalities with application to the traffic assignment problem
• Hierarchical Production Planning: A Two-Stage System
• Technical Note—Probability of Success in the Search for a Moving Target
• Productivity of activities in the optimal allocation of one resource
• Solution techniques for some allocation problems
• Computational development of a lagrangian dual approach for quadratic networks
• Solving multistage stochastic networks: An application of scenario aggregation
• Solving Large Sparse Nonlinear Programs Using GRG
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Technical Note—Allocation of Effort Resources among Competing Activities
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Finding the nearest point in A polytope
• Monotone Operators and the Proximal Point Algorithm
• On the Optimal Searching Tracks for a Moving Target
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• An Algorithm for Solving a Resource Allocation Problem
• Dualität und Approximation bei konvexen Optimierungsproblemen
• An Operational Critique of Detection Laws
• A quadratic network optimization model for equilibrium single commodity trade flows
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
• Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• Allocating Production Capacity Among Multiple Products
• Mailing Decisions in the Catalog Sales Industry
• A specially structured nonlinear integer resource allocation problem
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Validation of subgradient optimization
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
• A Projection Method for the Integer Quadratic Knapsack Problem
• The Nonlinear Resource Allocation Problem
• A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
• A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
• A Theory of Reconnaissance: I
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• New Mathematical Methods in Operations Research
• The Optimum Distribution of Effort
• Direct Use of Extremal Principles in Solving Certain Optimizing Problems Involving Inequalities
• The Theory of Search. I. Kinematic Bases
• Fallacies in Operations Research
• The Theory of Search. II. Target Detection
• The Theory of Search
• An Allocation Problem with Applications to Operations Research and Statistics
• The Theory of Max-Min, with Applications
• Surrogate Constraints
• An Improved Implicit Enumeration Approach for Integer Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Note—A Note on the Cyclic Coordinate Ascent Method
• Traffic assignment problem for a general network
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• An Application of a Lagrangian Penalty Function to Obtain Optimal Redundancy
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Matrix balancing
• On an Allocation Problem with Multistage Constraints