A kind of mathematical programs with equilibrium constraints (MPEC) is studied. By using the idea of successive approximation, a smoothing nonlinear programming, which is equivalent to the MPEC problem, is proposed....A kind of mathematical programs with equilibrium constraints (MPEC) is studied. By using the idea of successive approximation, a smoothing nonlinear programming, which is equivalent to the MPEC problem, is proposed. Thereby, it is ensured that some classical optimization methods can be applied for the MPEC problem. In the end, two algorithm models are proposed with the detail analysis of the global convergence.展开更多
This paper considers the mathematical programs with equilibrium constraints(MPEC).It is well-known that,due to the existence of equilibrium constraints,the Mangasarian-Fromovitz constraint qualification does not hold ...This paper considers the mathematical programs with equilibrium constraints(MPEC).It is well-known that,due to the existence of equilibrium constraints,the Mangasarian-Fromovitz constraint qualification does not hold at any feasible point of MPEC and hence,in general,the developed numerical algorithms for standard nonlinear programming problems can not be applied to solve MPEC directly.During the past two decades,much research has been done to develop numerical algorithms and study optimality,stability,and sensitivity for MPEC.However,there are very few results on duality for MPEC in the literature.In this paper,we present a Wolfe-type duality for MPEC and,under some suitable conditions,we establish various duality theorems such as the weak duality,direct duality,converse duality,and strict converse duality theorems.We further show that a linear MPEC is equivalent to a linear programming problem in some sense.展开更多
In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on ...In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.展开更多
The concept of vector optimization problems with equilibrium constraints (VOPEC) is introduced. By using the continuity results of the approximate solution set to the equilibrium problem, we obtain the same results of...The concept of vector optimization problems with equilibrium constraints (VOPEC) is introduced. By using the continuity results of the approximate solution set to the equilibrium problem, we obtain the same results of the marginal map and the approximate value in VOPEC (ε) for vector-valued mapping.展开更多
In this paper, we describe a successive approximation and smooth sequential quadratic programming (SQP) method for mathematical programs with nonlinear complementarity constraints (MPCC). We introduce a class of s...In this paper, we describe a successive approximation and smooth sequential quadratic programming (SQP) method for mathematical programs with nonlinear complementarity constraints (MPCC). We introduce a class of smooth programs to approximate the MPCC. Using an 11 penalty function, the line search assures global convergence, while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover, we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints (MPEC) when the algorithm terminates finitely.展开更多
This paper discusses a special class of mathematical programs with equilibrium constraints. At first, by using a generalized complementarity function, the discussed problem is transformed into a family of general nonl...This paper discusses a special class of mathematical programs with equilibrium constraints. At first, by using a generalized complementarity function, the discussed problem is transformed into a family of general nonlinear optimization problems containing additional variable μ. Furthermore, combining the idea of penalty function, an auxiliary problem with inequality constraints is presented. And then, by providing explicit searching direction, we establish a new conjugate projection gradient method for optimization with nonlinear complementarity constraints. Under some suitable conditions, the proposed method is proved to possess global and superlinear convergence rate.展开更多
Demand response(DR)using shared energy storage systems(ESSs)is an appealing method to save electricity bills for users under demand charge and time-of-use(TOU)price.A novel Stackelberg-game-based ESS sharing scheme is...Demand response(DR)using shared energy storage systems(ESSs)is an appealing method to save electricity bills for users under demand charge and time-of-use(TOU)price.A novel Stackelberg-game-based ESS sharing scheme is proposed and analyzed in this study.In this scheme,the interactions between selfish users and an operator are characterized as a Stackelberg game.Operator holds a large-scale ESS that is shared among users in the form of energy transactions.It sells energy to users and sets the selling price first.It maximizes its profit through optimal pricing and ESS dispatching.Users purchase some energy from operator for the reduction of their demand charges after operator's selling price is announced.This game-theoretic ESS sharing scheme is characterized and analyzed by formulating and solving a bi-level optimization model.The upper-level optimization maximizes operator's profit and the lower-level optimization minimizes users'costs.The bi-level model is transformed and linearized into a mixed-integer linear programming(MILP)model using the mathematical programming with equilibrium constraints(MPEC)method and model linearizing techniques.Case studies with actual data are carried out to explore the economic performances of the proposed ESS sharing scheme.展开更多
This contribution presents an outline of a new mathematical formulation for Classical Non-Equilibrium Thermodynamics (CNET) based on a contact structure in differential geometry. First a non-equilibrium state space is...This contribution presents an outline of a new mathematical formulation for Classical Non-Equilibrium Thermodynamics (CNET) based on a contact structure in differential geometry. First a non-equilibrium state space is introduced as the third key element besides the first and second law of thermodynamics. This state space provides the mathematical structure to generalize the Gibbs fundamental relation to non-equilibrium thermodynamics. A unique formulation for the second law of thermodynamics is postulated and it showed how the complying concept for non-equilibrium entropy is retrieved. The foundation of this formulation is a physical quantity, which is in non-equilibrium thermodynamics nowhere equal to zero. This is another perspective compared to the inequality, which is used in most other formulations in the literature. Based on this mathematical framework, it is proven that the thermodynamic potential is defined by the Gibbs free energy. The set of conjugated coordinates in the mathematical structure for the Gibbs fundamental relation will be identified for single component, closed systems. Only in the final section of this contribution will the equilibrium constraint be introduced and applied to obtain some familiar formulations for classical (equilibrium) thermodynamics.展开更多
在传统输配网分离决策的电能市场出清模式中,会出现节点电价过高和风电资源消纳能力不足等问题,为协调输配电网资源与信息不均衡问题,分析输配协同决策下的电力市场特点,构建了输配协同下输电运营商(Transmission System Operator, TSO...在传统输配网分离决策的电能市场出清模式中,会出现节点电价过高和风电资源消纳能力不足等问题,为协调输配电网资源与信息不均衡问题,分析输配协同决策下的电力市场特点,构建了输配协同下输电运营商(Transmission System Operator, TSO)与配电运营商(Distribution System Operator, DSO)电能市场双层出清模式,下层DSO决策利用KKT条件将其转化为均衡约束,经二阶锥的对偶规划与下层KKT的线性化处理,其转化为带均衡约束的数学规划(Mathematical Program with Equilibrium Constraints, MPEC)单层决策模型。实验结果表明,该模型成功调动输配侧资源,降低了市场出清价格,提高了系统经济性,为电力系统运行和市场协调带来积极影响。展开更多
An optimal dimension-down iterative algorithm (DDIA) is proposed for solving a mixed (continuous/ discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programmin...An optimal dimension-down iterative algorithm (DDIA) is proposed for solving a mixed (continuous/ discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraints (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables (discrete/continuous) are fixed to altemately optimize another group of variables (continuous/discrete). Some continuous network design problems (CNDPs) and discrete network design problems (DNDPs) are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.展开更多
基金project supported by the National Natural Science Foundation of China(Nos.10501009 and 60471039)the Natural Science Foundation of Guangxi Province(No.0728206)
文摘A kind of mathematical programs with equilibrium constraints (MPEC) is studied. By using the idea of successive approximation, a smoothing nonlinear programming, which is equivalent to the MPEC problem, is proposed. Thereby, it is ensured that some classical optimization methods can be applied for the MPEC problem. In the end, two algorithm models are proposed with the detail analysis of the global convergence.
基金supported by the NSFC Grant(No.11401379)supported in part by the NSFC Grant(No.11431004)the China Postdoctoral Science Foundation(No.2014M550237)
文摘This paper considers the mathematical programs with equilibrium constraints(MPEC).It is well-known that,due to the existence of equilibrium constraints,the Mangasarian-Fromovitz constraint qualification does not hold at any feasible point of MPEC and hence,in general,the developed numerical algorithms for standard nonlinear programming problems can not be applied to solve MPEC directly.During the past two decades,much research has been done to develop numerical algorithms and study optimality,stability,and sensitivity for MPEC.However,there are very few results on duality for MPEC in the literature.In this paper,we present a Wolfe-type duality for MPEC and,under some suitable conditions,we establish various duality theorems such as the weak duality,direct duality,converse duality,and strict converse duality theorems.We further show that a linear MPEC is equivalent to a linear programming problem in some sense.
文摘In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.
文摘The concept of vector optimization problems with equilibrium constraints (VOPEC) is introduced. By using the continuity results of the approximate solution set to the equilibrium problem, we obtain the same results of the marginal map and the approximate value in VOPEC (ε) for vector-valued mapping.
基金supported by the National Natural Science Foundation of China (Nos.10501009,10771040)the Natural Science Foundation of Guangxi Province of China (Nos.0728206,0640001)the China Postdoctoral Science Foundation (No.20070410228)
文摘In this paper, we describe a successive approximation and smooth sequential quadratic programming (SQP) method for mathematical programs with nonlinear complementarity constraints (MPCC). We introduce a class of smooth programs to approximate the MPCC. Using an 11 penalty function, the line search assures global convergence, while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover, we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints (MPEC) when the algorithm terminates finitely.
文摘This paper discusses a special class of mathematical programs with equilibrium constraints. At first, by using a generalized complementarity function, the discussed problem is transformed into a family of general nonlinear optimization problems containing additional variable μ. Furthermore, combining the idea of penalty function, an auxiliary problem with inequality constraints is presented. And then, by providing explicit searching direction, we establish a new conjugate projection gradient method for optimization with nonlinear complementarity constraints. Under some suitable conditions, the proposed method is proved to possess global and superlinear convergence rate.
基金supported by the National Natural Science Foundation of China(U21A20478)Zhejiang Provincial Nature Science Foundation of China(LZ21F030004)Key-Area Research and Development Program of Guangdong Province(2018B010107002)。
文摘Demand response(DR)using shared energy storage systems(ESSs)is an appealing method to save electricity bills for users under demand charge and time-of-use(TOU)price.A novel Stackelberg-game-based ESS sharing scheme is proposed and analyzed in this study.In this scheme,the interactions between selfish users and an operator are characterized as a Stackelberg game.Operator holds a large-scale ESS that is shared among users in the form of energy transactions.It sells energy to users and sets the selling price first.It maximizes its profit through optimal pricing and ESS dispatching.Users purchase some energy from operator for the reduction of their demand charges after operator's selling price is announced.This game-theoretic ESS sharing scheme is characterized and analyzed by formulating and solving a bi-level optimization model.The upper-level optimization maximizes operator's profit and the lower-level optimization minimizes users'costs.The bi-level model is transformed and linearized into a mixed-integer linear programming(MILP)model using the mathematical programming with equilibrium constraints(MPEC)method and model linearizing techniques.Case studies with actual data are carried out to explore the economic performances of the proposed ESS sharing scheme.
文摘This contribution presents an outline of a new mathematical formulation for Classical Non-Equilibrium Thermodynamics (CNET) based on a contact structure in differential geometry. First a non-equilibrium state space is introduced as the third key element besides the first and second law of thermodynamics. This state space provides the mathematical structure to generalize the Gibbs fundamental relation to non-equilibrium thermodynamics. A unique formulation for the second law of thermodynamics is postulated and it showed how the complying concept for non-equilibrium entropy is retrieved. The foundation of this formulation is a physical quantity, which is in non-equilibrium thermodynamics nowhere equal to zero. This is another perspective compared to the inequality, which is used in most other formulations in the literature. Based on this mathematical framework, it is proven that the thermodynamic potential is defined by the Gibbs free energy. The set of conjugated coordinates in the mathematical structure for the Gibbs fundamental relation will be identified for single component, closed systems. Only in the final section of this contribution will the equilibrium constraint be introduced and applied to obtain some familiar formulations for classical (equilibrium) thermodynamics.
文摘在传统输配网分离决策的电能市场出清模式中,会出现节点电价过高和风电资源消纳能力不足等问题,为协调输配电网资源与信息不均衡问题,分析输配协同决策下的电力市场特点,构建了输配协同下输电运营商(Transmission System Operator, TSO)与配电运营商(Distribution System Operator, DSO)电能市场双层出清模式,下层DSO决策利用KKT条件将其转化为均衡约束,经二阶锥的对偶规划与下层KKT的线性化处理,其转化为带均衡约束的数学规划(Mathematical Program with Equilibrium Constraints, MPEC)单层决策模型。实验结果表明,该模型成功调动输配侧资源,降低了市场出清价格,提高了系统经济性,为电力系统运行和市场协调带来积极影响。
基金The National Natural Science Foundation of China(No. 50908235 )China Postdoctoral Science Foundation (No.201003520)
文摘An optimal dimension-down iterative algorithm (DDIA) is proposed for solving a mixed (continuous/ discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraints (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables (discrete/continuous) are fixed to altemately optimize another group of variables (continuous/discrete). Some continuous network design problems (CNDPs) and discrete network design problems (DNDPs) are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.