This paper introduces the Lagrangian relaxation method to solve multiobjective optimization problems. It is often required use appropriate technique determine multipliers in that leads finding optimal solution problem. Our analysis aims find a suitable generate multipliers, and later these are used Multiobjective We propose search-based Lagrange multipliers. In our paper, we choose well-known s...

This paper analyzes sequences generated by infeasible interior point methods. In convex and nonconvex settings, we prove that moving the primal feasibility at the same rate as complementarity will ensure that the Lagrange multiplier sequence will remain bounded, provided the limit point of the primal sequence has a Lagrange multiplier, without constraint qualification assumptions. We also show ...

An extended variational iteration method within the local fractional derivative is introduced for first time, where two Lagrange multipliers are adopted. Moreover, sufficient conditions convergence of new also established.

In this paper, a new identification of the Lagrange multipliers by means of the Sumudu transform, is employed to  btain a quick and accurate solution to the fractional Black-Scholes equation with the initial condition for a European option pricing problem. Undoubtedly this model is the most well known model for pricing financial derivatives. The fractional derivatives is described in Caputo sen...

The existence of generalized Lagrange multipliers is proved for a class evolution problems linear differential operators various types subject to constraints on the derivatives. Those and respective solutions are stable vanishing coercive parameter naturally associated with variational inequalities time-dependent convex sets gradient type. These results applied sandpile problem, superconductivi...