The paper presents an implementation of auto production planning by using C#.Net, which aims at improving work efficiency in press shop of vehicle factory and builds a model to distribute resources to balance capabili...
详细信息
The paper presents an implementation of auto production planning by using C#.Net, which aims at improving work efficiency in press shop of vehicle factory and builds a model to distribute resources to balance capability of all product lines reasonably. A nonlinear mixed-integer programming arithmetic is applied in the process of design, and then the solution is obtained by employing Excel programming. This method makes auto production planning possible to enhance work efficiency and effectively solve the problems of date management and date consistency between press shop and press depot.
In this paper we describe an algorithm for solving nonlinear nonconvex programming problems, which is based on the interior point approach. The main theoretical results concern direction determination and step-length ...
详细信息
In this paper we describe an algorithm for solving nonlinear nonconvex programming problems, which is based on the interior point approach. The main theoretical results concern direction determination and step-length selection. We split inequality constraints into active and inactive parts to overcome problems with instability. Inactive constraints are eliminated directly, whereas active constraints are used for defining a symmetric indefinite linear system. Inexact solution of this system is obtained iteratively using indefinitely preconditioned conjugate gradient method. Theorems confirming efficiency of the indefinite preconditioner are introduced. Furthermore, a new merit function is defined and a filter principle is used for step-length selection. The algorithm was implemented in the interactive system for universal functional optimization UFO. Results of numerical experiments are reported.
In this paper, a uniform method is presented for computing the minimum translational distance (MTD) between a pair of ellipsoids. This article deduces a necessary and sufficient condition of the witness point-pair whi...
详细信息
ISBN:
(纸本)9781424442843
In this paper, a uniform method is presented for computing the minimum translational distance (MTD) between a pair of ellipsoids. This article deduces a necessary and sufficient condition of the witness point-pair which achieve MTD value and reliable criteria for determining their spatial relation. Experimental results show the algorithm converge after a few iterations whether two objects overlap or not and perform better than other algorithms.
We investigate the use of a nonlinear control allocation scheme for automotive vehicles. Such a scheme is useful in e.g. yaw or roll stabilization of the vehicle. The control allocation allows a modularization of the ...
详细信息
ISBN:
(纸本)0780390989
We investigate the use of a nonlinear control allocation scheme for automotive vehicles. Such a scheme is useful in e.g. yaw or roll stabilization of the vehicle. The control allocation allows a modularization of the control task, such that a higher level control system specifies a desired moment to work on the vehicle, while the control allocation distributes this moment among the individual wheels by commanding appropriate wheel slips. The control allocation problem is defined as a nonlinear., optimization problem, to which an explicit piecewise linear approximate solution function is computed off-line. Such a solution function can computationally efficiently be implemented in real time with at most a few hundred arithmetic operations per sample. Yaw stabilization of the vehicle yaw dynamics is used as an example of use of the control allocation. Simulations show that the controller stabilizes the vehicle in an extreme manoeuvre where the vehicle yaw dynamics otherwise becomes unstable.
Many types of mathematical models for in-vitro dissolution for solid dosage forms, or percent dissolved as a function of time, have been fit to data. Usually the goals of dissolution modeling are demonstrating equival...
详细信息
Many types of mathematical models for in-vitro dissolution for solid dosage forms, or percent dissolved as a function of time, have been fit to data. Usually the goals of dissolution modeling are demonstrating equivalence in dissolution between different dosage forms, and aiding in the dosage form design process. This article presents a differential equation model of dissolution, and empirically compares some special forms of the general solution to this equation. Data from a designed mixture experiment are then used in conjunction with the parametric models fit to the data by least squares regression. A nonlinear programming approach is employed to find optimal blends.
Under mild conditions, the Jacobian associated with the Karush-Kuhn-Tucker (KKT) system of a (non-convex) nonlinear program is nonsingular near an isolated solution. However, this property may not hold away from such ...
详细信息
ISBN:
(纸本)1595932577
Under mild conditions, the Jacobian associated with the Karush-Kuhn-Tucker (KKT) system of a (non-convex) nonlinear program is nonsingular near an isolated solution. However, this property may not hold away from such a solution. To enhance the robustness and efficiency of the primal-dual interior-point approach, we propose a method that at each iteration solves a trust-region, least-squares problem associated with the linearized perturbed KKT conditions. As a merit function, we use the Euclidean norm-square of the KKT conditions and provide a theoretical justification. We present some preliminary numerical results. Copyright 2005 ACM.
This paper presents a stochastic non-linear program (S-NLP) with a confidence interval constraint. The problem extends the conventional maximum loading problem to include randomness and uncertainty in system loading l...
详细信息
ISBN:
(纸本)0780392558
This paper presents a stochastic non-linear program (S-NLP) with a confidence interval constraint. The problem extends the conventional maximum loading problem to include randomness and uncertainty in system loading levels. The problem restricts the 99% confidence interval of the loading level to be within a pre-specifled amount of the mean. The paper presents solutions when the confidence interval is restricted to be within 15, 20, and 25% of the mean. The proposed solution methodology is tested using the IEEE 30 bus system and results are compared against solutions found using Monte Carlo Simulations. Each of the Monte Carlo Simulations consist of 10,000 samples.
In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Based on our observation that MINLPs in many engin...
详细信息
By redefining multiplier associated with inequality constraint as a positive definite function of the originally-defined multiplier, u i2, i = 1, 2,,m, say, the nonnegative constraints imposed on inequality constraint...
详细信息
Focusing on the high error and time consuming of the algorithms for shape from shading (SFS), a fast viscosity solution algorithm of perspective SFS (PSFS-FVS) is proposed. The image irradiance equation is established...
详细信息
Focusing on the high error and time consuming of the algorithms for shape from shading (SFS), a fast viscosity solution algorithm of perspective SFS (PSFS-FVS) is proposed. The image irradiance equation is established on the basis of Lambertian reflectance model and perspective camera projection. Then the equation is transformed into a static Hamilton-Jacobi partial differential equation (PDE) that contains the shape information of a surface. The viscosity solution of the resulting PDE is approximated by using a nonlinear programming method, and then the surface shape is generated. Experimental results and comparisons with the Prados-Faugeras algorithm on synthetic vase image show that the mean relative error of the height of the PSFS-FVS algorithm is reduced by 8.7% with the same iterations, and the CPU time of the PSFS-FVS algorithm is decreased by 23.5% at the same error, respectively. Reconstruction results from real face image show that the PSFS-FVS algorithm is more accurate and effective than the Prados-Faugeras algorithm in dealing with the local of the surface.
暂无评论