Journal: Journal of Optimization Theory and Applications

Found 810 papers in total
Worst-case tolerance design and quality assurance via genetic algorithms
Worst-case tolerance design and quality assurance via genetic algorithms
2002,
In many engineering designs, several components are often placed together in a...
On the conversion of optimization problems with max–min constraints to standard optimization problems
On the conversion of optimization problems with max–min constraints to standard optimization problems
2001,
In this note, we obtain a sufficient and necessary condition for a point to be a local...
Minimization algorithms based on supervisor and searcher cooperation
Minimization algorithms based on supervisor and searcher cooperation
2001,
In the present work, we explore a general framework for the design of new minimization...
Parallel interior-point method for linear and quadratic programs with special structure
Parallel interior-point method for linear and quadratic programs with special structure
2001,
This paper concerns the use of iterative solvers in interior-point methods for linear...
Efficient solution concepts and their relations in stochastic multiobjective programming
Efficient solution concepts and their relations in stochastic multiobjective programming
2001,
In this work, different concepts of efficient solutions to problems of stochastic...
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
2001,
In this paper, we study the chaotic mappings of complete multipartite graphs. The...
Feedback competitive advertising strategies with a general objective function
Feedback competitive advertising strategies with a general objective function
2001,
We introduce a general objective function, which incorporates competitive situations,...
Cooperative advertising in a marketing channel
Cooperative advertising in a marketing channel
2001,
This paper examines dynamic advertising and promotion strategies in a marketing...
Optimal evasion from a pursuer with delayed information
Optimal evasion from a pursuer with delayed information
2001,
A class of prescribed duration pursuit–evasion problems with first-order...
Convergence properties of two-stage stochastic programming
Convergence properties of two-stage stochastic programming
2000,
This paper considers a procedure of two-stage stochastic programming in which the...
Duality bound method for the general quadratic programming problem with quadratic constraints
Duality bound method for the general quadratic programming problem with quadratic constraints
2000,
The purpose of this article is to develop a branch-and-bound algorithm using duality...
Peeling layers of an onion: Inventory model with multiple delivery modes and forecast updates
Peeling layers of an onion: Inventory model with multiple delivery modes and forecast updates
2001,
This paper is concerned with a periodic review inventory system with fast and slow...
Inner approximation method for a reverse convex programming problem
Inner approximation method for a reverse convex programming problem
2000,
In this paper, we consider a reverse convex programming problem constrained by a...
Alternative second-order conditions in constrained optimization
Alternative second-order conditions in constrained optimization
2001,
New formulations are given for the second-order necessary conditions in parameter...
Dynamic optimization for reachability problems
Dynamic optimization for reachability problems
2001,
This paper uses dynamic programming techniques to describe reach sets and related...
The concept of proper solution in linear programming
The concept of proper solution in linear programming
2000,
In this paper, we study the optimal solutions of a dual pair of linear programming...
On sensitivity in linear multiobjective programming
On sensitivity in linear multiobjective programming
2000,
In this paper, we prove that, if the data of a linear multiobjective programming...
Complexity of the gravitational method for linear programming
Complexity of the gravitational method for linear programming
2001,
In the gravitational method for linear programming, a particle is dropped from an...
On convergence of the simplicial branch-and-bound algorithm based on omega-subdivisions
On convergence of the simplicial branch-and-bound algorithm based on omega-subdivisions
2000,
The problem of minimizing a concave function over a polytope is considered. The...
Finiteness result for the simplicial branch-and-bound algorithm based on omega-subdivisions
Finiteness result for the simplicial branch-and-bound algorithm based on omega-subdivisions
2000,
The question of the finiteness of simplicial branch-and-bound algorithms employing...
Duality of nonscalarized multiobjective linear programs: Dual balance, level sets, and dual clusters of optimal vectors
Duality of nonscalarized multiobjective linear programs: Dual balance, level sets, and dual clusters of optimal vectors
2001,
A new concept of duality is proposed for multiobjective linear programs. It is based...
Counterexample and optimality conditions in differentiable multiobjective programming
Counterexample and optimality conditions in differentiable multiobjective programming
2001,
Recently, sufficient optimality theorems for (weak) Pareto-optimal solutions of a...
Optimal prioritized infeasibility handling in model predictive control: Parametric preemptive multiobjective linear programming approach
Optimal prioritized infeasibility handling in model predictive control: Parametric preemptive multiobjective linear programming approach
2001,
All practical implementations of model-based predictive control (MPC) require a means...
On convergence of minimization methods: Attraction, repulsion, and selection
On convergence of minimization methods: Attraction, repulsion, and selection
2000,
In this paper, we revisit the convergence properties of the iteration process...
Papers per page: