Payment cost minimization using Lagrangian relaxation and modified surrogate optimization approach

作者
Mikhail A. Bragin,Han Xu,Peter B. Luh,Joseph H. Yan
标识
DOI:10.1109/pes.2011.6039191
摘要

In the Payment Cost Minimization (PCM) mechanism [4] payment costs are minimized directly, thus the payment costs that results from selected offers can be significantly reduced compared to the costs obtained by minimizing total bid costs. The PCM can be solved efficiently using standard LP software packages (e.g., CPLEX) only for a limited number of offers. Lagrangian relaxation (LR) has been a powerful technique to solve discrete and mixed-integer optimization problems. For complex problems, such as the PCM, the surrogate subgradient method is frequently used within Lagrangian relaxation approach to update multipliers (e.g., [6], [4]). In the surrogate subgradient approach a proper direction is obtained without fully minimizing the relaxed problem. This paper presents a modified Lagrangian relaxation and the surrogate optimization approach for obtaining a good feasible solution within a reasonable CPU time. The difficulty of the standard surrogate optimization method primarily arises due to the lack of prior knowledge about the optimal dual value, which is used in the definition of a step size. In order to overcome this difficulty, a new method is proposed. The main purpose of the modified surrogate subgradient approach is to obtain a “good” direction quickly and independently of the optimal dual value at each iteration. In this paper it is achieved by introducing a formula for updating the multipliers such that the exact minimization of the Lagrangian leads to a convergent result. Then an approximate formula for updating the multipliers is developed so that the exact optimization of the Lagrangian leads to a convergent result under certain optimality conditions. Lastly, the notion of the surrogate subgradient is used for ensuring the convergence within the reasonable CPU time. An analogue of the surrogate subgradient condition guarantees the convergence on the surrogate subgradient method. Numerical examples are provided to demonstrate the method's effectiveness.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
111发布了新的文献求助20
1秒前
1秒前
科研通AI6.2应助liu_采纳,获得10
1秒前
www完成签到,获得积分20
1秒前
2秒前
走着完成签到,获得积分10
2秒前
bkagyin应助许文强采纳,获得10
2秒前
bkagyin应助终陌采纳,获得10
3秒前
3秒前
3秒前
freesoul发布了新的文献求助10
4秒前
4秒前
欣慰碧彤发布了新的文献求助10
5秒前
Lynn发布了新的文献求助10
5秒前
6秒前
马幸运发布了新的文献求助10
6秒前
搞怪灯泡完成签到,获得积分10
6秒前
优美的无剑完成签到,获得积分10
6秒前
研友_VZG7GZ应助豆子采纳,获得30
7秒前
LUJIE完成签到,获得积分10
8秒前
8秒前
结实初翠发布了新的文献求助10
9秒前
9秒前
laiwai发布了新的文献求助10
10秒前
李爱国应助学分采纳,获得10
11秒前
温暖诗蕊发布了新的文献求助30
11秒前
科研通AI6.4应助子沐采纳,获得30
11秒前
Nature不知名作者完成签到,获得积分10
12秒前
自觉元枫发布了新的文献求助10
12秒前
12秒前
12秒前
13秒前
14秒前
维生素发布了新的文献求助20
15秒前
15秒前
15秒前
Orange应助欣慰碧彤采纳,获得10
15秒前
完美世界应助二三十采纳,获得30
15秒前
大力迎曼发布了新的文献求助10
15秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
A Case Study on Hotels as Noncongregate Emergency Living Accommodations for Returning Citizens 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7764887
求助须知:如何正确求助?哪些是违规求助? 9309156
关于积分的说明 20309602
捐赠科研通 7349682
什么是DOI,文献DOI怎么找? 3314656
关于科研通互助平台的介绍 2464003
邀请新用户注册赠送积分活动 2328973