We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems. This approach solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. New strategies are proposed for uncovering feasible and high-quality solutions and exten...

We consider the constrained infinite time optimal control problem for the class of discrete time linear hybrid systems. When a linear performance index is used the infinite time optimal solution is a piecewise affine (PWA) state feedback control law. In this paper we present an algorithm that computes the optimal solution in a computationally efficient manner. It combines a dynamic programming ...

The aim of the present work is to use a metric intersection formula estimate subdifferential marginal function in convex setting. This includes many interesting situations parametric programming, including polyhedral one. It expressed terms objective and constrained multivalued mapping which govern program.

A parametric CNC (Computer Numerical Control) program was developed to make a test complex surface on a vertical milling machine equipped with an external fourth rotational axis. Parametric programming was used in order to get higher flexibility of the manufacturing process. The ball-end milling process was simulated and verified in a virtual model of the machine tool developed with the module ...

Mathematical programming methods have traditionally been used extensively in the analysis and design of elastic/plastic structures. However, some of the recent results from parametric nonlinear programming have not been fully exploited in mechanical applications, particularly those relating to the causes of singularities due to parametric variations. In this paper, we reexamine the phenomenon o...

This study intends to develop easy-to-implement and effective approaches to help decision makers cope with the challenges of designing their optimal systems, and determine the corresponding optimal budgets. The approaches are realized by constructing optimal system design (OSD) data envelopment analysis (DEA) models that build on the concepts and techniques of DEA, de novo programming and param...

We extend the simply-typed lambda-calculus with a mechanism for dynamic rebinding of code based on parametric nominal interfaces. That is, we introduce values which represent single fragments, or families of named fragments, of open code, where free variables are associated with names which do not obey α-equivalence. In this way, code fragments can be passed as function arguments and manipulate...

For researchers intending to investigate midto large-scale portfolio selection, good, inexpensive and understandable quadratic parametric programming software, capable of computing the efficient frontiers of problems with up to two thousand securities without simplifications to the covariance matrix, is hardly known to be available anywhere. As an alternative to Markowitz’s critical line method...

In the area of automatic parallelization of programs, analyzing and transforming loop nests with parametric aane loop bounds requires fundamental mathematical results. The most common geometrical model of iteration spaces, called the polytope model, is based on mathematics dealing with convex and discrete geometry, linear programming, combinatorics and geometry of numbers. In this paper, we pre...

Non-parametric and semi-parametric analysis of panel count data have recently been an active research topic in statistical literature. Maximum likelihood method based on non-homogeneous Poisson process has been proved an efficient inference procedure for such analysis. However, computing the nonand semi-parametric maximum likelihood estimates (MLE) can be very intensive numerically. In this man...