Pages that link to "Item:Q1848390"

The following pages link to Linear semi-infinite programming theory: an updated survey (Q1848390):

Displaying 31 items.

• Bivariate interval semi-infinite programming with an application to environmental decision-making analysis (Q418056) (← links)
• Nonsmooth semi-infinite programming problem using limiting subdifferentials (Q454252) (← links)
• On metric regularity and the boundary of the feasible set in linear optimization (Q456979) (← links)
• Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization (Q608454) (← links)
• New strong duality results for convex programs with separable constraints (Q613429) (← links)
• Duality for nonsmooth semi-infinite programming problems (Q691458) (← links)
• A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
• Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
• An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Semi-infinite programming (Q869581) (← links)
• Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming (Q929609) (← links)
• ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty (Q1731536) (← links)
• Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem (Q1794864) (← links)
• Relaxation methods for solving linear inequality systems: converging results (Q1939079) (← links)
• Lagrange multiplier characterizations of constrained best approximation with infinite constraints (Q2046540) (← links)
• Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem (Q2115320) (← links)
• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
• Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
• Necessary optimality conditions for a nonsmooth semi-infinite programming problem (Q2423798) (← links)
• Understanding linear semi-infinite programming via linear programming over cones (Q3066933) (← links)
• Rate of convergence of a class of numerical methods solving linear inequality systems (Q3112495) (← links)
• On duality theory of convex semi-infinite programming (Q3534642) (← links)
• Semi-infinite programming, duality, discretization and optimality conditions† (Q3622011) (← links)
• A NUMERICAL METHOD FOR SOLVING LINEAR–QUADRATIC CONTROL PROBLEMS WITH CONSTRAINTS (Q4581436) (← links)
• Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions (Q4987689) (← links)
• Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming (Q5245019) (← links)
• Semi-infinite interval equilibrium problems: optimality conditions and existence results (Q6172893) (← links)
• Second-order optimality conditions for interval-valued functions (Q6498629) (← links)
• Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds (Q6568954) (← links)
• Set-valued semi-infinite programming problems with \(\tau\)-cone arcwise connectedness of higher-order (Q6586846) (← links)