A jointly constrained bilinear programming method for solving generalized Cournot-Pareto models
Year of publication: |
December 2015
|
---|---|
Authors: | Nguyen Van Quy |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 49.2015, 5, p. 845-864
|
Subject: | Generalized Cournot model | bilinear programming | branch-and-bound | Pareto solution | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Ardestani-Jaafari, Amir, (2021)
-
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
Fischetti, Matteo, (2020)
-
Geometric programming technique to optimize power distribution system
Ota, R. R., (2019)
- More ...
-
Tuan, Doan Doan, (2004)
-
A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems
Muu, Le Dung, (2003)
-
On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
Le Dung Muu, (2008)
- More ...