On Linear Semi-Infinite Programming Problems: An Algorithm
From MaRDI portal
We study the linear semi-infinite programming problems and its dual problems. It can be set up as an air pollution problem. The necessary and sufficient conditions for optimal solutions for problem LSIP as well as for its dual problem DLSIP are established. We study the extreme points for feasible regions of LSIP and DLSIP. The main purpose is to develop a new algorithm to solve such kind of problems.
Recommendations
- A one-phase algorithm for semi-infinite linear programming
- scientific article; zbMATH DE number 776087
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- scientific article; zbMATH DE number 3870083
- A perturbation method for solving linear semi-infinite programming problems
Cites work
- Fuzzy mathematical programming. Methods and applications
- scientific article; zbMATH DE number 3900550 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- Numerical treatment of a class of semi‐infinite programming problems
- Programmes in Paired Spaces
- The capacity problem
Cited in
(34)- A comparative study of several semi-infinite nonlinear programming algorithms
- An efficient algorithm for solving semi-infinite inequality problems with box constraints
- Duality theorems and algorithms for linear programming in measure spaces
- Linear semi-infinite programming theory: an updated survey
- An algorithm for calculating -minimax decision rules under generalized moment conditions.
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- An algorithm for semi-infinite polynomial optimization
- 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
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- Solving linear programs with finite precision. II: Algorithms
- Separation by hyperplanes: a linear semi-infinite programming approach.
- Some applications of the Semi-Infinite Simplex Algorithm
- 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 - convex semi-infinite programming problems
- Generalized corner optimal solution for LSIP: existence and numerical computation
- Understanding linear semi-infinite programming via linear programming over cones
- scientific article; zbMATH DE number 3870083 (Why is no real title available?)
- scientific article; zbMATH DE number 4001882 (Why is no real title available?)
- A ladder method for linear semi-infinite programming
- scientific article; zbMATH DE number 1383149 (Why is no real title available?)
- Linear programming in measure spaces
- Solving semi-infinite programs by smoothing projected gradient method
- Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Solving strategies and well-posedness in linear semi-infinite programming
- Probability maximization models for portfolio selection under ambiguity
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: On Linear Semi-Infinite Programming Problems: An Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029144)
