On duality and the maximum principle for continuous linear programming problems
From MaRDI portal
Using a decomposition procedure and duality technique the author - extending Grinold's maximum principle - proves a duality result for a continuous linear programming problem where the known duality theorems do not ensure the existence of dual optimal solutions. The result is then applied to study a bounded control problem which is more general than the one investigated by the author in a previous paper [Z. Angew. Math. Mech. 64, 551-556 (1984; Zbl 0569.65047)].
Recommendations
- On theory of the duality linear maximin problems with connected variables
- A Duality Theory for Separated Continuous Linear Programs
- A proof of the duality principle in linear programming
- Existence and duality theory for separated continuous linear programs
- On linear programming duality and necessary and sufficient conditions in minimax theory
- Generalized concavity and duality in continuous programming
- scientific article; zbMATH DE number 3885664
- Technical note on duality in linear vector maximization
- On the Solutions of a Class of Continuous Linear Programs
- On the extremality of maximal dual feasible functions
This page was built for publication: On duality and the maximum principle for continuous linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072942)
