Characterization of the feasible set mapping in one class of semi-infinite optimization problems.

DOI10.1007/BF02578928zbMATH Open1148.49300MaRDI QIDQ703296FDOQ703296

Maxim Ivanov Todorov, Estela L. Juárez

Publication date: 11 January 2005

Published in: Top (Search for Journal in Brave)

Recommendations

• An approximation of feasible sets in semi-infinite optimization.
• Stability of the feasible set mapping in convex semi-infinite programming.
• Semi-infinite optimization: Structure and stability of the feasible set
• Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
• One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set

zbMATH Keywords

stability theoryupper semicontinuitylinear inequality systemsHaar systemfeasible set mappingSemi-infinite optimization

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Sensitivity, stability, well-posedness (49K40) Semi-infinite programming (90C34)

Cites Work

• Title not available (Why is that?)
• Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
• Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
• Stability Theory for Linear Inequality Systems
• On feasible sets defined through Chebyshev approximation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• On characterizations of the basic feasible functionals. I
• An approximation of feasible sets in semi-infinite optimization.

This page was built for publication: Characterization of the feasible set mapping in one class of semi-infinite optimization problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703296)