Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization

We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms from discrete optimization with algorithms from continuous optimization to develop approximation algorithms for these NP-hard problems with sigmoid utilities.

[1]  William Ginsberg,et al.  The multiplant firm with increasing returns to scale , 1974 .

[2]  J. G. Hollands,et al.  Engineering Psychology and Human Performance , 1984 .

[3]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[4]  Y. Narahari,et al.  Nonconvex piecewise linear knapsack problems , 2009, Eur. J. Oper. Res..

[5]  Jorge J. Moré,et al.  On the solution of concave knapsack problems , 1990, Math. Program..

[6]  Harold J. Kushner,et al.  A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise , 1964 .

[7]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[8]  R. Tyrrell Rockafellar,et al.  Lagrange Multipliers and Optimality , 1993, SIAM Rev..

[9]  Vaibhav Srivastava,et al.  Attention allocation for decision making queues , 2014, Autom..

[10]  R. Pew.  The speed-accuracy operating characteristic , 1969 .

[11]  Joseph Geunes,et al.  Allocating procurement to capacitated suppliers with concave quantity discounts , 2008, Oper. Res. Lett..

[12]  Daniel Noel Southern,et al.  Human-guided management of collaborating unmanned vehicles in degraded communication environments , 2010 .

[13]  Ambar G. Rao,et al.  Optimal budget allocation when response is S-shaped , 1983 .

[14]  Mary L. Cummings,et al.  Developing Operator Models for UAV Search Scheduling , 2010 .

[15]  Pierre Hansen,et al.  Global optimization of univariate Lipschitz functions: I. Survey and properties , 1989, Math. Program..

[16]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[17]  Vaibhav Srivastava,et al.  Hybrid combinatorial optimization: Sample problems and algorithms , 2011, IEEE Conference on Decision and Control and European Control Conference.

[18]  Pierre Hansen,et al.  Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison , 1989, Math. Program..

[19]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[20]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[21]  Jonathan D. Cohen,et al.  The physics of optimal decision making: a formal analysis of models of performance in two-alternative forced-choice tasks. , 2006, Psychological review.

[22]  James R. Freeland,et al.  S-Shaped Response Functions: Implications for Decision Models , 1980 .

[23]  Colin G. Drury,et al.  Sensitivity and validity of visual search models for multiple targets , 2002 .

[24]  Fred M. Feinberg,et al.  The Shape of Advertising Response Functions Revisited: A Model of Dynamic Probabilistic Thresholds , 2004 .

[25]  Bala Shetty,et al.  The nonlinear knapsack problem - algorithms and applications , 2002, Eur. J. Oper. Res..

[26]  Joseph Geunes,et al.  Solving knapsack problems with S-curve return functions , 2009, Eur. J. Oper. Res..

[27]  A. Zilinskas,et al.  On the Convergence of the P-Algorithm for One-Dimensional Global Optimization of Smooth Functions , 1999 .

[28]  J. Calvin.  Convergence Rate of the P-Algorithm for Optimization of Continuous Functions , 2000 .

[29]  Ruggero Carli,et al.  Task release control for decision making queues , 2010, Proceedings of the 2011 American Control Conference.

[30]  Jean-Baptiste Hiriart-Urruty,et al.  On optimality conditions in nondifferentiable programming , 1978, Math. Program..

[31]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[32]  Michael H. Rothkopf,et al.  Bidding in Simultaneous Auctions with a Constraint on Exposure , 1977, Oper. Res..