An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems

نویسندگان

چکیده

Joint chance-constrained optimization problems under discrete distributions arise frequently in financial management and business operations. These can be reformulated as mixed-integer programs. The size of integer programs is usually very large even though the original problem medium size. This paper studies an augmented Lagrangian decomposition method for finding high-quality feasible solutions complex problems, including nonconvex problems. Different from current approaches, proposed allows randomness to appear both left-hand-side matrix right-hand-side vector chance constraint. In addition, only requires solving a convex subproblem 0-1 knapsack at each iteration. Based on special structure constraint, computed quasi-linear time, which keeps computation subproblems relatively low level. convergence first-order stationary point established certain mild conditions. Numerical results are presented comparison with set existing methods literature various real-world models. It observed that compares favorably terms quality best solution obtained within time large-size particularly when objective function or constraints random.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems

In this paper, we propose a smoothing augmented Lagrangian method for finding a stationary point of a nonsmooth and nonconvex optimization problem. We show that any accumulation point of the iteration sequence generated by the algorithm is a stationary point provided that the penalty parameters are bounded. Furthermore, we show that a weak version of the generalized Mangasarian Fromovitz constr...

متن کامل

An adaptive augmented Lagrangian method for large-scale constrained optimization

We propose an augmented Lagrangian algorithm for solving large-scale constrained optimization problems. The novel feature of the algorithm is an adaptive update for the penalty parameter motivated by recently proposed techniques for exact penalty methods. This adaptive updating scheme greatly improves the overall performance of the algorithm without sacrificing the strengths of the core augment...

متن کامل

An augmented Lagrangian trust region method for equality constrained optimization

In this talk, we present a trust region method for solving equality constrained optimization problems, which is motivated by the famous augmented Lagrangian function. It is different from standard augmented Lagrangian methods where the augmented Lagrangian function is minimized at each iteration. This method, for fixed Lagrange multiplier and penalty parameters, tries to minimize an approximate...

متن کامل

An augmented Lagrangian optimization method for inflatable structures analysis problems

1. Abstract This paper describes the development of an augmented Lagrangian optimization method for the numerical simulation of the inflation process in the design of inflated space structures. Although the Newton-Raphson scheme has proved to be efficient for solving many non linear problems, it can lead to lacks of convergence when it is applied to the simulation of the inflation process. As a...

متن کامل

An Augmented Lagrangian Method for Optimization Problems in Banach Spaces

We propose a variant of the classical augmented Lagrangian method for constrained optimization problems in Banach spaces. Our theoretical framework does not require any convexity or second-order assumptions and allows the treatment of inequality constraints with infinite-dimensional image space. Moreover, we discuss the convergence properties of our algorithm with regard to feasibility, global ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informs Journal on Computing

سال: 2021

ISSN: ['1091-9856', '1526-5528']

DOI: https://doi.org/10.1287/ijoc.2020.1001