Results 11 to 20 of about 104,269 (299)
Comparison of Lagrange multipliers for telegraph equations
Ain Shams Engineering Journal, 2018 In this paper, we likewise calculate exact langrage multiplier and it progressively connects to the definite results of telegraph equations. This study witnesses the advantages of Exact Lagrange multipliers and their coupling with Variational Iteration ...
Muhammad Hamid +3 more
doaj +2 more sources
Bounds for lagrange multipliers and optimal points [PDF]
, 1993 We describe two methods for use in constrained optimization problems. One method computes guaranteed bounds on both the Lagrange multipliers and on the location of the optimal points. The other method bounds the Lagrange multipliers only.
Hansen, E.R., Walster, G.W.
core +1 more source
Results in Physics, 2023 According to the tools of linear algebra and calculus of variations, the conservation laws of Boussinesq and generalized Kadomtsev–Petviashvili (gKP) equations are investigated using multipliers and scaling methods. Using the Euler–Lagrange operator, the
Mehdi Jafari +3 more
doaj +1 more source
Inequalities via Lagrange multipliers
International Journal of Mathematics and Mathematical Sciences, 1997 An easy method is obtained to prove many inequalities using Lagrange mutipliers.
W. T. Sulaiman
doaj +1 more source
DYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS [PDF]
Proceedings of the National Academy of Sciences, 1956 Abstract : In this paper it is shown that a combination of the classical Lagrange multiplier formalism and the functional equation technique of dynamic programming enables a number of types of variational problems involving the computation and tabulation of functions of M variables to be treated by computing first sequences of functions of K variables,
openaire +3 more sources
Element-Independent Implementation for Method of Lagrange Multipliers [PDF]
, 2017 Treatment for the non-matching interface is an important computational issue. To handle this problem, the method of Lagrange multipliers including classical and localized versions are the most popular technique.
Gil-Eon Jeong, Sung-Kie Youn, K. C. Park
core +1 more source
A Memetic Lagrangian Heuristic for the 0-1 Multidimensional Knapsack Problem
Discrete Dynamics in Nature and Society, 2013 We present a new evolutionary algorithm to solve the 0-1 multidimensional knapsack problem. We tackle the problem using duality concept, differently from traditional approaches. Our method is based on Lagrangian relaxation.
Yourim Yoon, Yong-Hyuk Kim
doaj +1 more source
New Lagrange Multipliers for the Blind Adaptive Deconvolution Problem Applicable for the Noisy Case
Entropy, 2016 Recently, a new blind adaptive deconvolution algorithm was proposed based on a new closed-form approximated expression for the conditional expectation (the expectation of the source input given the equalized or deconvolutional output) where the output ...
Monika Pinchas
doaj +1 more source
Optimal control for a chemotaxis–haptotaxis model in two space dimensions
Boundary Value Problems, 2022 This paper deals with a chemotaxis–haptotaxis model which described the process of cancer invasion on the macroscopic scale. We first explore the global-in-time existence and uniqueness of a strong solution.
Hui Tang, Yunfei Yuan
doaj +1 more source
Dualities in Nonholonomic Optimization
Annals of the West University of Timisoara: Mathematics and Computer Science, 2016 This article deals with optimizing problems whose restrictions are nonholonomic. The central issue relates to dual nonholonomic programs (what they mean and how they are solved?) when the nonholonomic constraints are given by Pfaff equations.
Udrişte Constantin +3 more
doaj +1 more source