Showing 1 - 10 of 11
Sequential meta heuristic implementations for the irregular stock-cutting problem have highlighted a number of common problems. The implementation in this paper adopts a hybrid tabu search approach that incorporates two very different optimisation routines which utilise alternative neighborhoods...
Persistent link: https://www.econbiz.de/10005486643
The Envelope Theorem is showm to involve comparisons between the performance of the optimal policy and that of alternative policies, which satisfy the constraints of the problem and may also have other features. The theorem is activated whenever parameter values are such that the extreme value...
Persistent link: https://www.econbiz.de/10005487013
In optimization, objective functions which are both pseudoconvex and pseudoconcave have extensively been studied … variational inequality problems. In particular, we extend recent results by Jeyakumar and Yang which were derived for optimization …
Persistent link: https://www.econbiz.de/10005474839
Duality is studied for an abstract equilibrium problem which includes, among others, optimization problems and …
Persistent link: https://www.econbiz.de/10005474843
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
We present a survey of nondifferentiable optimization problems and methods with special focus on the analytic center …
Persistent link: https://www.econbiz.de/10005669360
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
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
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
I develop a framework for thinking about some aspects of sustainability. The framework is one for modeling the dynamic interactions of economic and biological systems, studying the time paths that can emerge from these, and then selecting one of these as optimal. I investigate alternative...
Persistent link: https://www.econbiz.de/10005207579