On a nonseparable convex maximization problem with continuous Knapsack constraints

DOI10.1016/J.ORL.2006.01.010MaRDI QIDQ2643790zbMATH OpenOpenAlexFDO

Authors H. Edwin Romeijn, Joseph Geunes, Kevin M. Taaffe

Publication date 27 August 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.01.010

zbMATH Keywords

KKT optimality conditionscontinuous Knapsacknonseparable optimization

Mathematics Subject Classification ID

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

Recommendations

• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
• A unified method for a class of convex separable nonlinear knapsack problems
• A nonlinear knapsack problem
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• A nonlinear knapsack problem
• A note on a general nonlinear knapsack problem
• Algorithms for the solution of quadratic knapsack problems
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Economic ordering decisions with market choice flexibility
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Exact Solution of the Quadratic Knapsack Problem
• Introduction to global optimization
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• Markowitz revisited: mean-variance models in financial portfolio analysis
• On a discrete nonlinear and nonseparable knapsack problem
• On optimality conditions in nondifferentiable programming
• On the solution of concave knapsack problems
• Quadratic knapsack problems
• Target market selection and marketing effort under uncertainty: the selective newsvendor
• The Nonlinear Resource Allocation Problem
• The continuous-time single-sourcing problem with capacity expansion opportunities
• The nonlinear knapsack problem - algorithms and applications
• Warehouse-Retailer Network Design Problem

Cited in

(14)

• Solving knapsack problems with \(S\)-curve return functions
• Allocating procurement to capacitated suppliers with concave quantity discounts
• The symmetric quadratic knapsack problem: approximation and scheduling applications
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• Piecewise convex maximization approach to multiknapsack
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
• A unified method for a class of convex separable nonlinear knapsack problems
• Nonconvex piecewise linear knapsack problems
• An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
• Target market selection and marketing effort under uncertainty: the selective newsvendor
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
• On a Reduction for a Class of Resource Allocation Problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: On a nonseparable convex maximization problem with continuous Knapsack constraints

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