JEL Classification: G21, L13.The paper builds an oligopoly model of a debit card network. It examines the competition between debit card issuers. We show that there is an optimal pricing for the debit card network, which maximizes all issuer’s revenues. The paper also shows that establishing a link between debit card networks averages the costs provided that there is no growth in the customer’s usage of the networks, resulting from the link.
A condition weaker than the insatiability condition is given.
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...
The paper presents a natural application of multi-objective programming to household production and consumption theory. A contribution to multi-objective programming theory is also included.
We prove an approximation theorem in generalized Sobolev spaces with variable exponent and we give an application of this approximation result to a necessary condition in the calculus of variations.