Mathematical Programming Study, Issues 10-15North-Holland Publishing Company, 1979 - Mathematical optimization |
Contents
Background to pointtoset maps in mathematical programming | 1 |
General reference list | 14 |
1 Differentiable stability in non convex and non differentiable program | 29 |
Copyright | |
54 other sections not shown
Other editions - View all
Common terms and phrases
2-matching accumulation point algorithm applications approach assumptions Bandler circuit cluster point coefficients comb inequalities compact computational consider constraints continuous convergence convex convex function convex set Corollary cost cutting planes defined denote dual solution E A(z equations example exists Farkas lemma fixed point gear given gradient graph greedy algorithm Hence heuristic Huard hypergraph hypothesis implies integer iteration Journal on Control Lemma linear programming lower bound lower semicontinuous Mathematical Programming matrix method minimax minimization minimum monotone N₁ node nonempty nonlinear programming objective function obtained optimal solution optimum parameters point-to-set maps polytope procedure programming problem Proof properties quadratic satisfied Section semicontinuous sequence set covering set covering problem SIAM Journal simulation solving Step subgradient subset subtour Theorem tour travelling salesman problem upper bound variables vector vertex W₁ W₂