نتایج جستجو برای: infinite programming

تعداد نتایج: 389921  

2006
András Prékopa

A probabilistic constrained stochastic programming model is formulated, where one term in the objective function, to be minimized, is the maximum of a finite or infinite number of linear functions. The model is reformulated as a finite or semiinfinite disjunctive programming problem. Duality relationships are established for both the original and the convexified problems. Numerical solution tec...

2012
XIAOYAN GAO

The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....

2003
Stijn Heymans Dirk Vermeir

We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infini...

Journal: :Math. Program. 2012
Boris S. Mordukhovich Hung M. Phan

This paper contains selected applications of the new tangential extremal principles and related results developed in [20] to calculus rules for infinite intersections of sets and optimality conditions for problems of semi-infinite programming and multiobjective optimization with countable constraints.

2003
Stijn Heymans Dirk Vermeir

We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infini...

Journal: :SIAM Journal on Optimization 2009
Filiz Gürtuna

In this work, we develop duality of the minimum volume circumscribed ellipsoid and the maximum volume inscribed ellipsoid problems. We present a unified treatment of both problems using convex semi–infinite programming. We establish the known duality relationship between the minimum volume circumscribed ellipsoid problem and the optimal experimental design problem in statistics. The duality res...

2003
Mato Baotić Frank J. Christophersen Manfred Morari

We consider the constrained infinite time optimal control problem for the class of discrete time linear hybrid systems. When a linear performance index is used the infinite time optimal solution is a piecewise affine (PWA) state feedback control law. In this paper we present an algorithm that computes the optimal solution in a computationally efficient manner. It combines a dynamic programming ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید