Financial networks with intermediation: Risk management with variable weights

In this paper, we develop a framework for the modeling, analysis, and computation of solutions to multitiered financial network problems with intermediaries in which both the sources of financial funds as well as the intermediaries are multicriteria decision-makers. In particular, we assume that these decision-makers seek not only to maximize their net revenues but also to minimize risk with the risk being penalized by a variable weight. We make explicit the behavior of the various decision-makers, including the consumers at the demand markets for the financial products. We derive the optimality conditions, and demonstrate that the governing equilibrium conditions of the financial network economy can be formulated as a finite-dimensional variational inequality problem. Qualitative properties of the equilibrium financial flow and price pattern are provided. A computational procedure that exploits the network structure of the problem is proposed and then applied to several numerical examples.     

Financial networks with socially responsible investing

In this paper, we develop a framework for the modeling, analysis, and computation of solutions to multitiered financial network problems with socially responsible investment in which both the sources of financial funds as well as the intermediaries are multicriteria decision-makers. We assume that these decision-makers seek not only to maximize their net revenues but also minimize risk with the risk being penalized by a variable weight. Furthermore, we assume that the intermediaries are socially responsible companies, who want to maximize their social responsibility levels. We make explicit the behavior of the various decision-makers, including the consumers at the demand markets for the financial products. We derive the optimality conditions, and demonstrate that the governing equilibrium conditions of the financial network economy can be formulated as a finite-dimensional variational inequality problem. Qualitative properties of the equilibrium financial flow and price pattern are provided. A numerical example is used to illustrate the model.     

Supply chain networks,electronic commerce,and supply side and demand side risk

In this paper, we develop a supply chain network model in which both physical and electronic transactions are allowed and in which supply side risk as well as demand side risk are included in the formulation. The model consists of three tiers of decision-makers: the manufacturers, the distributors, and the retailers, with the demands associated with the retail outlets being random. We model the optimizing behavior of the various decision-makers, with the manufacturers and the distributors being multicriteria decision-makers and concerned with both profit maximization and risk minimization. We derive the equilibrium conditions and establish the finite-dimensional variational inequality formulation. We provide qualitative properties of the equilibrium pattern in terms of existence and uniqueness results and also establish conditions under which the proposed computational procedure is guaranteed to converge. We illustrate the supply chain network model through several numerical examples for which the equilibrium prices and product shipments are computed. This is the first multitiered supply chain network equilibrium model with electronic commerce and with supply side and demand side risk for which modeling, qualitative analysis, and computational results have been obtained.     

Mixed equilibrium problems with Z*-bifunctions and least element problems in Banach lattices

The purpose of this paper is to study the relations among a mixed equilibrium problem, a least element problem and a minimization problem in Banach lattices. We propose the concept of Z*-bifunctions as well as the concept of a feasible set for the mixed equilibrium problem. We prove that the feasible set of the mixed equilibrium problem is a sublattice provided that the associated bifunction is a strictly α-monotone Z*-bifunction. We establish the equivalence of the mixed equilibrium problem, the least element problem and the minimization problem under strict α-monotonicity and Z*-bifunction conditions.     

多商品流多期供应链网络均衡模型

针对具有多种商品流的三层供应链网络结构模型,考虑时间变量和库存问题,分别对制造商、零售商和需求市场的决策者的多期独立决策行为及其相互作用进行了分析,利用变分不等式构建了各层均衡模型以及系统均衡模型,得到了系统达到均衡的条件,给出了具体算例并进行了求解,最后与相关文献的模型进行了比较.     

弹性需求下城市公交网络服务的优化

对具有弹性需求的城市公交网络系统进行了票价结构与发车频率组合的优化。考虑到公交定价和发车频率会影响乘客需求以及乘客对路径的选择行为,将这一问题描述为一个双层规划问题,上层是寻求社会福利最大的优化问题;下层考虑了乘客的出行选择行为,为弹性需求下乘客在城市公交网络上流量分布的随机用户平衡分配模型。鉴于双层规划问题的非凸性,运用模拟退火算法对模型进行求解,并给出一个仿真算例说明提出的模型和算法的合理性。     

