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

A decomposition method for structured quadratic programming problems

โœ Scribed by K. Ritter

Publisher
Elsevier Science
Year
1967
Tongue
English
Weight
877 KB
Volume
1
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper describes a decomposition method for large structured quadratic maximization problems. The method can be applied to problems which contain coupling constraints or coupling variables occurring in the objective function.

๐Ÿ“œ SIMILAR VOLUMES

A method for quadratic programming
A method for quadratic programming
โœ Shang-Wang Chang ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 374 KB
Quadratic programming algorithms for obs
Quadratic programming algorithms for obstacle problems
โœ Doukhovni, Ilia ;Givoli, Dan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 446 KB

The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems

A fuzzy goal programming procedure for s
A fuzzy goal programming procedure for solving quadratic bilevel programming problems
โœ Bijay Baran Pal; Bhola Nath Moitra ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB

This article presents a fuzzy goal programming (FGP) procedure for solving quadratic bilevel programming problems (QBLPP). In the proposed approach, the membership functions for the defined fuzzy objective goals of the decision makers (DM) at both the levels are developed first. Then, a quadratic pr