Abstract
Bilinear problems are an important subclass of nonconvex quadratic programming problems whose applications encompass pooling and blending, separation sequencing, heat exchanger network design and multicommodity network flow problems. The general form of a bilinear problem is given by
where x and y are n- and m-dimensional vectors respectively, A i , i = 1, . . . , p + q, are n × m matrices, c i , i = 1, ... , p + q, are n-dimensional real vectors, i = 0, ... , p + q, are m-dimensional real vectors and b is a (p+q)-dimensional real vector.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Floudas, C.A. et al. (1999). Bilinear problems. In: Handbook of Test Problems in Local and Global Optimization. Nonconvex Optimization and Its Applications, vol 33. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3040-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3040-1_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4812-0
Online ISBN: 978-1-4757-3040-1
eBook Packages: Springer Book Archive