"Min-max MPC using a tractable QP problem."

Teodoro Alamo et al. (2007)

> Home

Details and statistics

DOI: 10.1016/J.AUTOMATICA.2006.10.006

access: closed

type: Journal Article

metadata version: 2023-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/automatica/AlamoRPC07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/automatica/AlamoRPC07
Teodoro Alamo, Daniel R. Ramírez, David Muñoz de la Peña, Eduardo F. Camacho:
Min-max MPC using a tractable QP problem. Autom. 43(4): 693-700 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.