Techniques of linear programming based on the theory of convex cones

DOI10.1080/02331938908843496MaRDI QIDQ4733657zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dimension reductionpolyhedral conesparallel implementationsextreme raysconvex 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)

Recommendations

• scientific article; zbMATH DE number 4135708
• 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

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• A suboptimization method for interval linear programming: A new method for linear programming
• Nonlinear Perturbation of Linear Programs
• 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
• Polynomial algorithms in linear programming
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming

Cited in

(10)

• 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
• scientific article; zbMATH DE number 4135708 (Why is no real title available?)
• A polytopic game
• Digital idle speed control of automotive engines: a safety problem for hybrid systems
• On invariant sets for constrained discrete time linear systems with disturbances and parametric uncertainties
• New conical internally evolutive linear programming algorithm
• scientific article; zbMATH DE number 1559484 (Why is no real title available?)
• A maximal volume cone algorithm for linear programming problems

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)