Showing 1 - 10 of 3,432
Persistent link: https://www.econbiz.de/10001594663
Persistent link: https://www.econbiz.de/10000907059
Halal certification of financials product may reduce transaction costs for its buyers when it provides a trusted standard for investors that seek to comply with Islamic law. However, we show that in practice it takes considerable amounts of time (20 days) and money (USD 122,000) to obtain a...
Persistent link: https://www.econbiz.de/10013117973
Persistent link: https://www.econbiz.de/10000909277
Persistent link: https://www.econbiz.de/10000913122
In 1997 two papers_new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...
Persistent link: https://www.econbiz.de/10010324381
Contemporary financial stochastic programs typically involve a trade-offbetween return and (downside)-risk. Using stochastic programming we characterize analytically (rather than numerically) the optimal decisions that follow from characteristic single-stage and multi-stage versions of such...
Persistent link: https://www.econbiz.de/10010324403
In this paper we consider optimization problems defined by a quadraticobjective function and a finite number of quadratic inequality constraints.Given that the objective function is bounded over the feasible set, we presenta comprehensive study of the conditions under which the optimal solution...
Persistent link: https://www.econbiz.de/10010324430
In this paper we will describe a Multi-Agent System which iscapable of finding a feasible solution of a specially structuredlinear programming problem. Emphasis is given to correctnessissues and termination detection.
Persistent link: https://www.econbiz.de/10010324438
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...
Persistent link: https://www.econbiz.de/10010324490