Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
نویسندگان
چکیده
منابع مشابه
Market equilibrium under piecewise Leontief concave utilities
Leontief function is one of the most widely used function in economic modeling, for both production and preferences. However it lacks the desirable property of diminishing returns. In this paper, we consider piecewise Leontief concave (p-Leontief) utility function which consists of a set of Leontief-type segments with decreasing returns and upper limits on the utility. Leontief is a special cas...
متن کاملA Polyhedral Study of the Cardinality Constrained Knapsack Problem
A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas as finance, location, and scheduling. Traditionally, cardinality constraints are modeled by introducing auxiliary 0-1 variables and additional constraints that relate the continuous ...
متن کاملNonconvex piecewise linear knapsack problems
This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the knapsack have a divisible quantity and a cost function. An item can be included partially in the given quantity range and the cost is a nonconvex piecewise linear function of quantity. Given a demand, the optimization problem is to choose ...
متن کاملFacets for the Cardinality Constrained Quadratic Knapsack Problem and the Quadratic Selective Travelling Salesman Problem
This paper considers the Cardinality Constrained Quadratic Knapsack Problem (QKP) and the Quadratic Selective Travelling Salesman Problem (QSTSP). The QKP is a generalization of the Knapsack Problem and the QSTSP is a generalization of the Travelling Salesman Problem. Thus, both problems are NP hard. The QSTSP and the QKP can be solved using branch-and-cut methods, and in doing so, good bounds ...
متن کاملNash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
Recently Cole and Gkatzelis [CG15] gave the first constant factor approximation algorithm for the problem of allocating indivisible items to agents, under additive valuations, so as to maximize the Nash social welfare (NSW). We give constant factor algorithms for a substantial generalization of their problem – to the case of separable, piecewise-linear concave utility functions. We give two suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2023
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4350988