On the Solution of Nonlinear Inequalities in a Finite Number of Iterations.
Optimality conditions for a class of mathematical programs with equilibrium constraints: strongly regular case
The paper deals with mathematical programs, where parameter-dependent nonlinear complementarity problems arise as side constraints. Using the generalized differential calculus for nonsmooth and set-valued mappings due to B. Mordukhovich, we compute the so-called coderivative of the map assigning the parameter the (set of) solutions to the respective complementarity problem. This enables, in particular, to derive useful 1st-order necessary optimality conditions, provided the complementarity problem...
Optimally Conditioned Vandermonde Matrices.
Optimisation de procédés chimiques par une méthode de gradient réduit. Partie II. Exemples d'illustration. Comparaison avec d'autres méthodes
Optimisation de procédés chimiques par une méthode de gradient réduit partie I. Présentation de l'algorithme
Optimisation impossible
Optimization of dynamical systems
Optimization of plunger cavity
In the contribution we present a problem of shape optimization of the cooling cavity of a plunger that is used in the forming process in the glass in dustry. A rotationally symmetric system of the mould, the glass piece, the plunger and the plunger cavity is considered. The state problem is given as a stationary heat conduction process. The system includes a heat source representing the glass piece that is cooled from inside by water flowing through the plunger cavity and from outside by the environment surrounding...
Optimization of positive generalized polynomials under constraints.
Optimization problem under two-sided (max, +)/(min, +) inequality constraints
-linear functions are functions which can be expressed as the maximum of a finite number of linear functions of one variable having the form , where , , are real numbers. Similarly -linear functions are defined. We will consider optimization problems in which the set of feasible solutions is the solution set of a finite inequality system, where the inequalities have -linear functions of variables on one side and -linear functions of variables on the other side. Such systems can be applied...
Optimization under Nonnegativity Constraints.
Optimization-based approach to path planning for closed chain robot systems
An application of advanced optimization techniques to solve the path planning problem for closed chain robot systems is proposed. The approach to path planning is formulated as a “quasi-dynamic” NonLinear Programming (NLP) problem with equality and inequality constraints in terms of the joint variables. The essence of the method is to find joint paths which satisfy the given constraints and minimize the proposed performance index. For numerical solution of the NLP problem, the IPOPT solver is used,...
Optimum Allocation in Multivariate Stratified Random Sampling with Overhead Cost.
Optimum Design of Steel Trusses
Original title unknown
Original title unknown
Original title unknown