On complexity of the bilevel location and pricing problems

We consider the bilevel mixed integer location and pricing problems. Each problem is determined by the optimization problems of the upper and lower levels of which the first describes the choice of location and pricing, while the second models the reaction of the customers on the upper-level solutio...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of applied and industrial mathematics Vol. 8; no. 4; pp. 574 - 581
Main Authors:	Panin, A. A., Plyasunov, A. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.10.2014 Springer Nature B.V
Subjects:	Complexity Customers Integer programming Manufacturers Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Mills Mixed integer Optimization Prices Pricing Pricing policies Strategy Studies Poly-APX-completeness AP-reducibility bilevel problem computational complexity and approximation complexity location NP-hardness in the strong sense pricing
ISSN:	1990-4789, 1990-4797
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!