3 resultados para Zero-One Matrices
em Aston University Research Archive
Resumo:
In this work the solution of a class of capital investment problems is considered within the framework of mathematical programming. Upon the basis of the net present value criterion, the problems in question are mainly characterized by the fact that the cost of capital is defined as a non-decreasing function of the investment requirements. Capital rationing and some cases of technological dependence are also included, this approach leading to zero-one non-linear programming problems, for which specifically designed solution procedures supported by a general branch and bound development are presented. In the context of both this development and the relevant mathematical properties of the previously mentioned zero-one programs, a generalized zero-one model is also discussed. Finally,a variant of the scheme, connected with the search sequencing of optimal solutions, is presented as an alternative in which reduced storage limitations are encountered.
Resumo:
Convergence has been a popular theme in applied economics since the seminal papers of Barro (1991) and Barro and Sala-i-Martin (1992). The very notion of convergence quickly becomes problematic from an academic viewpoint however when we try and formalise a framework to think about these issues. In the light of the abundance of available convergence concepts, it would be useful to have a more universal framework that encompassed existing concepts as special cases. Moreover, much of the convergence literature has treated the issue as a zero-one outcome. We argue that it is more sensible and useful for policy decision makers and academic researchers to consider also ongoing convergence over time. Assessing the progress of ongoing convergence is one interesting and important means of evaluating whether the Eastern European New Member Countries (NMC) of the European Union (EU) are getting closer to being deemed “ready” to join the European Monetary Union (EMU), that is, fulfilling the Maastricht convergence criteria.
Resumo:
The replica method, developed in statistical physics, is employed in conjunction with Gallager's methodology to accurately evaluate zero error noise thresholds for Gallager code ensembles. Our approach generally provides more optimistic evaluations than those reported in the information theory literature for sparse matrices; the difference vanishes as the parity check matrix becomes dense.