## Mathematical Programming Study, Volumes 25-28 |

### From inside the book

Try this search over all volumes: **assume**

Results 1-0 of 0

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

18 J S Pang and R Chandrasekaran Linear complementarity problem | 13 |

21 R Rouhani L Lasdon W Lebow and A D Warren A generalized Benders | 62 |

22 A J Hoffman and P Wolfe Minimizing a unimodal function of two integer | 76 |

Copyright | |

10 other sections not shown

### Common terms and phrases

applied approximation assignment assignment problem augmenting path Benders cut Benders decomposition branch and bound codes column completely reducible components concave functions constraints convergence convex convex function corresponding Dantzig deep-cut defined Dembo denote direction distribution dual variables edge efficient feasible solution finite follows given gradient graph implementation inequality integer programming iteration Lemma line search line-sum-symmetric linear complementarity problem linear programming lower bound Mathematical Programming maximum flow method minimization minimum cost Monotone Likelihood network design problem network flow network flow problems nonlinear nonnegative matrix objective function obtained Operations Research optimal solution parameters pivots primal Principle of Monotone procedure Proof quadratic random variable satisfies Section shortest path algorithm shortest path problem simplex solving step stochastic programming strategy subproblem subset subtree Table test problems Theorem threshold transportation problem tree updating upper bound variant vector vertex zero