Pages that link to "Item:Q2496650"
From MaRDI portal
The following pages link to A procedure of Chvátal for testing feasibility in linear programming and matrix scaling (Q2496650):
Displaying 5 items.
- Nonlinear programming via König's maximum theorem (Q328441) (← links)
- Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
- A theorem of the alternative with an arbitrary number of inequalities and quadratic programming (Q1679492) (← links)
- An algorithmic separating hyperplane theorem and its applications (Q1728094) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
