Search results for "CONSTRAINT"

Using the Theory of Regular Functions to Formally Prove the ε-Optimality of Discretized Pursuit Learning Algorithms

2014

Learning Automata LA can be reckoned to be the founding algorithms on which the field of Reinforcement Learning has been built. Among the families of LA, Estimator Algorithms EAs are certainly the fastest, and of these, the family of Pursuit Algorithms PAs are the pioneering work. It has recently been reported that the previous proofs for e-optimality for all the reported algorithms in the family of PAs have been flawed. We applaud the researchers who discovered this flaw, and who further proceeded to rectify the proof for the Continuous Pursuit Algorithm CPA. The latter proof, though requires the learning parameter to be continuously changing, is, to the best of our knowledge, the current …

Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems

1994

In this paper, we present several constraint qualifications, and we show that these conditions guarantee the nonvacuity and the boundedness of the Lagrange multiplier sets for general nondifferentiable programming problems. The relationships with various constraint qualifications are investigated.

?-constraint with respect to a Fitting class

1986

The Effects of Auditor Affinity for Client and Perceived Client Pressure on Auditor Proposed Adjustments

2017

ABSTRACT This paper examines how auditors' judgments about accounting policies may differ when experiencing different levels of affinity for client management and facing different levels of pressure from client management. The theory of motivated reasoning is employed to analyze the effects of these two factors that should lead individual auditors to adopt as a directional goal the acceptance of client management's aggressive accounting. Accordingly, we predict and find that auditors experiencing greater client affinity and facing explicit client pressure suggest lower adjustments to clients' aggressive accounting, consistent with motivated reasoning's goal-related predictions. But our stud…

Religion, Empathy, and Cooperation: A Case Study in the Promises and Challenges of Modeling and Simulation

2019

The Cognitive Science of Religion (CSR) is developing a sophisticated naturalistic account of religion, grounded in empirical research. However, there are limitations to establishing an empirical basis for theories about religion’s role in human evolution. Computer modeling and simulation offers a way to address this experimental constraint. A case study in this approach was conducted on a key theory within CSR that recently has come under serious challenge: the Supernatural Punishment Hypothesis, which posits religion facilitated the shift from small, homogeneous social units to large, complex societies. It has been proposed that incorporating empathy as a proximate mechanism for cooperati…

Flexible Estimation of Heteroskedastic Stochastic Frontier Models via Two-step Iterative Nonlinear Least Squares

2019

Despite its importance, the monotonicity condition is typically overlooked in stochastic frontier analysis. This article illustrates a straightforward and useful method for the estimation of semiparametric stochastic frontier models imposing such constraint and incorporating exogenous inefficiency effects exploiting the scaling property. An iterative estimation algorithm based on nonlinear least squares is developed and the behavior of the proposed procedure is investigated through a set of Monte Carlo experiments comparing its finite sample properties with those of available alternatives. The simulation results highlight very good performance of the new algorithm which outperforms the comp…

Constraint Management in Engineering of Complex Information Systems

2009

We propose to build an engineering environment for information systems by using metamodels, OCL and symbolic model checkers to manage  constraints. Our proposal is based on a definition of constraints as 3D spaces with  dimensions corresponding to UML diagrams, constructs, and abstraction levels. We show how such environments can help with engineering quality complex systems by allowing to lift up a part of constraint verifications.

An optimality test for semi-infinite linear programming

1992

In this paper we present a test to characterize the optimal solutions for the continuous semi-infinite linear programming problem. This optimality characterization is a condition of Kuhn–Tucker type. The resolution of a linear program permits to check the optimality of a feasible point,to detect the unboundedness of the problem and to find descent directions. We give some illustrative examples. We show that the local Mangasarian–Fromovitz constraint qualification is almost equivalent to Slater qualification for this problem. Furthermore, it follows from our study that this optimality condition is always necessary for a wide class of semi-infinite linear programming problems

Exact and Approximate Algorithms for Two–Criteria Topological Design Problem of WAN with Budget and Delay Constraints

2004

This paper studies the problem of designing wide area networks (WAN). In the paper the two-criteria topology assignment problem with two constraints is considered. The goal is select flow routes, channel capacities and network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to the budget constraint and delay constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also the approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.

The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results

2003

The problem is concerned with designing of wide area networks (WAN). The problem consists in selection of flow routes, channel capacities and wide area network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to delay constraint. The problem is NP complete. Then, the branch and bound method is used to construct the exact algorithm. Lower bound of the criterion function is proposed. Computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.