Country: China

Found 1356 papers in total
Nonconical nonsmooth multiobjective programming: Optimality conditions and duality theorems
Nonconical nonsmooth multiobjective programming: Optimality conditions and duality theorems
1998,
This paper deals with the nonconical nonsmooth multiobjective programming problem. The...
A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming
A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming
1998,
Major efficiency is an efficiency theory of multiobjective programming, which is based...
A new polynomial-time algorithm for LP
A new polynomial-time algorithm for LP
1996,
In this paper, the authors present a new polynomial-time algorithm for linear...
Several sufficient conditions for the global convergence of the Davidon–Fletcher–Powell algorithm
Several sufficient conditions for the global convergence of the Davidon–Fletcher–Powell algorithm
1998,
In this paper, for unconstrained optimization problems with uniformly convex objective...
Predictor–corrector method for nonlinear complementarity problem
Predictor–corrector method for nonlinear complementarity problem
1997,
Ye et al . proved that the predictor–corrector method proposed by Mizuno et al ....
An extension of predictor–corrector algorithm to a class of convex separable program
An extension of predictor–corrector algorithm to a class of convex separable program
1997,
The predictor–corrector algorithm for linear programming, presented by Mizuno et...
A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
1998,
In this paper, the problem of minimizing a convex function subject to general linear...
A modified projection and contraction method for a class of linear complementarity problems
A modified projection and contraction method for a class of linear complementarity problems
1996,
We have proposed an iterative projection and contraction (PC) method for a class of...
A modified bisection simplex method for linear programming
A modified bisection simplex method for linear programming
1996,
In this paper, a modification of the bisection simplex method is made for more general...
Minimum principles and error bounds for monotone linear complementarity problems (I)
Minimum principles and error bounds for monotone linear complementarity problems (I)
1995,
The main results in this paper (I) can be summarized into following two parts: (1) A...
Minimum principles and error bounds for monotone linear complementarity problems (II)
Minimum principles and error bounds for monotone linear complementarity problems (II)
1995,
Another type of minimum principle is presented for a monotone linear complementarity...
A projective method of the approximate center for semidefinite programming
A projective method of the approximate center for semidefinite programming
1998,
Many problems in mathematical programming can be modelled as semidefinite programming....
A simplex–interior algorithm for solving linear programming
A simplex–interior algorithm for solving linear programming
1996,
According to the simplex method and long step path following algorithm, the author...
The optimality conditions and properties of linear multilevel programming problem
The optimality conditions and properties of linear multilevel programming problem
1998,
In this paper a model for the linear multilevel programming problem is presented,...
A maximum entropy method for linear programming
A maximum entropy method for linear programming
1995,
In this paper, an ε-optimal solution to a linear programming problem in Karmarkar...
A generalized predictor–corrector linear programming algorithm
A generalized predictor–corrector linear programming algorithm
1995,
According to the homogeneous and self-dual linear programming model and the reduced...
An optimal basis identification criterion for interior-point linear programming algorithms
An optimal basis identification criterion for interior-point linear programming algorithms
1996,
In this paper, the properties of an indicator vector for identifying an optimal basis...
A new algorithm for pure 0–1 linear programs with inequality constraints
A new algorithm for pure 0–1 linear programs with inequality constraints
1996,
More and more attention has been paid to the Hopfield neural network (HNN) algorithm...
A hybrid polynomial algorithm for linear programming
A hybrid polynomial algorithm for linear programming
1996,
In this paper, the authors propose a ‘long step’ double scaling algorithm....
A cutting plane method for linear bilevel programs
A cutting plane method for linear bilevel programs
1998,
In this paper, a cutting plane method is presented for solving the linear BLPP. An...
Sensitivity analysis in bilevel linear programming
Sensitivity analysis in bilevel linear programming
1998,
This paper studies sensitivity analysis of bilevel linear programming. Two cases of...
A projective method of the approximate center for semidefinite programming
A projective method of the approximate center for semidefinite programming
1998,
Many problems in mathematical programming can be modelled as semidefinite programming....
Global efficiency in multiobjective optimization
Global efficiency in multiobjective optimization
1995,
In this short technical note, the authors present five sufficient conditions to...
Duality for multiobjective programming with G(F,ρ) convexity
Duality for multiobjective programming with G(F,ρ) convexity
1998,
In this paper, under the G(F,ρ) convexity assumptions on the function involved,...
Papers per page: