scientific article; zbMATH DE number 4035566

MaRDI QIDQ3775324zbMATH OpenFDO

Authors Marco Antonio López Cerdá, Miguel Angel Goberna

Publication date 1987

zbMATH Keywords

classificationdiscrete approximationexistence of duality gaps

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Semi-infinite programming (90C34) Programming in abstract spaces (90C48)

Recommendations

• On duality in semi-infinite programming and existence theorems for linear inequalities
• An implementation of a discretization method for semi-infinite programming
• scientific article; zbMATH DE number 1070896
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• Optimal value function in semi-infinite programming

Cited in

(13)

• On duality in semi-infinite programming and existence theorems for linear inequalities
• Discretization methods for the solution of semi-infinite programming problems
• Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
• Locally Farkas-Minkowski systems in convex semi-infinite programming
• Discrete approximation of extremal problems with operator inequality constraints
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• Approximation of discrete linear systems based on a dual criterion
• Semi-infinite optimization under convex function perturbations: Lipschitz stability
• Feasible method for generalized semi-infinite programming
• Mission-based component testing for series systems
• Robust stochastic dominance and its application to risk-averse optimization
• On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices

This page was built for publication:

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