Pages that link to "Item:Q5578704"
From MaRDI portal
The following pages link to Duality and asymptotic solvability over cones (Q5578704):
Displaying 29 items.
- Polyhedral cone-ratio DEA models with an illustrative application to large commercials banks (Q749427) (← links)
- Primal-dual stability in continuous linear optimization (Q959934) (← links)
- Linear optimization with box constraints in Banach spaces (Q1028599) (← links)
- Convex semi-infinite games (Q1065725) (← links)
- Duality in infinite dimensional linear programming (Q1184338) (← links)
- Comment on a note on duality gaps in linear programming over convex sets (Q1214849) (← links)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- Cone concavity and multiple-payoff constrained \(n\)-person games (Q1264992) (← links)
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach (Q1695816) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming (Q1958647) (← links)
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory (Q2532626) (← links)
- Asymptotic duality over closed convex sets (Q2539954) (← links)
- Linear programs in topological vector spaces (Q2552082) (← links)
- On semi-infinite systems of linear inequalities (Q2553481) (← links)
- A note on duality gaps in linear programming over convex sets (Q2560092) (← links)
- Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes (Q2810088) (← links)
- Stability of the primal-dual partition in linear semi-infinite programming (Q3145055) (← links)
- Primal and dual optimality criteria in convex programming (Q3208441) (← links)
- Generic primal-dual solvability in continuous linear semi-infinite programming (Q3498590) (← links)
- Cone ratio data envelopment analysis and multi-objective programming (Q3835325) (← links)
- Asymptotic kuhn-tucker conditions in abstract spaces (Q3958295) (← links)
- Modified regularity conditions for nonlinear programming problems over mixed cone domains (Q4055388) (← links)
- On a classification scheme for geometric programming and complementarity theorems†<sup>†</sup> (Q4143032) (← links)
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS (Q4548047) (← links)
- Primal, dual and primal-dual partitions in continuous linear optimization (Q5426963) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms (Q6041108) (← links)