Fang S.-C.

S.-C. Fang

Information about the author S.-C. Fang will soon be added to the site.
Found 13 papers in total
Recursive approximation of the high dimensional max function
Recursive approximation of the high dimensional max function
2005
This paper proposes a smoothing method for the general n -dimensional max function,...
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
1999
One of the major computational bottlenecks of using the conventional cutting plane...
A global-filtering algorithm for linear programming problems with stochastic elements
A global-filtering algorithm for linear programming problems with stochastic elements
1998
In this paper, an interior-point based global filtering algorithm is proposed to solve...
Linear programming with fuzzy coefficients in constraints
Linear programming with fuzzy coefficients in constraints
1999
This paper presents a new method for solving linear programming problems with fuzzy...
Solving convex programming problems with equality constraints by neural networks
Solving convex programming problems with equality constraints by neural networks
1998
This paper presents a neural network approach for solving convex programming problems...
A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
1996
To closely describe the earliness/tardiness production planning problems in the JIT...
A dual perturbation view of linear programming
A dual perturbation view of linear programming
1996
Solving standard-form linear programs via perturbation of the primal objective...
A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm
1996
To closely describe the earliness/tardiness production planning problems in the JIT...
A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming
A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming
1995
In this paper, the authors design an algorithm for solving linear semi-infinite...
An inexact approach to solving linear semi-infinite programming problems
An inexact approach to solving linear semi-infinite programming problems
1994
In this paper, the authors propose an ‘inexact solution’ approach to deal...
A Bayesian interpretation of the linearly-constrained cross-entropy minimization problem
A Bayesian interpretation of the linearly-constrained cross-entropy minimization problem
1993
Both the linearly-constrained minimum cross-entropy (LCMXE) method and the Bayesian...
Insights into the interior-point methods
Insights into the interior-point methods
1992
In this paper, the authors study the search directions of three important...
An unconstrained convex programming view of linear programming
An unconstrained convex programming view of linear programming
1992
The major interest of this paper is to show that, at least in theory, a pair of primal...
Papers per page: