On Linear Semi-Infinite Programming Problems: An Algorithm

DOI10.1080/01630569208816479zbMath0758.90069OpenAlexW1995861654MaRDI QIDQ4029144

Soon-Yi Wu, Hang-Chin Lai

Publication date: 7 March 1993

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569208816479

zbMATH Keywords

air pollutionlinear semi-infinite programming

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (20)

A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming ⋮ Implementation of an inexact approach to solving linear semi-infinite programming problems ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ Probability maximization models for portfolio selection under ambiguity ⋮ A perturbation method for solving linear semi-infinite programming problems ⋮ Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method ⋮ Relaxed cutting plane method for solving linear semi-infinite programming problems ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ Duality theorems and algorithms for linear programming in measure spaces ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ Linear semi-infinite programming theory: an updated survey ⋮ An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions. ⋮ Linear programming in measure spaces ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming

Cites Work

• Fuzzy mathematical programming. Methods and applications
• The capacity problem
• Programmes in Paired Spaces
• Numerical treatment of a class of semi‐infinite programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Linear Semi-Infinite Programming Problems: An Algorithm