This paper deals with mainly establishing numerous sets of generalized second-order parametric sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem are achieved based on some partitioning schemes under various types of generalized second-order (F ,β, φ, ρ, θ, m)-univex...

Consider the nonlinear fractional programming problem max{f(x)lg(x)lxES}, where g(x»O for all XES. Jagannathan and Dinkelbach have shown that the maximum of this problem is equal to ~O if and only if max{f(x)-~g(x) IXES} is 0 for ~=~O. 1 t t Based on this result, we treat here a special case: f(x)=Zx Cx+r x+s, g(X)=~ xtDX+ptX+q and S is a polyhedron, where C is negative definite and D is positi...

This work demonstrates in practical terms the evolutionary concepts and computational applications of Parametric Curves. Specific cases were drawn from higher order parametric Bezier curves degrees 2 above. find real life diverse areas Engineering Computer Science, such as computer graphics, robotics, animations, virtual reality, among others. Some issues explored this are equations derivations...

This paper presents a novel non-parametric approximate dynamic programming (ADP) algorithm that enjoys graceful approximation and sample complexity guarantees. In particular, we establish both theoretically and computationally that our proposal can serve as a viable alternative to state-of-the-art parametric ADP algorithms, freeing the designer from carefully specifying an approximation archite...

This paper considers the computational efficiency of using generalised function parameterisations for multi-parametric quadratic programming (mp-QP) solutions to MPC. Earlier work demonstrated the potential of Laguerre parameterisations for improving computational efficiency in that the parametric solutions either required fewer regions and/or gave larger volumes. This paper considers the poten...

We show, mostly through detailed examples, that programming patterns known to involve the notion of virtual types can be implemented directly and concisely using parametric poly-morphism. A signiicant improvement we make over previous approaches is to allow related classes to be deened independently. This solution is more exible, more general, and we believe, simpler than other type-safe soluti...

The paper addresses the problem of numerical issues and degeneracies in the parametric quadratic programming (pQP) algorithm, used for computing partitions of explicit model predictive controllers (eMPC) with the Multi-Parametric Toolbox (MPT). We summarise the pQP problem setup and the basic algorithm, analyse its implementation in MPT, expose the numerical issues and suggest a series of impro...

Studying a critical value function φ in parametric nonlinear programming, we recall conditions guaranteeing that φ is a C function and derive second order Taylor expansion formulas including second-order terms in the form of certain generalized derivatives of Dφ. Several specializations and applications are discussed. These results are understood as supplements to the well–developed theory of f...

This paper studies stability aspects of solutions of parametric mathematical programs and generalized equations, respectively, with disjunctive constraints. We present sufficient conditions that, under some constraint qualifications ensuring metric subregularity of the constraint mapping, continuity results of upper Lischitz and upper Hölder type, respectively, hold. Furthermore, we apply the a...

Many forms of parsimony pressure are parametric, that is final fitness is a parametric model of the actual size and raw fitness values. The problem with parametric techniques is that they are hard to tune to prevent size from dominating fitness late in the evolutionary run, or to compensate for problem-dependent nonlinearities in the raw fitness function. In this paper we briefly discuss existi...