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

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

2014
Daniel Ruiz-Vega Louis Wehenkel Damien Ernst Alejandro Pizano-Martínez Claudio R. Fuerte-Esquivel S. C. Savulescu

C. R. Fuerte-Esquivel Universidad Michoacana de San Nicolás de Hidalgo, Morelia, Mexico Abstract A general approach to real-time transient stability control is described, yielding various complementary techniques: pure preventive, open-loop emergency, and closed-loop emergency controls. Recent progress in terms of a global transient stability-constrained optimal power flow is presented, yieldin...

Journal: :SIAM Journal on Optimization 2006
Chek Beng Chua

The notion of weighted centers is essential in V-space interior-point algorithms for linear programming. Although there were some successes in generalizing this notion to semidefinite programming via weighted center equations, we still do not have a generalization that preserves two important properties — 1) each choice of weights uniquely determines a pair of primal-dual weighted centers, and ...

2015
M. Saraj N. Safaei

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent to...

2013
Sergio Castro Kim Mens Paulo Moura

While object-oriented programming languages are good at modelling real-world concepts and benefit from rich libraries and developer tools, logic programming languages are well suited for declaratively solving computational problems that require knowledge reasoning. Nontrivial declarative applications could take advantage of the modelling features of object-oriented programming and of the rich s...

2009
Longquan Yong

We formulate the NP-hard absolute value equation as linear complementary problem when the singular values of A exceed one, and we proposed a mixed integer linear programming method to absolute value equation problem. The effectiveness of the method is demonstrated by its ability to solve random problems.

This study deals with the effects of a supply chain (SC) with single product, multiple retailers and a manufacturer, where the manufacturer(he) produces lotsize of the product that contains a random portion of imperfect quality item. The imperfect quality products are sold in a secondary shop. The new contribution of this paper is a new non-linear demand function. Demand of the end customers va...

ژورنال: علوم آب و خاک 1999
کیخا, احمدعلی, زیبایی, منصور , سلطانی, غلامرضا ,

The production and acreage of corn in Iran and in Fars Province, in particular, are expanding at an increasing rate. The impacts of this event was studied by a risk programming model (MOTAD). The results indicated that the optimal cropping patterns with corn had less variance than the optimal patterns without corn in all income levels. The results also showed that with the introduction of corn ...

کیخا, احمدعلی, زیبایی, منصور , سلطانی, غلامرضا ,

The production and acreage of corn in Iran and in Fars Province, in particular, are expanding at an increasing rate. The impacts of this event was studied by a risk programming model (MOTAD). The results indicated that the optimal cropping patterns with corn had less variance than the optimal patterns without corn in all income levels. The results also showed that with the introduction of corn ...

Journal: :Annals OR 2004
Brahim Hnich Zeynep Kiziltan Ian Miguel Toby Walsh

We study a balanced academic curriculum problem and an industrial steel mill slab design problem. These problems can be modelled in different ways, using both Integer Linear Programming (ILP) and Constraint Programming (CP) techniques. We consider the utility of each model. We also propose integrating the models to create hybrids that benefit from the complementary strengths of each model. Expe...

1993
Benjamin C. Pierce

Intersection types and bounded quantiication are complementary extensions of a rst-order programming language with subtyping. We deene a typed-calculus combining these extensions, illustrate its unusual properties, and develop basic proof-theoretic and semantic results leading to algorithms for subtyping and typechecking.

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

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