Lagrangian duality for a class of infinite programming problems
From MaRDI portal
Cites work
- A class of continuous linear programming problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- An Extension of the Nonhomogeneous Farkas Theorem
- Continuous programming. I: Linear objectives
- Generalizations of Farkas’ Theorem
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3313523 (Why is no real title available?)
- Nonlinear Programming in Banach Space
- Nonlinear programming in locally convex spaces
- Symmetric Duality for Continuous Linear Programs
Cited in
(7)- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Some remarks concerning duality for continuous-time programming problems
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS
- Continuous-time generalized fractional programming
- Continuous-time multiobjective fractional programming
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
This page was built for publication: Lagrangian duality for a class of infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3905100)