Showing 1 - 10 of 171
We present a convex conic relaxation for a problem of maximising an indefinite quadratic form over a set of convex constraints on the squared variables. We show that for all these problems we get at least 12/37 relative accuracy of the approximation. In the second part of the paper we derive the...
Persistent link: https://www.econbiz.de/10005779408
In this paper we study the concepts of equilibrium and optimum in static transportation networks with elastic and non-elastic demands. The main mathematical tool of our paper is the theory of variational inequalities. We demonstrate that this theory is useful for proving the existence theorems....
Persistent link: https://www.econbiz.de/10005669267
In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry. Jobs are subject to precedence constraints and have specified processing times. Moreover, for each job the labor requirements varies as the job is...
Persistent link: https://www.econbiz.de/10005669315
optimization. The procedure is by essence probabilistic and the computed solution is a random variable. …
Persistent link: https://www.econbiz.de/10005779491
In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved …
Persistent link: https://www.econbiz.de/10005779402
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.
Persistent link: https://www.econbiz.de/10005779433
The cut polyhedron cut(G) of an undirected graph G = (V,E) is the dominant of the convex hull of all of its nonempty edge cutsets. After examining various compact extended formulations for cut(G), we study some of its polyhedral properties. In particular, we characterize all of the facets...
Persistent link: https://www.econbiz.de/10005634023
We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. With n the number of periods, we completely characterize the bounded faces of maximal dimension, and derice an O(n^2) alogorithm to express within the polyhedron as a...
Persistent link: https://www.econbiz.de/10005634229
This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for i) general integer programs, ii) problems with local structure such as knapsack constraints, and iii) problems with 0-1 coefficient matrices, such as set packing,...
Persistent link: https://www.econbiz.de/10005634078
This survey paper prepared for the Handbook of Utility Theory covers the axiomatic foundation of decision making under uncertainty when conditional preferences are allowed to be state dependent, leading to an expected state-dependent utility representation.
Persistent link: https://www.econbiz.de/10005634106