论文信息 - The integer programming background of a stochastic integer programming algorithm of dentcheva‐prékopa‐ruszczyński

The integer programming background of a stochastic integer programming algorithm of dentcheva‐prékopa‐ruszczyński

This paper analyzes the algorithmic tools presented in [D. Dentcheva, A. Prékopa and A. Ruszczy ` ski. Bounds for Probabilistic Integer Programming Problems, RUTCOR, Rutgers University, NJ, RRR 31-99; D. Dentcheva, A. Prékopa and A. Ruszczy ` ski (2000). Concavity and efficient points of discrete distributions in probabilistic programming. Mathematical Programming, Ser. A , 89 , 55-77]. The emphasis is on the choice of Lagrange multipliers and the solution for the special case of independent random variables.

Béla Vizvári

[1] C. Witzgall. On One-Row Linear Programs , 1980 .

[2] Arthur M. Geoffrion,et al. Letter to the Editor - Finding Everett's Lagrange Multipliers by Linear Programming , 1966, Operational Research.

[3] András Prékopa,et al. Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution , 1990, ZOR Methods Model. Oper. Res..

[4] Peter L. Hammer,et al. Approximations of pseudo-Boolean functions; applications to game theory , 1992, ZOR Methods Model. Oper. Res..

[5] Darinka Dentcheva,et al. Bounds for probabilistic integer programming problems , 2002, Discret. Appl. Math..

[6] Fred W. Glover,et al. A o(n logn) algorithm for LP knapsacks with GUB constraints , 1979, Math. Program..

[7] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[8] A. Prékopa,et al. Programming Under Probabilistic Constraint with Discrete Random Variable , 1998 .

[9] Darinka Dentcheva,et al. Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..