Constructing a perfect duality in infinite programming

DOI10.1007/BF01448186MaRDI QIDQ1245773zbMATH OpenFDO

Authors K. Appert

Publication date 1977

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Mathematical programming (90C99)

Cites work

• A duality theory for abstract mathematical programs with applications to optimal control theory
• A note on infinite systems of linear inequalities in R^n
• Convex analysis treated by linear programming
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• scientific article; zbMATH DE number 3121286 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• On semi-infinite systems of linear inequalities
• Optimierungsaufgaben in topologischen Vektorr�umen I: Dualit�tstheorie
• The theorem of the alternative, the key-theorem, and the vector-maximum problem

Cited in

(18)

• Cluster sets of vector series
• Convex semi-infinite games
• Intrinsic linear programming
• The limiting Lagrangian as a consequence of Helly's theorem
• A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
• Farkas-Minkowski systems in semi-infinite programming
• Zero duality gaps in infinite-dimensional programming
• On duality in semi-infinite programming and existence theorems for linear inequalities
• An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
• On Haar's dual problem
• An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
• Representacion finita de sistemas de infinitas inecuaciones
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• A note on perfect duality and limiting lagrangeans
• Total Lagrange duality for DC infinite optimization problems
• Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems
• Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods

This page was built for publication: Constructing a perfect duality in infinite programming

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