Park Soondal

Soondal Park

Information about the author Soondal Park will soon be added to the site.
Found 27 papers in total
Positive sensitivity analysis in linear programming
Positive sensitivity analysis in linear programming
2004
Positive sensitivity analysis (PSA) is a sensitivity analysis method for linear...
A new admissible pivot method for linear programming
A new admissible pivot method for linear programming
2004
We present a new admissible pivot method for linear programming that works with a...
On the properties of ε-sensitivity analysis for linear programming
On the properties of ε-sensitivity analysis for linear programming
2005
ε-Sensitivity analysis (ε-SA) is a kind of method to perform sensitivity...
An ϵ-sensitivity analysis for semidefinite programming
An ϵ-sensitivity analysis for semidefinite programming
2005
We extend the concept of ϵ-sensitivity analysis developed for linear programming...
On the relationship between e-sensitivity analysis and sensitivity analysis using an optimal basis
On the relationship between e-sensitivity analysis and sensitivity analysis using an optimal basis
2004
ε-sensitivity analysis is a kind of method for performing sensitivity analysis...
On finding an optimal departure time in time-dependent networks
On finding an optimal departure time in time-dependent networks
2004
Most existing studies on time-dependent networks have been focused on finding a...
Warm start of interior point methods for multicommodity network flow problem
Warm start of interior point methods for multicommodity network flow problem
2004
In this paper, we present a methodology for solving the multicommodity network flow...
A label-setting algorithm for finding a quickest path
A label-setting algorithm for finding a quickest path
2004
The quickest path problem is to find a path to send a given amount of data from the...
Cholesky factorization of the augmented system in interior point method for linear programming
Cholesky factorization of the augmented system in interior point method for linear programming
2003
In the normal equations approach in which the ordering and factorization phases are...
Efficient implementation of minimum deficiency ordering
Efficient implementation of minimum deficiency ordering
2003
For fast Cholesky factorization, it is most important to reduce the number of non-zero...
LPAKO: A simplex-based linear programming program
LPAKO: A simplex-based linear programming program
2002
LPAKO is a public domain simplex-based linear programming program which can solve...
On visualization of solutions of linear programming problems
On visualization of solutions of linear programming problems
2002
This paper deals with the visualization method of solutions of the linear programming...
The development of ORED, a Web-based educational system for operations research
The development of ORED, a Web-based educational system for operations research
2002
ORED is a Web-based educational system for operations research. It consists of...
Solving linear systems in interior-point methods
Solving linear systems in interior-point methods
2002
There are two approaches to solve the linear systems in interior-point methods: the...
Generalized sensitivity analysis at a degenerate optimal solution
Generalized sensitivity analysis at a degenerate optimal solution
2000
The methods of sensitivity analysis for linear programming can be classified in two...
LPABO: A program for interior point methods for linear programming
LPABO: A program for interior point methods for linear programming
2000
LPABO (Linear programming Package with the Affine-scaling and the Barrier method using...
An implementation of network optimization system using geographical information systems
An implementation of network optimization system using geographical information systems
2000
By managing not only geographical information but also various kinds of attribute...
Determining the single most vital arc in the maximum flow problem
Determining the single most vital arc in the maximum flow problem
2000
The most vital arc in the maximum flow problem is that arc whose removal results in...
Shortest paths in a network with time-dependent flow speeds
Shortest paths in a network with time-dependent flow speeds
2000
The model and solution of the shortest path problem on time-dependent networks, where...
An ϵ–sensitivity analysis in the primal–dual interior point method
An ϵ–sensitivity analysis in the primal–dual interior point method
1999
This paper presents a method of sensitivity analysis on the cost coefficients and the...
An implementation of preprocessing for interior point methods for linear programming
An implementation of preprocessing for interior point methods for linear programming
1999
We classified preprocessing methods into (1) analytic methods, (2) methods for...
Primal interior dual-simplex method and dual interior primal-simplex method in the general bounded linear programming
Primal interior dual-simplex method and dual interior primal-simplex method in the general bounded linear programming
1999
In this paper, Primal-Interior Dual-Simplex method (PIDS) and Dual-Interior...
An algorithm on three-dimensional loading problem
An algorithm on three-dimensional loading problem
1998
The purpose of this paper is to formulate the three-dimensional loading problem and to...
An efficient ordering method and data structure of the interior point method (putting emphasis on the minimum deficiency ordering)
An efficient ordering method and data structure of the interior point method (putting emphasis on the minimum deficiency ordering)
1996
Ordering plays an important role in solving an LP problem with sparse matrix by the...
Papers per page: