Abstract
In this paper, we consider problems of mathematical programming with nonsmoothconstraints of equality type given by quasidifferentiable functions. By using thetechnique of upper convex approximations, developed by B. N. Pshenichy, necessary conditionsof extremum for such problems are established. The Lagrange multipliers signsare specified by virtue of the fact that one can construct whole familers of upper convexapproximations for quasidifferentiable function and thus the minimum points in such extremalproblems are characterized more precisely. Also the simplest problem of calculusof variations with free right hand side is considered, where the left end of the trajectorystarts on the boundary of the convex set. The transversality condition at the left end of thetrajectory is improved provided sertain sufficient conditons hold
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call