Lagrangian duality for a class of infinite programming problems
From MaRDI portal
Publication:3905100
DOI10.1080/01630568008816073zbMath0456.90087OpenAlexW1989819997MaRDI QIDQ3905100
Publication date: 1980
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568008816073
first-order necessary conditionsconvex conedual conesstrong dualityLagrangian dualityinfinite programmingcontinuous time programmingKuhn-Tucker type conditionsgeneralized Farkas' theorem
Related Items (7)
Some remarks concerning duality for continuous-time programming problems ⋮ OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS ⋮ Optimality conditions and duality for a class of continuous-time generalized fractional programming problems ⋮ Continuous-time multiobjective fractional programming ⋮ Continuous-time generalized fractional programming ⋮ Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- A class of continuous linear programming problems
- Continuous programming. I: Linear objectives
- Nonlinear programming in locally convex spaces
- An Extension of the Nonhomogeneous Farkas Theorem
- Generalizations of Farkas’ Theorem
- Nonlinear Programming in Banach Space
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Symmetric Duality for Continuous Linear Programs
This page was built for publication: Lagrangian duality for a class of infinite programming problems