Log in

Relevant bibliographies by topics / Equality and inequality constraints

Contents

Journal articles

Academic literature on the topic 'Equality and inequality constraints'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Equality and inequality constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Equality and inequality constraints"

1

Revesz, Peter Z. "The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases." International Journal of Algebra and Computation 08, no. 05 (1998): 553–73. http://dx.doi.org/10.1142/s0218196798000260.

Full text

Abstract:

In the database framework of Kanellakis et al. it was argued that constraint query languages should meet the closed-form requirement, that is, queries should take as input constraint databases and give as output constraint databases that use the same type of constraints. This paper shows that the closed-form requirement can be met for Datalog queries with Boolean equality constraints with double exponential time-complete data complexity, for Datalog queries with precedence and monotone inequality constraints in triple exponential-time data complexity. A closed-form evaluation is also shown for

APA, Harvard, Vancouver, ISO, and other styles

2

Gao, Xiangyu, Xian Zhang, and Yantao Wang. "A Simple Exact Penalty Function Method for Optimal Control Problem with Continuous Inequality Constraints." Abstract and Applied Analysis 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/752854.

Full text

Abstract:

We consider an optimal control problem subject to the terminal state equality constraint and continuous inequality constraints on the control and the state. By using the control parametrization method used in conjunction with a time scaling transform, the constrained optimal control problem is approximated by an optimal parameter selection problem with the terminal state equality constraint and continuous inequality constraints on the control and the state. On this basis, a simple exact penalty function method is used to transform the constrained optimal parameter selection problem into a sequ

APA, Harvard, Vancouver, ISO, and other styles

3

Mullins, S. H., W. W. Charlesworth, and D. C. Anderson. "A New Method for Solving Mixed Sets of Equality and Inequality Constraints." Journal of Mechanical Design 117, no. 2A (1995): 322–28. http://dx.doi.org/10.1115/1.2826142.

Full text

Abstract:

Presented is a general method for solving sets of nonlinear constraints that include inequalities. Inequality constraints are common in engineering design problems, such as kinematic synthesis. The proposed method uses a modified Newton’s method and introduces a slack variable and a slack constraint to convert each inequality into an equality constraint. Singular value decomposition is used to find the pseudo-inverse of the Jacobian at each iteration. Benefits of this method are that constraint scaling is not an issue and that the method often fails gracefully for inconsistent constraint sets

APA, Harvard, Vancouver, ISO, and other styles

4

Gupta, Rekha, and Manjari Srivastava. "Constraint qualifications in nonsmooth multiobjective optimization problem." Filomat 31, no. 3 (2017): 781–97. http://dx.doi.org/10.2298/fil1703781g.

Full text

Abstract:

A multiobjective optimization problem (MOP) with inequality and equality constraints is considered where the objective and inequality constraint functions are locally Lipschitz and equality constraint functions are differentiable. Burachik and Rizvi [J. Optim. Theory Appl. 155, 477-491 (2012)] gave Guignard and generalized Abadie regularity conditions for a differentiable programming problem and derived Karush-Kuhn-Tucker (KKT) type necessary optimality conditions. In this paper, we have defined the nonsmooth versions of Guignard and generalized Abadie regularity conditions given by Burachik a

APA, Harvard, Vancouver, ISO, and other styles

5

Cheng, Haifang, Weilai Huang, and Jianhu Cai. "Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming." Journal of Applied Mathematics 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/726296.

Full text

Abstract:

In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality. In this paper, an FFLP problem with fuzzy equality constraints is discussed, and a method for solving this FFLP problem is also proposed. We first transform the fuzzy equality constraints into the crisp inequality ones using the measure of the similarity, which is interpreted as the feasibility degree of constrains, and then transform the fuzzy objective into two crisp objectives b

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Mei Xia. "A Class of Augumented Lagrangian Function for Nonlinear Programming." Advanced Materials Research 271-273 (July 2011): 1955–60. http://dx.doi.org/10.4028/www.scientific.net/amr.271-273.1955.

Full text

Abstract:

In this paper, we discuss an exact augumented Lagrangian functions for the non- linear programming problem with both equality and inequality constraints, which is the gen- eration of the augmented Lagrangian function in corresponding reference only for inequality constraints nonlinear programming problem. Under suitable hypotheses, we give the relation- ship between the local and global unconstrained minimizers of the augumented Lagrangian function and the local and global minimizers of the original constrained problem. From the theoretical point of view, the optimality solution of the nonline

APA, Harvard, Vancouver, ISO, and other styles

7

Husain, Iqbal, and Vikas K. Jain. "Nondifferentiable Multiobjective Programming with Equality and Inequality Constraints." Open Journal of Modelling and Simulation 01, no. 02 (2013): 7–13. http://dx.doi.org/10.4236/ojmsi.2013.12002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Das, A. K., R. Jana, and Deepmala. "Invex programming problems with equality and inequality constraints." Transactions of A. Razmadze Mathematical Institute 172, no. 3 (2018): 361–71. http://dx.doi.org/10.1016/j.trmi.2018.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Feppon, F., G. Allaire, and C. Dapogny. "Null space gradient flows for constrained optimization with applications to shape optimization." ESAIM: Control, Optimisation and Calculus of Variations 26 (2020): 90. http://dx.doi.org/10.1051/cocv/2020015.

Full text

Abstract:

The purpose of this article is to introduce a gradient-flow algorithm for solving equality and inequality constrained optimization problems, which is particularly suited for shape optimization applications. We rely on a variant of the Ordinary Differential Equation (ODE) approach proposed by Yamashita (Math. Program. 18 (1980) 155–168) for equality constrained problems: the search direction is a combination of a null space step and a range space step, aiming to decrease the value of the minimized objective function and the violation of the constraints, respectively. Our first contribution is t

APA, Harvard, Vancouver, ISO, and other styles

10

Teo, K. L., and K. H. Wong. "Nonlinearly constrained optimal control problems." Journal of the Australian Mathematical Society. Series B. Applied Mathematics 33, no. 4 (1992): 517–30. http://dx.doi.org/10.1017/s0334270000007207.

Full text

Abstract:

AbstractIn a paper by Teo and Jennings, a constraint transcription is used together with the concept of control parametrisation to devise a computational algorithm for solving a class of optimal control problems involving terminal and continuous state constraints of inequality type. The aim of this paper is to extend the results to a more general class of constrained optimal control problems, where the problem is also subject to terminal equality state constraints. For illustration, a numerical example is included.

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!