Found 97029 papers in total
Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
1990,
In this paper the authors consider heuristic algorithms for a special case of the generalized bilevel...
Solution differentiability for variational inequalities
1990,
The paper studies solution differentiability properties for variational inequalities and characterizes...
Stable monotone variational inequalities
1990,
Variational inequalities associated with monotone operators (possibly nonlinear and multivalued) and...
Degeneracy problems in mathematical programming and degeneracy graphs
1990,
Degeneracy may cause various computing and other complications in any mathematical programming problem of...
Feasibility and Pareto optimality for multiobjective nonlinear programming problems with fuzzy parameters
1989,
In this paper, the authors focus on multiobjective nonlinear programming problems with fuzzy parameters...
Value functions, domination cones and proper efficiency in multicriteria optimization
1990,
In the absence of a clear ‘objective’ value function, it is still possible in many cases to...
An interactive projection method for multicriteria optimization problems
1990,
Multicriteria optimization problems are addressed in the context of relaxation-projection techniques. The...
The interactive step trade-off method (ISTM) for multiobjective optimization
1990,
A new method to solve multiobjective optimization problems (MOP’s), called the interactive step...
A bibliography on the applications of mathematical programming multiple-objective methods
1990,
This paper gives a bibliography on applications of multiple-objective methods which use no a priori...
An interactive aid for descriptive multiattribute problems
1990,
Certain selection decisions involve attributes of a qualitative nature. Descriptive labels, rather than...
An efficient algorithm for the minimum capacity cut problem
1990,
Given a finite undirected graph with nonnegative edge capacities the minimum capacity cut problem consists...
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
1990,
The authors propose a primal network simplex algorithm for solving the maximum flow problem which chooses...
Continuous-time flows in networks
1990,
The paper considers a class of maximum flow problems formulated in a directed network where the arc flows...
Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases, and extensions
1990,
Consider the following resource allocation problem on a directed acyclic graph (the precedence graph)....
Concurrent stochastic methods for global optimization
1990,
The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables...
Relaxation methods for monotropic programs
1990,
The authors propose a dual descent method for the problem of minimizing a convex, possibly...
A filled function method for finding a global minimizer of a function of several variables
1990,
The concept of a filled function is introduced. The paper constructs a particular filled function and...
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
1990,
This paper gives an O( n) algorithm for a singly constrained convex quadratic program using binary search...
The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
1990,
In this paper the authors consider an augmented Lagrangian method for the minimization of a nonlinear...
On Shapiro’s results in quasidifferential calculus
1990,
Several necessary minimum conditions for quasidifferentiable programming problems are discussed. Some...
On a subproblem of trust region algorithms for constrained optimization
1990,
The paper studies a subproblem that arises in some trust region algorithms for equality constrained...
Assessing a search direction within a truncated-Newton method
1990,
Truncated-Newton methods for nonlinear optimization compute a search direction by approximately solving...
On a discrete nonlinear and nonseparable knapsack problem
1990,
In this paper, a discrete knapsack problem with a convex but nonseparable objective function is...
Convergence properties of trust region methods for linear and convex constraints
1990,
The authors develop a convergence theory for convex and linearly constrained trust region methods which...
Papers per page:

Paper Filter