## Mathematical Programming Study, Issues 10-15 |

### From inside the book

90 pages matching **optimization problems** in this book

#### Page 59

Where's the rest of this book?

Results 1-3 of 90

### What people are saying - Write a review

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

### Contents

Relaxation methods | 13 |

1 Differentiable stability in non convex and non differentiable program | 29 |

2 A multivalued approach to the Farkas lemma Borwein | 42 |

Copyright | |

48 other sections not shown

### Common terms and phrases

2-matching accumulation point analysis applications approach approximation assume assumptions cluster point coefficients computational consider constraints continuous convergence convex function convex programming convex set Corollary cost cutting planes defined Definition denote equations example exists Farkas lemma feasible finite number G.G.L. Meyer gear given gradient graph Hence heuristic Huard hypergraph hypothesis implies inequalities integer iteration Journal on Control Lemma linear programming lower bound lower semi-continuous Mathematical Programming matrix matroid maximize method minimax minimization minimum modified Lagrangians monotone neighborhood node nonempty nonlinear programming North-Holland Publishing Company objective function obtained Operations Research optimal solution optimization problems optimum p-decreasing family paper parameter point-to-set maps polyhedral procedure programming problem Proof properties Proposition quadratic R.R. Meyer saddle points satisfied Section semi-continuous sequence set covering problem SIAM Journal simplex simulation solving space stability subset Suppose Theorem travelling salesman problem u.s.c. and compact variables vector