On the solution of multidimensional convex separable continuous knapsack problem with bounded variables

DOI10.1016/J.EJOR.2015.06.014zbMath1346.90673OpenAlexW594135192MaRDI QIDQ319990

Stefan M. Stefanov

Publication date: 6 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.014

zbMATH Keywords

convex programmingnecessary and sufficient optimality conditionsseparable programming

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A fragile multi-CPR game

Cites Work

• Unnamed Item
• Unnamed Item
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
• An O(n) algorithm for quadratic knapsack problems
• Algorithms for the solution of quadratic knapsack problems
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Algorithms for bound constrained quadratic programming problems
• On the continuous quadratic knapsack problem
• Method for solving a convex integer programming problem
• On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
• Well-posedness and primal-dual analysis of some convex separable optimization problems
• On the solution of concave knapsack problems
• An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
• Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
• The Theory of Search: Optimum Distribution of Search Effort
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables
• Valid inequalities, cutting planes and integrality of the knapsack polytope
• A Lagrangian dual method for solving variational inequalities
• Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
• On the solution of variational inequality problems by using cutting plane methods
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
• Convex quadratic programming with one constraint and bounded variables
• 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
• Technical Note—Allocation of Effort Resources among Competing Activities
• A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
• Valid inequalities and cutting planes for some polytopes
• Validation of subgradient optimization
• Convex separable minimization subject to bounded variables

This page was built for publication: On the solution of multidimensional convex separable continuous knapsack problem with bounded variables