An inexact approach to solving linear semi-infinite programming problems
From MaRDI portal
Publication:3835641
DOI10.1080/02331939408843923zbMATH Open0819.90113OpenAlexW2037654933MaRDI QIDQ3835641FDOQ3835641
Authors: Shu-Cherng Fang, Soon-Yi Wu 
Publication date: 20 April 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939408843923
Recommendations
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- Connections between generalized, inexact and semi-infinite linear programming
- A perturbation method for solving linear semi-infinite programming problems
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
- scientific article; zbMATH DE number 776087
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Entropy in linear programs
- Title not available (Why is that?)
- An interior point algorithm for semi-infinite linear programming
- Numerical treatment of a class of semi‐infinite programming problems
- Extremal points and optimal solutions for general capacity problems
- The capacity problem
- Title not available (Why is that?)
- Ein Konstruktionsverfahren bei allgemeiner linearer Approximation
Cited In (31)
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- Title not available (Why is that?)
- A relaxation method for solving systems with infinitely many linear inequalities
- Modelos auxiliares para problemas de programacion lineal con coeficientes imprecisos en las restricciones
- 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 perturbation method for solving linear semi-infinite programming problems
- A ladder method for linear semi-infinite programming
- A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems
- On approximate solutions of infinite systems of linear inequalities
- A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- Connections between generalized, inexact and semi-infinite linear programming
- Title not available (Why is that?)
- Solving strategies and well-posedness in linear semi-infinite programming
- Best linear near unbiased estimation for nonlinear signal models via semi-infinite programming approach
- Solving convex programming problems with equality constaints by neural networks
- A new smoothing Newton-type algorithm for semi-infinite programming
- An exponent Lagrangian for solving semi-infinite programming problems
- Title not available (Why is that?)
- Optimal finite characterization of linear problems with inexact data
- 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
- Relaxation methods for solving linear inequality systems: converging results
- Title not available (Why is that?)
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Inexact linear programming with generalized technological matrix sets
- Parametric linear semi-infinite programming
- A semi-infinite programming method for approximating load duration curves by polynomials
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing
This page was built for publication: An inexact approach to solving linear semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835641)
