A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models∗

E-ISSN： 1290-3868|49|5|845-864

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.49, Iss.5, 2016-02, pp. : 845-864

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Distributional Assumptions in Chance-Constrained Programming Models of Stochastic Water Pollution

By Kataria Mitesh Elofsson Katarina Hasler Berit

Environmental Modeling and Assessment, Vol. 15, Iss. 4, 2010-08 ,pp. : 273-281

Springer Publishing Company

Access to resources Recommend Favorite

Adomian decomposition method for solving initial value problems in vibration models

MATEC Web of conference, Vol. 159, Iss. issue, 2018-03 ,pp. : 01014-01014

Edp Sciences

Access to resources Recommend Favorite

A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks

By Getachew Teodros Kostreva Michael Lancaster Laura

RAIRO - Operations Research, Vol. 34, Iss. 1, 2010-03 ,pp. : 27-47

Edp Sciences

Access to resources Recommend Favorite

Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems

By Heydari Majeed Kazem Sayadi Mohammad Shahanaghi Kamran

RAIRO - Operations Research, Vol. 44, Iss. 2, 2010-04 ,pp. : 139-152

Edp Sciences

Access to resources Recommend Favorite

Spatial capture–recapture models for jointly estimating population density and landscape connectivity

Ecology, Vol. 94, Iss. 2, 2013-02 ,pp. : 287-294

John Wiley & Sons Inc

Access to resources Recommend Favorite