scientific article

DOI<463::AID-NAV3220350510>3.0.CO;2-5 10.1002/1520-6750(198810)35:5<463::AID-NAV3220350510>3.0.CO;2-5zbMath0655.90048MaRDI QIDQ3802881

Mustafa Akgül

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

robustnesspolynomial algorithmconvex polyhedronsimultaneous stabilizationstabilizing compensatorssensitivity minimizationellipsoidal method\(H^{\infty }\) opimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)

Related Items (1)

A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games

Cites Work

• Geometric algorithms and combinatorial optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: