๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A nonconvex max-min problem

โœ Scribed by James E. Falk; Karla Hoffman

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
483 KB
Volume
24
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 equivalent to a nonconvex mathematical program with an infinite number of constraints, and hence is not solvable by conventional procedures. An example is worked out in detail to illustrate the algorithm.

๐Ÿ“œ SIMILAR VOLUMES

On max-min problems
On max-min problems
โœ Kailash C. Kapur ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 198 KB
Complexity of the minโ€“max and minโ€“max re
Complexity of the minโ€“max and minโ€“max regret assignment problems
โœ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 179 KB

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro

Minโ€“max MPC using a tractable QP problem
Minโ€“max MPC using a tractable QP problem
โœ T. Alamo; D.R. Ramirez; D. Muรฑoz de la Peรฑa; E.F. Camacho ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 264 KB