Dang Chuangyin

Chuangyin Dang

Information about the author Chuangyin Dang will soon be added to the site.
Found 9 papers in total
Exactness and algorithm of an objective penalty function
Exactness and algorithm of an objective penalty function
2013
Penalty function is an important tool in solving many constrained optimization...
An Objective Penalty Function of Bilevel Programming
An Objective Penalty Function of Bilevel Programming
2012
Penalty methods are very efficient in finding an optimal solution to constrained...
An interior‐point path‐following algorithm for computing a Leontief economy equilibrium
An interior‐point path‐following algorithm for computing a Leontief economy equilibrium
2011
In this paper, we present an interior‐point path‐following algorithm for...
A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence
A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence
2011
When the leader's objective function of a nonlinear bilevel programming problem is...
Batch-processing scheduling with setup times
Batch-processing scheduling with setup times
2004
The problem is to minimize the total weighted completion time on a single...
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
1999
An arbitrary starting variable dimension algorithm is proposed to compute an integer...
A homotopy approach to the computation of economic equilibria on the unit simplex
A homotopy approach to the computation of economic equilibria on the unit simplex
1999
In the model of a pure exchange economy with n + 1 commodities, the excess demand...
The D2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
The D2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
1993
A triangulation of arbitrary refinement of grid sizes of (0,1]×ℝ n is...
The D1-triangulation of Rn for simplicial algorithms for computing solutions of nonlinear equations
The D1-triangulation of Rn for simplicial algorithms for computing solutions of nonlinear equations
1991
The paper presents a new triangulation of ℝ n , which is called the D 1...
Papers per page: