✦ LIBER ✦

A linear approximation method for solving a special class of the chance constrained programming problem

✍ Scribed by Yahia Zare M.; Ahmad Daneshmand

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 708 KB
Volume: 80
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)00437-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for solving a structured cl

An algorithm for solving a structured class of linear programming problems

✍ S.Selcuk Erenguc 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 452 KB

Approximate methods for solving a class

Approximate methods for solving a class of non-linear operator equations

✍ A.G. Zarubin; M.F. Tiunchik 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 756 KB

A quantitative method for solving proble

A quantitative method for solving problems of linear dynamic programming

✍ N.P. Naumov 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 804 KB

An approximate method for solving a clas

An approximate method for solving a class of singular perturbation problems

✍ Mohan K Kadalbajoo; Y.N Reddy 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 727 KB

A new accelerating method for globally s

A new accelerating method for globally solving a class of nonconvex programming problems

✍ Peiping Shen; Xiaodi Bai; Weimin Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 591 KB

In this paper, we combine the new global optimization method proposed by Jiao [H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal. 70 (2) (2008) 1113-1123] with a suitable deleting technique to propose a new accelerating global optimi

The regulator problem for a class of lin

The regulator problem for a class of linear systems with constrained control

✍ Abdellah Benzaouia; Christian Burgat 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 640 KB