On sufficiency and duration in nonsmooth multiobjective programming.

DOI10.1007/BF03398527zbMath1141.90526OpenAlexW2772907792MaRDI QIDQ2468559

Shashi Kant Mishra

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398527

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15)

Related Items

Some nondifferentiable multiobjective programming problems, Nondifferentiable multiobjective programming under generalized \(d\)-univexity

Cites Work

• Unnamed Item
• Unnamed Item
• Duality theorem of nondifferentiable convex multiobjective programming
• Sufficiency and duality in nondifferentiable multiobjective programming
• Proper efficiency and the theory of vector maximization
• Optimization and nonsmooth analysis
• Necessary and sufficient conditions in constrained optimization
• Invex functions and constrained local minima
• On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
• Duality without constraint qualification for multiobjective programming
• On generalised convex mathematical programming
• On generalised convex multi-objective nonsmooth programming