Techniques of linear programming based on the theory of convex cones

DOI10.1080/02331938908843496zbMath0683.90043OpenAlexW2054608381MaRDI QIDQ4733657

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

zbMATH Keywords

dimension reductionparallel implementationsextreme rayspolyhedral conesconvex cones approachstrictly tangent relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Theory of operating systems (68N25)

Related Items (7)

New conical internally evolutive linear programming algorithm ⋮ On invariant sets for constrained discrete time linear systems with disturbances and parametric uncertainties ⋮ A primal conical linear programming algorithm ⋮ DOUBLE INVARIANCE: A NEW EQUILIBRIUM CONCEPT FOR TWO-PERSON DYNAMIC GAMES ⋮ \((A,B)\)-invariant polyhedral sets of linear discrete-time systems ⋮ Digital idle speed control of automotive engines: a safety problem for hybrid systems ⋮ A polytopic game

Cites Work

• Unnamed Item
• Unnamed Item
• On consistency of linear linearly constrained discrete time systems
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
• A suboptimization method for interval linear programming: A new method for linear programming
• Nonlinear Perturbation of Linear Programs
• Polynomial algorithms in linear programming

This page was built for publication: Techniques of linear programming based on the theory of convex cones