An inexact approach to solving linear semi-infinite programming problems

DOI10.1080/02331939408843923zbMath0819.90113OpenAlexW2037654933MaRDI QIDQ3835641

Soon-Yi Wu, Shu-Cherng Fang

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

inexact solutionlinear semi-infinite programmingentropy optimization

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (14)

A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming ⋮ Implementation of an inexact approach to solving linear semi-infinite programming problems ⋮ A semi-infinite programming model for earliness/tardiness production planning with simulated annealing ⋮ A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm ⋮ Solving convex programming problems with equality constaints by neural networks ⋮ An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints ⋮ Relaxation methods for solving linear inequality systems: converging results ⋮ 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 ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Rate of convergence of a class of numerical methods solving linear inequality systems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions

Cites Work

• A new polynomial-time algorithm for linear programming
• An interior point algorithm for semi-infinite linear programming
• Extremal points and optimal solutions for general capacity problems
• Ein Konstruktionsverfahren bei allgemeiner linearer Approximation
• The capacity problem
• Entropy in linear programs
• Numerical treatment of a class of semi‐infinite programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An inexact approach to solving linear semi-infinite programming problems