On ℓp programming |
| |
Authors: | T Terlaky |
| |
Institution: | Department of Operational Research, Eötvös Lorand University, Budapest, Hungary |
| |
Abstract: | Our paper treats the primal and dual program of ?p programming. ?p programming is a generalization of ?p approximation problems. There is a strict connection between ?p programming and geometrical programming, because in both of them geometrical inequality plays a fundamental role. The structure of our paper follows that of Klafszkys 1].In the first Sections duality theorems are proved, which play an important role in mathematical programming. Most of these results can be found in Petersons and Eckers 3,4,5], but our proofs are much more simple and we show these fundamental properties more detailed.Afterwards the relation between the Lagrange function and the optimal solution pair is investigated. Regularity is investigated as well and we show the marginal value of ?p programming. In the end linear programming ?p constrained ?p approximation problems, the quadratically constrained quadratic programming and compromise programming are shown as special cases of ?p programming. |
| |
Keywords: | Convex programming geometric programming multiple criteria programming quadratic programming |
本文献已被 ScienceDirect 等数据库收录! |
|