Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Werner Oettli is active.

Publication


Featured researches published by Werner Oettli.


Journal of Optimization Theory and Applications | 1999

Time-dependent traffic equilibria

Patrizia Daniele; Antonino Maugeri; Werner Oettli

We consider the existence, characterization, and calculation of equilibria in transportation networks, when the route capacities and demand requirements depend on time. The problem is situated in a Banach space setting and formulated in terms of a variational inequality.


Mathematical Methods of Operations Research | 1997

A Generalization of Vectorial Equilibria

Qamrul Hasan Ansari; Werner Oettli; Dirk Schläger

A generalized form of vectorial equilibria is proposed, and, using an abstract monotonicity condition, an existence result is demonstrated.


Bulletin of The Australian Mathematical Society | 1993

Equivalents of Ekeland's principle

Werner Oettli; Michel Théra

In this note we present a new result which is equivalent to the celebrated Ekelands variational principle, and a set of implications which includes a new non-convex minimisation principle due to Takahashi.


Mathematical Methods of Operations Research | 1998

Existence of equilibria for monotone multivalued mappings

Werner Oettli; Dirk Schläger

Abstract. Using a particular kind of pseudomonotonicity for multivalued mappings, an existence result is proved for equilibria, variational inequalities, and a combination of both.


Journal of Global Optimization | 1991

Mathematical programs with a two-dimensional reverse convex constraint

Phan Thien Thach; Rainer E. Burkard; Werner Oettli

We consider the problem min {f(x): x ∈ G, T(x) ∉ int D}, where f is a lower semicontinuous function, G a compact, nonempty set in ℝn, D a closed convex set in ℝ2 with nonempty interior and T a continuous mapping from ℝn to ℝ2. The constraint T(x) ∉ int D is a reverse convex constraint, so the feasible domain may be disconnected even when f, T are affine and G is a polytope. We show that this problem can be reduced to a quasiconcave minimization problem over a compact convex set in ℝ2 and hence can be solved effectively provided f, T are convex and G is convex or discrete. In particular we discuss a reverse convex constraint of the form 〈c, x〉 · 〈d, x〉≤1. We also compare the approach in this paper with the parametric approach.


Journal of Optimization Theory and Applications | 1991

Method for minimizing a convex-concave function over a convex set

L. D. Muu; Werner Oettli

A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. The minimization of a DC-function is a special case, where the subproblems connected with the bounding operation can be solved effectively.


Mathematical Programming | 1975

The theorem of the alternative, the key-theorem, and the vector-maximum problem

R. Lehmann; Werner Oettli

Consequences of a general formulation of the theorem of the alternative are exploited.


Mathematics of Operations Research | 1994

Theorems of the alternative and duality for inf-sup problems

Joachim Gwinner; Werner Oettli

The duality theory of convex mathematical programming is extended to inf-sup problems. To this end a new, general inf-sup theorem for two different convexlike, respectively concavelike payoff functions is established under an abstract closedness assumption, thus avoiding the usual compactness requirement. This closedness assumption is then made more concrete; in particular for the partially homogeneous programs under study, regularity conditions of Karlin and Slater type are discussed. Finally, related theorems of the alternative as well as a result of Hahn-Banach type are derived, where the usual bilinear form is replaced by a more general coupling function.


The Journal of The Australian Mathematical Society. Series B. Applied Mathematics | 1999

Solvability of generalized nonlinear symmetric variational inequalities

Samir Adly; Werner Oettli

This paper deals with the study of a general class of nonlinear variational inequalities. An existence result is given, and a perturbed iterative scheme is analyzed for solving such problems.


Mathematical Programming | 1994

A Farkas lemma for difference sublinear systems and quasidifferentiable programming

B. M. Glover; V. Jeyakumar; Werner Oettli

A new generalized Farkas theorem of the alternative is presented for systems involving functions which can be expressed as the difference of sublinear functions. Various other forms of theorems of the alternative are also given using quasidifferential calculus. Comprehensive optimality conditions are then developed for broad classes of infinite dimensional quasidifferentiable programming problems. Applications to difference convex programming and infinitely constrained concave minimization problems are also discussed.

Collaboration


Dive into the Werner Oettli's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Le Dung Muu

University of Mannheim

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

V. Jeyakumar

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Do Van Luu

Vietnam Academy of Science and Technology

View shared research outputs
Top Co-Authors

Avatar

Nguyen Dong Yen

Vietnam Academy of Science and Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge