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

Penalty formulation for zero-one nonlinear programming

โœ Scribed by B Kalantari; J.B Rosen

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
179 KB
Volume
16
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A hybrid variable penalty method for non
A hybrid variable penalty method for nonlinear programming
โœ B. Prasad ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 835 KB

The paper describes a hybrid variable penalty method (in which the penalty functions are finite on the boundary of the constrained set) for solving a general nonlinear programming problem. The method combines two types of variable penalty functions to obtain a hybrid formulation in such a way that t

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

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