## Mathematical Programming: State of the Art 1994 |

### What people are saying - Write a review

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

### Contents

lmproved Solution Alternatives | 64 |

lnterior Point Path Following Algorithms | 93 |

Computational Differentiation and Optimization | 102 |

Copyright | |

10 other sections not shown

### Common terms and phrases

algorithm applications approach approximation augmentation problem automatic differentiation balanceable bipartite graph bipartite graph branch branch-and-price candidates column combinatorial complexity computational concave Conforti connected constraints contains convergence convex corresponding cost decomposition defined denote derivatives digraph directed graph dual edge-connectivity edges efficient equations evaluation example feasible formulation geometry global optimization gradient graph G Hessian induced subgraph inequality integer integer-valued iteration Jacobian linear programming lower bounds LP relaxation Mathematical Programming matrix memory minimize minimum Mulvey Newton Newton's method node nonconvex nonlinear nonsmooth objective function Operations Research optimal solution optimization problems P. M. Pardalos pair partitioning path polynomial polytope primal processors projective geometry quadratic programming quasi-Newton quasi-Newton methods restricted satisfying scenario Section sequence signed bipartite graph SlAM solving stochastic programs strategy structure sub-partition subgraph subproblem subset subspace tabu search Theorem trust region undirected undirected graph variables vector