In this paper we study necessary and sufficient optimality conditions for a set-valued optimization problem. Convexity of the multifunction and the domain is not required. A definition of K -approximating multifunction is introduced. This multifunction is the differentiability notion applied to the
Optimality conditions for a relaxed layout optimization problem
β Scribed by Eric Bonnetier; Carlos Conca
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 396 KB
- Volume
- 327
- Category
- Article
- ISSN
- 0764-4442
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The problem of the containment of the trajectories of a differential inclusion in a specified closed set in a nuvrimum time interval [ 1-4], which is a probleta of optimal control with phase constraints, is considered. Sufficient conditions for optimality are obtained in the form of ammdmum principl
In this paper, we present pth-order necessary conditions for optimality for an optimization problem with inequality constraints in the finite-dimensional spaces. Models of this type arise as the discretization of optimal control problems, calculus of variations problems, and other problems. The pape
This paper deals with the differentiable vector optimization problems in the locally convex topological vector spaces. We first establish a theorem of the alternative of the Gordan type. Finally, the optimality conditions of the Kuhnα Tucker type are obtained.