Description: I Global Optimization.- 1 Global Optimization Methods for Location and Distance Geometry Problems.- 2 Branch and Cut Methods for Mixed Integer Linear Programming Problems.- 3 Separability of Star-Shaped Sets with Respect to Infinity.- 4 Nonlinear Unconstrained Optimization Methods: A Review.- 5 New Dual Formulations in Constrained Integer Programming.- 6 Simulated Annealing and Penalty Methods for Binary Multicommodity Flow Problems.- II Nonsmooth Optimization.- 7 A Quadratic Recourse Function for the Two-Stage Stochastic Program.- 8 Lagrange Multipliers for Nonconvex Optimization.- 9 Class--Inclusion Properties for Convex Functions.- 10 On Generic Locally Convex Vector Functions.- 11 Essential Components and Connectedness of Solution Set for Complementarity Problems.- 12 On Relations between Vector Variational Inequality and Vector Optimization Problem.- III Optimization Methods.- 13 Parameter Estimation in Dynamic Systems.- 14 Methods of Feasible Directions: A Review.- 15 Computational Method for a Class of Optimal Switching Control Problems.- 16 Optimization by Way of the Trajectory Following Method.- 17 Solving Hamilton-Jacobi-Bellman Equations by an Upwind Finite Difference Method.- 18 An Efficient Approximation Method for a Class of Continuous Linear Programs.- IV Applications.- 19 Calibration of Parameters for a Combined Gravity and Traffic Assignment Model.- 20 A Restricted Variation Argument to Derive Necessary Conditions for the Optimal Control of a Train.- 21 Determination of Optimal Batch Size for a Manufacturing System.- 22 Parameter Estimation in a Mathematical Model for Substrate Diffusion in a Metabolically Active Cutaneous Tissue.

Please Wait