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

Vector optimization problems with nonconvex preferences

โœ Scribed by N. J. Huang; A. M. Rubinov; X. Q. Yang

Book ID
106414400
Publisher
Springer US
Year
2007
Tongue
English
Weight
190 KB
Volume
40
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On nonconvex optimization problems with
On nonconvex optimization problems with separated nonconvex variables
โœ Hoang Tuy ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer US ๐ŸŒ English โš– 628 KB

A mathematical programming problem is said to have separated nonconvex variables when the variables can be divided into two groups: x = (xl,..., x,) and y = (Yl,. โ€ข โ€ข , Yn), such that the objective function and any constraint function is a sum of a convex function of (x, y) jointly and a nonconvex f