A procedure of Chvátal for testing feasibility in linear programming and matrix scaling-Reference-Cited by-同舟云学术

A procedure of Chvátal for testing feasibility in linear programming and matrix scaling

Published:2006-07 Issue:2-3 Volume:416 Page:795-798
ISSN:0024-3795
Container-title:Linear Algebra and its Applications
language:en
Short-container-title:Linear Algebra and its Applications

Author:

Jin Yi,Kalantari Bahman

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory

Reference9 articles.

1. Linear Programming;Chvátal,1983

2. Notes on the Khachiyan–Kalantari Algorithm;Chvátal,2002

3. Y. Jin, B. Kalantari, Chvátal’s Lemma and matrix scaling, Technical Report DCS-TR-581, Department of Computer Science, Rutgers University, New Brunswick, NJ, 2004.

4. Canonical problems for quadratic programming and projective methods for their solution;Kalantari;Contemp. Math.,1990

5. A Theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices;Kalantari;Linear Algebra Appl.,1996

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust vertex enumeration for convex hulls in high dimensions;Annals of Operations Research;2020-03-13

2. An algorithmic separating hyperplane theorem and its applications;Discrete Applied Mathematics;2019-03

3. A theorem of the alternative with an arbitrary number of inequalities and quadratic programming;Journal of Global Optimization;2017-04-19

4. Nonlinear Programming via König’s Maximum Theorem;Journal of Optimization Theory and Applications;2016-05-31

5. A characterization theorem and an algorithm for a convex hull problem;Annals of Operations Research;2014-08-24