## New Trends in Mathematical Programming: Homage to Steven VajdaFranco Giannessi, Sándor Komlósi, Tamás Rapcsák Though the volume covers 22 papers by 36 authors from 12 countries, the history in the background is bound to Hungary where, in 1973 Andras Pn§kopa started to lay the foundation of a scientific forum, which can be a regular meeting spot for experts of the world in the field. Since then, there has been a constant interest in that forum. Headed at present by Tamas Rapcsak, the Laboratory of Operations Research and Decisions Systems of the Computer and Automation Institute, Hungarian Academy of Sciences followed the tradition in every respect, namely conferences were organized almost in every second year and in the same stimulating area, in the Matra mountains. The basic fields were kept, providing opportunities for the leading personalities to give voice to their latest results. The floor has been widened recently for the young generation, ensuring this way both a real location for the past, present and future experts to meet and also the possibility for them to make the multicoloured rainbow of the fields unbroken and continuous. The volume is devoted to the memory of Steven Vajda, one of the pioneers on mathematical programming, born is Hungary. In 1992 he took part in the XIth International Conference on Mathematical Programming at Matrafiired where, with his bright personality, he greatly contributed to the good spirituality of the event. We thank Jakob Krarup for his reminiscence on the life and scientific activities of late Steven Vajda. |

### What people are saying - Write a review

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

### Contents

Steven Vajda 1901 1995 | 1 |

The FermatWeber problem and the Lagrangian duality theory | 5 |

Longest Fragment First Algorithms for Data Compression | 13 |

Linear Operators and Stochastic Dominance | 29 |

Some Properties of DiniDerivatives of Quasiconvex Functions | 41 |

Necessary conditions for twofunction mini max inequalities | 59 |

Fitting Circles and Spheres to Coordinate Measuring Machine Data | 65 |

On Minty Variational Principle | 93 |

Geometrical solution of weighted Fermat problem about triangles | 171 |

Separation and regularity in the image space | 181 |

Dynamic models and generalized equilibrium problems | 191 |

Ordering Heuristics in Interior Point LP Methods | 203 |

A Tabu Based Pattern Search Method for the Distance Geometry Problem | 223 |

Programming Under Probabilistic Constraint with Discrete Random Variable | 235 |

Variable metric methods along geodetics | 257 |

Criteria for Generalized Monotonicity | 277 |

Singlefacility location problems with arbitrary weights | 101 |

On Testing SLP Codes with SLPIOR | 115 |

On PrimalDual PathFollowing Algorithms for Semidefinite Programming | 137 |

A Piecewise Linear Dual Procedure in Mixed Integer Programming | 159 |

F System with Unequal Element Probabilities | 289 |

A common root of three minimization problems | 305 |

### Other editions - View all

New Trends in Mathematical Programming: Homage to Steven Vajda Franco Giannessi,Sándor Komlósi,Tamás Rapcsák No preview available - 2013 |

New Trends in Mathematical Programming: Homage to Steven Vajda Franco Giannessi,Sándor Komlósi,Tamás Rapcsák No preview available - 2010 |

### Common terms and phrases

algorithm Applications assume bounds circle cmax complete Computer condition cone consider constraints contains continuous convergence convex corresponding defined denote determined dictionary differentiable direction distance distribution dominance dual elements equal equation example exists feasible Figure fill-in function geometric give given Hence holds implementation implies inequality interior introduced iteration length linear programming lower maps Mathematical Programming matrix means measured methods minimizing monotone nodes nonlinear objective obtain Operations optimal solution pair path pattern pivot positive possible present probability problem Proof properties proved quasiconvex random References Remark Research respectively satisfy semidefinite programming separation solution solve space sphere step stochastic stochastic programming structure Table Theorem Theory triangle University updating upper variables vector vertex weights