Pricing and equity in cross-regional green supply chains

This paper addresses the problem of the firms operating on cross-border or inter-regional platforms that are subject to the enforcement of each local government's carbon emissions regulatory policy, thus causing an imbalance in the sharing of the burden of the greening of the total supply chain. We introduce the concept of equity as the incentive mechanism to coordinate this green supply chain which is a function of the carbon emission permits and the revenue generated by the firms. Due to the complexity and imbalance in the original incentive mechanism to this problem, we provide a new equivalent supply chain network equilibrium model under elastic demand based on user equilibrium theory. We state the user equilibrium conditions and provide the equivalent formulation. We show the trade-offs under various carbon emissions regulatory policies. A product with higher price elasticity and carbon emission intensity not only hampers the firm from gaining a higher revenue, but it also reduces the equity of the system under an invariant emission regulatory policy.     

具有随机需求的多种差异产品供应链网络均衡模型研究

针对产品的品牌和产地存在的差异性,研究了供应链网络的均衡模型,构建了具有随机需求的多种差异产品的供应链网络均衡模型.运用随机效用理论和多项式logit模型分析了需求市场上产品的随机选择问题,利用变分不等式的形式给出了制造商、零售商,需求市场以及整个供应链网络的均衡条件,并给出了经济解释.最后,通过算例验证了模型的合理性.     

A Cournot–Nash–Bertrand game theory model of a service-oriented Internet with price and quality competition among network transport providers

This paper develops a game theory model of a service-oriented Internet in which profit-maximizing service providers provide substitutable (but not identical) services and compete with the quantities of services in a Cournot–Nash manner, whereas the network transport providers, which transport the services to the users at the demand markets, and are also profit-maximizers, compete with prices in Bertrand fashion and on quality. The consumers respond to the composition of service and network provision through the demand price functions, which are both quantity and quality dependent. We derive the governing equilibrium conditions of the integrated game and show that it satisfies a variational inequality problem. We then describe the underlying dynamics, and provide some qualitative properties, including stability analysis. The proposed algorithmic scheme tracks, in discrete-time, the dynamic evolution of the service volumes, quality levels, and the prices until an approximation of a stationary point (within the desired convergence tolerance) is achieved. Numerical examples demonstrate the modeling and computational framework.     

The minmax regret gradual covering location problem on a network with incomplete information of demand weights

The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered, allowing partial coverage. We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown. Using only information on the range of these random variables, this study is aimed at finding the “minmax regret” location that minimizes the worst-case coverage loss. We show that under some conditions, the problem is equivalent to known location problems (e.g. the minmax regret median problem). Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions.     

On price competition in location-price models with spatially separated markets

In this paper we study price competition for two types of location-price models in which facility locations are set up and price decisions have to be made in order to maximise profit. We discuss the existence and determination of equilibrium prices in a general location space when facilities have different production costs. It is assumed that each price is bounded from below and demand for a single homogeneous product is price-inelastic. When facilities set mill prices, a price equilibrium rarely exists and necessary conditions for existence are obtained. In particular, when the location space is a tree network, we give a characterisation of the locations for which a unique equilibrium exists for two competitors. With spatial price discrimination, though equilibrium prices might not exist, it is shown that ε-equilibrium prices always exist for any locations of the facilities. A characterisation of ε-equilibrium is also given. Then the location-price problem is reduced to a location problem. A comparison of results with the two types of price determination is also presented. This work has been supported by the Ministry of Science and Technology of Spain under the research project BEC2002-01026, in part financed by the European Regional Development Fund (ERDF).     

由零售商负责回收的多期闭环供应链网络均衡

