On Haar's dual problem

DOI10.1007/BF01540158MaRDI QIDQ2564337zbMATH OpenOpenAlexFDO

Authors Valentín Jornet, Miguel Angel Goberna

Publication date 6 July 1997

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01540158

zbMATH Keywords

dualitylinear semi-infinite programmingsequential approximationHaar's dual problem

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Recommendations

• scientific article; zbMATH DE number 4081329
• A dual parameterization approach to linear-quadratic semi-infinite programming problems
• scientific article; zbMATH DE number 3920183
• On the sufficiency of finite support duals in semi-infinite linear programming
• An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming

Cites work

• scientific article; zbMATH DE number 3650305 (Why is no real title available?)
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3755766 (Why is no real title available?)
• scientific article; zbMATH DE number 3494173 (Why is no real title available?)
• scientific article; zbMATH DE number 3246461 (Why is no real title available?)
• Computer Solutions to Minimum-Cover Problems
• Constructing a perfect duality in infinite programming
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Das Umkugelproblem und lineare semiinfinite Optimierung. (The circumsphere problem and linear semifinite optimization)
• Duality in semi-infinite programs and some works of Haar and Carathéodory
• Ein Dualitätssatz dersemi-infiniten lineraren optimierung
• Geometric fundamentals of the simplex method in semi-infinite programming
• Inradius und Dicke konvexer Körper aus optimierungstheoretischer Sicht. (Inradius and thickness of convex bodies under optimization-theoretical view points.)
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Linear programming approaches to the measurement and analysis of productive efficiency
• On constraint sets of infinite linear programs over ordered fields
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• The Coefficient of Resource Utilization
• Theory of multiobjective optimization

Cited in

(2)

• Understanding linear semi-infinite programming via linear programming over cones
• scientific article; zbMATH DE number 4081329 (Why is no real title available?)

This page was built for publication: On Haar's dual problem

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