Country: Netherlands

Found 18376 papers in total
Second-order epi-derivatives of composite functionals
Second-order epi-derivatives of composite functionals
2001,
We compute two-sided second-order epi-derivatives for certain composite functionals f...
Upper subderivatives and generalized gradients of the marginal function of a non-Lipschitzian program
Upper subderivatives and generalized gradients of the marginal function of a non-Lipschitzian program
2001,
We obtain an upper bound for the upper subderivative of the marginal function of an...
Contingent derivatives of implicit (multi-) functions and stationary points
Contingent derivatives of implicit (multi-) functions and stationary points
2001,
For an implicit multifunction Φ( p ) defined by the generally nonsmooth equation F...
Well-posedness and optimization under perturbations
Well-posedness and optimization under perturbations
2001,
Estimates of the size of sets of approximate solutions are obtained for well-posed...
Log-sigmoid multipliers method in constrained optimization
Log-sigmoid multipliers method in constrained optimization
2001,
In this paper we introduced and analyzed the Log-Sigmoid (LS) multipliers method for...
A robust global optimization method based on simulated annealing
A robust global optimization method based on simulated annealing
2000,
A robust global optimization algorithm based on simulated annealing is proposed in...
Co-evolutionary hybrid differential evolution for mixed-integer optimization problems
Co-evolutionary hybrid differential evolution for mixed-integer optimization problems
2001,
Evolutionary algorithms are promising candidates for obtaining the global optimum....
Domain approximation and deterministic progression in genetic crossover
Domain approximation and deterministic progression in genetic crossover
2001,
The fitness difference between two strings is usually neglected by most Genetic...
Adaptive response surface method – a global optimization scheme for approximation-based design problems
Adaptive response surface method – a global optimization scheme for approximation-based design problems
2001,
For design problems involving computation-intensive analysis or simulation processes,...
Engineering design optimization using a swarm with an intelligent information sharing among individuals
Engineering design optimization using a swarm with an intelligent information sharing among individuals
2001,
In this paper a new swarm algorithm for single objective design optimization problems...
Function optimization by using genetic algorithms with individuals having different birth and survival rates
Function optimization by using genetic algorithms with individuals having different birth and survival rates
2001,
This paper proposes an effective approach to function optimisation using the concept...
On the condition numbers for polyhedra in Karmarkar's form
On the condition numbers for polyhedra in Karmarkar's form
1999,
We present formulations of two condition measures (one for linear programming (LP) due...
Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions
Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions
1999,
Konno, introduced a piecewise linear objective function for portfolio optimization to...
New facets for the set packing polytope
New facets for the set packing polytope
2000,
We introduce a family of graphs, named grilles, and a facet of the set packing...
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
2000,
This paper shows that the minimum ratio canceling algorithm of Wallacher (and a faster...
A Tabu search heuristic for the generalized assignment problem
A Tabu search heuristic for the generalized assignment problem
2001,
This paper considers the generalized assignment problem (GAP). It is a well-known...
Why the logarithmic barrier function in convex and linear programming?
Why the logarithmic barrier function in convex and linear programming?
2000,
We provide a simple interpretation of the use of the logarithmic barrier function in...
Envelope theorems in dynamic programming
Envelope theorems in dynamic programming
2001,
The envelope theorem is a statement about derivatives along an optimal trajectory. In...
Comments on properties of the minmax solutions in goal programming
Comments on properties of the minmax solutions in goal programming
2001,
This note discusses the properties of solutions generated by the minmax models of goal...
A tight upper bound for the k-partition problem on ideal sets
A tight upper bound for the k-partition problem on ideal sets
1999,
This paper analyzes an approximation algorithm (Graham's LPT rule) for the NP-complete...
Stability in linear programming models: An index set approach
Stability in linear programming models: An index set approach
2001,
Arbitrary perturbations of arbitrary coefficients in linear programming models on the...
A note on backward error analysis for generalized linear complementarity problems
A note on backward error analysis for generalized linear complementarity problems
2001,
This note extends the classical Oettli–Prager theorem to generalized linear...
An independent variable controlled grey fuzzy linear programming approach for waste flow allocation planning
An independent variable controlled grey fuzzy linear programming approach for waste flow allocation planning
2000,
This paper proposes an independent variable controlled grey fuzzy linear programming...
A logic-based modeling of resource consumption and production
A logic-based modeling of resource consumption and production
1998,
Proposed are: (1) a logic modeling system called logic of resource, inspired by linear...
Papers per page: