Jump to content

Mathematical programming with equilibrium constraints

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 128.187.215.101 (talk) at 17:41, 18 June 2015 (Added MPEC examples and a couple references - this article still needs a lot of work). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Mathematical programming with equilibrium constraints (MPEC) is the study of constrained optimization problems where the constraints include variational inequalities or complementarities. MPEC is related to the Stackelberg game.

MPEC is used in the study of engineering design, economic equilibrium and multilevel games.

MPEC is difficult to deal with because its feasible region is not necessarily convex or even connected.

References

  • Z.-Q. Luo, J.-S. Pang and D. Ralph: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, 1996, ISBN 0-521-57290-8.
  • B. Baumrucker, J. Renfro, L. T. Biegler, MPEC problem formulations and solution strategies with chemical engineering applications, Computers & Chemical Engineering, 32 (12) (2008) 2903-2913.
  • A. U. Raghunathan, M. S. Diaz, L. T. Biegler, An MPEC formulation for dynamic optimization of distillation operations, Computers & Chemical Engineering, 28 (10) (2004) 2037-2052.
Stub icon

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Mathematical_programming_with_equilibrium_constraints&oldid=667519531"