scientific article; zbMATH DE number 4135708
From MaRDI portal
Publication:3468877
Recommendations
Cited in
(19)- Concave programming and DH-point
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
- A maximal volume cone algorithm for linear programming problems
- A cone programming approach to the bilinear matrix inequality problem and its geometry
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
- Unconstrained convex programming approach to linear programming
- The cone method for solving linear systems
- Convex integration with linear constraints and its applications
- On a box-constrained linear symmetric cone optimization problem
- The strong conical hull intersection property for convex programming
- Understanding linear semi-infinite programming via linear programming over cones
- Solving the linear complementarity problem through concave programming
- Relaxation Methods for Linear Programs
- A cone constrained convex program: structure and algorithms
- A primal conical linear programming algorithm
- scientific article; zbMATH DE number 1050303 (Why is no real title available?)
- Techniques of linear programming based on the theory of convex cones
- New conical internally evolutive linear programming algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468877)