本文研究了零售商回收模式下多期闭环供应链网络均衡问题。制造商通过零售渠道将产品销售给消费者,以满足消费市场需求,同时消费产生的废旧品由零售商回收返回制造商处进行再制造,通过产品库存和回收废旧品连接相邻规划期。运用变分不等式理论和互补理论,分别刻画了制造市场、零售市场和消费市场的均衡,接着构建了多期闭环供应链网络均衡模型。利用变分不等式的投影收缩算法,对模型进行求解。算例着重分析了废旧品利用率对网络均衡状态和供应链成员利润的影响。结果表明:当制造商的废旧品利用率逐渐增加时,回收量逐渐增加,制造商的利润先减后增,零售商利润一直增加,而供应链总利润一直增加,供应链网络中的最优决策变量主要受到回收量约束的影响。     

考虑直销的多期供应链网络均衡模型

研究了直销供应链网络动态均衡模型,分别对制造商、零售商和需求市场的决策者的多期独立决策行为及其相互作用进行了分析,利用变分不等式构建了各层均衡模型以及系统均衡模型,得到了系统达到均衡的条件,给出了具体算例并进行了求解.构建的供应链网络动态均衡模型具有更好的适用性及普遍性,为供应链的各层成员保持供应链的稳定和长期均衡提供决策依据和决策方法.     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.     

动态供应链网络均衡模型构建与分析

基于单一商品流,考虑了时间变量和库存问题,建立了三层动态供应链网络结构模型.对制造商、零售商和需求市场的多期独立决策行为及其相互作用进行了分析,应用变分不等式构建了各层均衡模型和整个供应链网络均衡模型.最后与相关文献的模型进行了比较.     

Capacitated facility location/network design problems

We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. We present a mixed integer programming formulation of the problem, and several classes of valid inequalities are derived to strengthen its LP relaxation. Computational experience with problems with up to 40 nodes and 160 candidate links is reported, and a sensitivity analysis provides insight into the behavior of the model in response to changes in key problem parameters.     

Quasi-variational equilibrium models for network flow problems

We consider a formulation of a network equilibrium problem given by a suitable quasi-variational inequality where the feasible flows are supposed to be dependent on the equilibrium solution of the model. The Karush–Kuhn–Tucker optimality conditions for this quasi-variational inequality allow us to consider dual variables, associated with the constraints of the feasible set, which may receive interesting interpretations in terms of the network, extending the classic ones existing in the literature.     

γ-Robust facility relocation problem

In this paper, we consider relocating facilities, where we have demand changes in the network. Relocations are performed by closing some of the existing facilities from low demand areas and opening new ones in newly emerging areas. However, the actual changes of demand are not known in advance. Therefore, different scenarios with known probabilities are used to capture such demand changes. We develop a mixed integer programming model for facility relocation that minimizes the expected weighted distance while making sure that relative regret for each scenario is no greater than γ. We analyzed the problem structure and developed a Lagrangian Decomposition Algorithm (LDA) to expedite the solution process. Numerical experiments are carried out to show the performance of LDA against the exact solution method.     

Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model

This paper proposes a novel extended traffic network model to solve the logit-based stochastic user equilibrium (SUE) problem with elastic demand. In this model, an extended traffic network is established by properly adding dummy nodes and links to the original traffic network. Based on the extended traffic network, the logit-based SUE problem with elastic demand is transformed to the SUE problem with fixed demand. Such problem is then further converted to a linearly constrained convex programming and addressed by a predictor–corrector interior point algorithm with polynomial complexity. A numerical example is provided to compare the proposed model with the method of successive averages (MSA). The numerical results indicate that the proposed model is more efficient and has a better convergence than the MSA.     

Auxiliary Principle and Algorithm for Mixed Equilibrium Problems and Bilevel Mixed Equilibrium Problems in Banach Spaces

A new class of bilevel mixed equilibrium problems is introduced and studied in real Banach spaces. By using the auxiliary principle technique, new iterative algorithms for solving the mixed equilibrium problems and bilevel mixed equilibrium problems are suggested and analyzed. Strong convergence of the iterative sequences generated by the algorithms is proved under suitable conditions. The behavior of the solution set of the bilevel mixed equilibrium problem is also discussed.