找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Disjunctive Programming; Egon Balas Book 2018 Springer Nature Switzerland AG 2018 optimization.integer programming.nonconvex programming.l

[复制链接]
楼主: Conjecture
发表于 2025-3-25 05:27:28 | 显示全部楼层
Nonlinear Higher-Dimensional Representations,Apart from the extended formulations discussed in Chap. 5, a number of authors have proposed nonlinear higher dimensional constructions that provide tighter relaxations of conv...
发表于 2025-3-25 10:15:43 | 显示全部楼层
The Correspondence Between Lift-and-Project Cuts and Simple Disjunctive Cuts,From the fact that the constraint set (6.3) of (CGLP). defines the convex hull of . ∩{. : .. ∈{0, 1}}, and that conv.., the integer hull, can be derived by imposing the disjunctions .. ≤ 0 ∨ .. ≥ 1 sequentially, it follows that any valid cut for a mixed 0-1 program can be represented as a lift-and-project cut.
发表于 2025-3-25 12:56:42 | 显示全部楼层
Solving (CGLP), on the LP Simplex Tableau,The major practical consequence of the correspondence established in Theorems 8.4A/8.4B is that the cut generating linear program (CGLP). need not be formulated and solved explicitly; instead, the procedure for solving it can be mimicked on the linear programming relaxation (LP) of the original mixed 0-1 problem.
发表于 2025-3-25 16:43:47 | 显示全部楼层
Implementation and Testing of Variants,The discovery of the possibility of generating L&P cuts through pivoting in the LP tableau, without recourse to the higher-dimensional (CGLP), has opened the door to the introduction of this class of cuts into commercial optimizers
发表于 2025-3-25 20:50:16 | 显示全部楼层
Cuts from General Disjunctions,In the early years of the twenty-first century the topic of cutting planes from split disjunctions seemed to have been exhausted, and attention turned to cuts from more general (non-split) disjunctions.
发表于 2025-3-26 03:49:58 | 显示全部楼层
Disjunctive Cuts from the , -Polyhedral Representation,Given a disjunctive set in disjunctive normal form, i.e. as a union of polyhedra.
发表于 2025-3-26 07:09:13 | 显示全部楼层
发表于 2025-3-26 08:49:36 | 显示全部楼层
发表于 2025-3-26 15:56:41 | 显示全部楼层
Egon BalasThe first and so far only book on this important subject.Written in a style accessible to all mathematically literate readers.The author is a famous expert in mathematical optimisation
发表于 2025-3-26 19:35:12 | 显示全部楼层
http://image.papertrans.cn/e/image/281348.jpg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-27 21:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表