𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Min–max MPC using a tractable QP problem

✍ Scribed by T. Alamo; D.R. Ramirez; D. Muñoz de la Peña; E.F. Camacho

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
264 KB
Volume
43
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A nonconvex max-min problem
A nonconvex max-min problem
✍ James E. Falk; Karla Hoffman 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 483 KB

## Abstract An algorithm designed to solve a large class of nonconvex max‐min problems is described. Its usefulness and applicability is demonstrated by solving an extension of a recently introduced model which optimally allocates strategic weapon systems. The extended model is shown to be equivale

Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
✍ Ishwar Murthy; Shenq-Shyong Her 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri