arrow
返回

Mixed integer programming for the 0-1 maximum probability model

delete2004-07-01
delete0
PRE
AI
A
Alain Billionnet
DOI:10.1016/S0377-2217(03)00122-Xdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper we study the 0-1 maximum probability model that consists in maximizing the probability that a certain quantity c(T)x is greater than a prescribed constant t, where c and x are n vectors. c(1),..., c(n), are mutually independent and normally distributed random variables and x is a vector of n binary variables such that Ax less than or equal to b, where b is an m vector and A is an m x n matrix. It is known that this problem can be formulated as a nonlinear fractional program. We show how to solve it exactly using mixed integer programming. The advantage of the approach is that it requires only standard, commercially available software. The computational results which we present show that this technique makes it possible to treat instances with up to 100 random variables in a few seconds of CPU time. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
stochastic programming
discrete maximum probability model
mixed integer programming
computational experiments
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
A Prototype of Feature-Based Design for Assembly
err1993-12-01
err0
errOAAI
errT. L. De Fazio; A. C. Edsall; R. E. Gustavson; J. Hernandez; P. M. Hutchins; H.-W. Leung; S. C. Luby; R. W. Metzinger; J. L. Nevins; K. Tung; D. E. Whitney
err分享
err收藏
学者 查看更多内容