Techniques of linear programming based on the theory of convex cones
DOI10.1080/02331938908843496zbMATH Open0683.90043OpenAlexW2054608381MaRDI QIDQ4733657FDOQ4733657
Authors: Paolo D'Alessandro, Manuela Dalla Mora, Elena De Santis 
Publication date: 1989
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938908843496
Recommendations
- scientific article
- On the convex programming approach to linear programming
- scientific article; zbMATH DE number 3856836
- scientific article; zbMATH DE number 3453516
- Convexification techniques for linear complementarity constraints
- Convexification techniques for linear complementarity constraints
- Conical projection algorithms for linear programming
- scientific article; zbMATH DE number 1050303
- Advances in convex optimization: conic programming
- Theoretical framework for the analysis of linearly constrained convex programs
dimension reductionpolyhedral conesparallel implementationsextreme raysconvex cones approachstrictly tangent relaxation
Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Theory of operating systems (68N25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial algorithms in linear programming
- Nonlinear Perturbation of Linear Programs
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- A suboptimization method for interval linear programming: A new method for linear programming
- Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
- On consistency of linear linearly constrained discrete time systems
Cited In (10)
- A primal conical linear programming algorithm
- A maximal volume cone algorithm for linear programming problems
- A polytopic game
- New conical internally evolutive linear programming algorithm
- \((A,B)\)-invariant polyhedral sets of linear discrete-time systems
- On invariant sets for constrained discrete time linear systems with disturbances and parametric uncertainties
- Double invariance: A new equilibrium concept for two-person dynamic games
- Digital idle speed control of automotive engines: a safety problem for hybrid systems
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Techniques of linear programming based on the theory of convex cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733657)
