An ε-out-of-kilter method for monotropic programming

Mathematics of Operations Research

Volumn 26, Issue 2, 2001, Pages 221-233

  Tseng, P ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Monotropic programming; Out of kilter method

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY;

MONOTROPIC PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0035351610     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.2.221.10557     Document Type: Article

References (19)

1. Applications of network optimization
2. Relaxation methods for network flow problems with convex arc costs
3. An ε-relaxation method for separable convex cost network flow problems
4. ε-relaxation and auction methods for separable convex cost network flow problems
5. Decomposition principle for linear programs
6. A partitioned ε-relaxation algorithm for separable convex network flow problems
7. Large-scale nonlinear network models and their application
8. Theoretical improvements in algorithmic efficiency for max flow problems
9. An out-of-kilter method for minimal cost flow problems
10. Path-following methods in linear programming
11. Solving steady-state nonlinear networks of "monotone" elements
12. Relaxation methods for monotropic programs
13. An ε-relaxation method for separable convex cost generalized network flow problems