Jiaxu Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiaxu Huang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Tao Jie
Business School, University of Shanghai for Science and Technology, No. 516 Jun Gong Road, Shanghai 200093, China
3 shared publications - Dingfang Su
Business School, University of Shanghai for Science and Technology, No. 516 Jun Gong Road, Shanghai 200093, China
2 shared publications - Dingfang Su
Business School, University of Shanghai for Science and Technology, China
1 shared publication - Erzhan Gao
Business School, University of Shanghai for Science and Technology, China
1 shared publication - Erzhan Gao
Business School, University of Shanghai for Science and Technology, No. 516 Jun Gong Road, Shanghai 200093, China
1 shared publication
Latest Publications
- Open Access
- 2 April 2026
- Published by MDPI AG in Sustainability
- Vol. 18 (7) , 3479
A Two-Stage Stochastic Programming Approach to Unit Commitment with Wind Power Integration: A Novel Pricing Scheme
With high wind power penetration, power system operations face significant uncertainty, rendering traditional pricing mechanisms inadequate for stochastic dispatch environments and hindering the sustainable development of power systems with high renewable energy integration. This paper systematically compares three electricity pricing schemes—system marginal pricing, conservative pricing, and the proposed average pricing—within a two-stage stochastic unit commitment framework. It is found that system marginal pricing behaves as an ex post pricing method dependent on scenario realizations and lacks stability, whereas conservative pricing degenerates into a scheme based on the minimum wind output scenario, leading to higher and more volatile prices. To address these issues, this paper proposes a novel “Average Pricing” method, in which the day-ahead price is defined as the expected value of marginal prices across all wind power scenarios. Theoretical analysis and numerical simulations on the IEEE 39-bus system demonstrate that the proposed method offers both economic interpretability and numerical stability, with mean prices ranging from 14.0739 to 15.9825 and standard deviations ranging from 16.6323 to 19.9471 across four seasonal cases. Compared with conservative pricing, it achieves lower mean prices in three seasons and lower price volatility in three seasons while maintaining a unique day-ahead price and providing a novel and sustainable pathway for pricing design in power systems with high renewable energy integration.
- 2 April 2026
- Published by MDPI AG in Sustainability
- Vol. 18 (7) , 3479
Open AccessA Two-Stage Stochastic Programming Approach to Unit Commitment with Wind Power Integration: A Novel Pricing Scheme
With high wind power penetration, power system operations face significant uncertainty, rendering traditional pricing mechanisms inadequate for stochastic dispatch environments and hindering the sustainable development of power systems with high renewable energy integration. This paper systematically compares three electricity pricing schemes—system marginal pricing, conservative pricing, and the proposed average pricing—within a two-stage stochastic unit commitment framework. It is found that system marginal pricing behaves as an ex post pricing method dependent on scenario realizations and lacks stability, whereas conservative pricing degenerates into a scheme based on the minimum wind output scenario, leading to higher and more volatile prices. To address these issues, this paper proposes a novel “Average Pricing” method, in which the day-ahead price is defined as the expected value of marginal prices across all wind power scenarios. Theoretical analysis and numerical simulations on the IEEE 39-bus system demonstrate that the proposed method offers both economic interpretability and numerical stability, with mean prices ranging from 14.0739 to 15.9825 and standard deviations ranging from 16.6323 to 19.9471 across four seasonal cases. Compared with conservative pricing, it achieves lower mean prices in three seasons and lower price volatility in three seasons while maintaining a unique day-ahead price and providing a novel and sustainable pathway for pricing design in power systems with high renewable energy integration.
- Open Access
- 10 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 931
An Improved Column Generation Algorithm Based on Minimum-Norm Multipliers
Column generation is a fundamental technique for solving large-scale combinatorial optimization problems such as unit commitment and vehicle routing, yet its performance is often limited by dual oscillation. This study explores the intrinsic cause of this phenomenon from the perspective of shadow price theory and demonstrates that dual oscillation arises from the lack of marginal interpretability of Lagrange multipliers when multiple dual solutions coexist. To address this issue, an improved column generation framework is proposed in which traditional multipliers are replaced with minimum-norm multipliers that possess clear economic meaning and act as directional shadow prices. A generalized pricing subproblem is formulated, and partial minimum-norm multipliers are obtained through convex quadratic optimization to guide column generation. Numerical experiments on a simplified single-period unit commitment case and large-scale cutting stock problems showed that the proposed approach eliminated invalid column generation and achieved speedy convergence to the optimal solution within only two iterations for the unit commitment case, and the classical column generation exhibited slow convergence with dual oscillation in large-scale scenarios while the improved algorithm achieved fast and stable convergence. The results indicate that the stabilization method enhances the consistency of dual variables and provides a more robust foundation for the theoretical and practical development of column generation algorithms.
- 10 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 931
Open AccessAn Improved Column Generation Algorithm Based on Minimum-Norm Multipliers
Column generation is a fundamental technique for solving large-scale combinatorial optimization problems such as unit commitment and vehicle routing, yet its performance is often limited by dual oscillation. This study explores the intrinsic cause of this phenomenon from the perspective of shadow price theory and demonstrates that dual oscillation arises from the lack of marginal interpretability of Lagrange multipliers when multiple dual solutions coexist. To address this issue, an improved column generation framework is proposed in which traditional multipliers are replaced with minimum-norm multipliers that possess clear economic meaning and act as directional shadow prices. A generalized pricing subproblem is formulated, and partial minimum-norm multipliers are obtained through convex quadratic optimization to guide column generation. Numerical experiments on a simplified single-period unit commitment case and large-scale cutting stock problems showed that the proposed approach eliminated invalid column generation and achieved speedy convergence to the optimal solution within only two iterations for the unit commitment case, and the classical column generation exhibited slow convergence with dual oscillation in large-scale scenarios while the improved algorithm achieved fast and stable convergence. The results indicate that the stabilization method enhances the consistency of dual variables and provides a more robust foundation for the theoretical and practical development of column generation algorithms.
- Open Access
- 11 February 2026
- Published by MDPI AG in Preprints.org
An Improved Column Generation Algorithm Based on Minimum-Norm Multipliers
Column generation is a fundamental technique for solving large-scale combinatorial optimization problems such as unit commitment and vehicle routing, yet its performance is often limited by dual oscillation. This study explores the intrinsic cause of this phenomenon from the perspective of shadow price theory and demonstrates that dual oscillation arises from the lack of marginal interpretability of Lagrange multipliers when multiple dual solutions coexist. To address this issue, an improved column generation framework is proposed in which traditional multipliers are replaced with minimum-norm multipliers that possess clear economic meaning and act as directional shadow prices. A generalized pricing subproblem is formulated, and partial minimum-norm multipliers are obtained through convex quadratic optimization to guide column generation. Numerical experiments on a simplified single-period unit commitment case show that the proposed approach eliminates invalid column generation and achieves speedy convergence to the optimal solution within only two iterations. The results indicate that the stabilization method enhances the consistency of dual variables and provides a more robust foundation for the theoretical and practical development of column generation algorithms.
- 11 February 2026
- Published by MDPI AG in Preprints.org
Open AccessAn Improved Column Generation Algorithm Based on Minimum-Norm Multipliers
Column generation is a fundamental technique for solving large-scale combinatorial optimization problems such as unit commitment and vehicle routing, yet its performance is often limited by dual oscillation. This study explores the intrinsic cause of this phenomenon from the perspective of shadow price theory and demonstrates that dual oscillation arises from the lack of marginal interpretability of Lagrange multipliers when multiple dual solutions coexist. To address this issue, an improved column generation framework is proposed in which traditional multipliers are replaced with minimum-norm multipliers that possess clear economic meaning and act as directional shadow prices. A generalized pricing subproblem is formulated, and partial minimum-norm multipliers are obtained through convex quadratic optimization to guide column generation. Numerical experiments on a simplified single-period unit commitment case show that the proposed approach eliminates invalid column generation and achieves speedy convergence to the optimal solution within only two iterations. The results indicate that the stabilization method enhances the consistency of dual variables and provides a more robust foundation for the theoretical and practical development of column generation algorithms.