๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An exact penalty function method for nonlinear mixed discrete programming problems

โœ Scribed by Changjun Yu, Kok Lay Teo, Yanqin Bai

Book ID
118815440
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
212 KB
Volume
7
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An exact penalty function approach for n
An exact penalty function approach for nonlinear integer programming problems
โœ Marius Sinclair ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

Nonlinear integer programming problems with bounded feasible sets are considered. It is shown how the number of constraints in such problems can be reduced with the aid of an exact penalty function approach. This approach can be used to construct an equivalent unconstrained problem, or a problem wit

An objective penalty function method for
An objective penalty function method for nonlinear programming
โœ Zhiqing Meng; Qiying Hu; Chuangyin Dang; Xiaoqi Yang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 370 KB

In this paper, we propose a novel objective penalty function for inequality constrained optimization problems. The objective penalty function differs from any existing penalty function and also has two desired features: exactness and smoothness if the constraints and objective function are different