Pages that link to "Item:Q1824547"
From MaRDI portal
The following pages link to An extension of the simplex algorithm for semi-infinite linear programming (Q1824547):
Displaying 36 items.
- Generalized corner optimal solution for LSIP: existence and numerical computation (Q286184) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- A ladder method for linear semi-infinite programming (Q380573) (← links)
- Quasipolyhedral sets in linear semiinfinite inequality systems (Q677806) (← links)
- Separating the solution sets of analytical and polynomial systems (Q819953) (← links)
- A one-phase algorithm for semi-infinite linear programming (Q911454) (← links)
- Stability of the intersection of solution sets of semi-infinite systems (Q929613) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- Geometric fundamentals of the simplex method in semi-infinite programming (Q1117839) (← links)
- A purification algorithm for semi-infinite programming (Q1197680) (← links)
- A multi-local optimization algorithm (Q1265238) (← links)
- Towards a closer integration of finite domain propagation and simplex-based algorithms (Q1265905) (← links)
- Continuous linear complementarity problem (Q1321332) (← links)
- New descent rules for solving the linear semi-infinite programming problem (Q1332958) (← links)
- Locally polyhedral linear inequality systems (Q1377509) (← links)
- Representability of convex sets by analytical linear inequality systems. (Q1428616) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- On linear inequality systems with smooth coefficients (Q1777594) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- Solving a class of fuzzy linear programs by using semi-infinite programming techniques (Q1885701) (← links)
- Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
- Analytical linear inequality systems and optimization (Q1969463) (← links)
- On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
- Selected applications of linear semi-infinite systems theory (Q2022431) (← links)
- Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← links)
- Separation by hyperplanes: a linear semi-infinite programming approach. (Q2776656) (← links)
- Some applications of the Semi-Infinite Simplex Algorithm (Q2808315) (← links)
- A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems (Q2915910) (← links)
- A Shadow Simplex Method for Infinite Linear Programs (Q3098281) (← links)
- Solving Semi-infinite Linear Programs Using Boosting-Like Methods (Q3522972) (← links)
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex (Q3777792) (← links)
- An optimality test for semi-infinite linear programming (Q4327961) (← links)
- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (Q4647860) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
