scientific article
From MaRDI portal
Publication:3322715
zbMath0537.49016MaRDI QIDQ3322715
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Duality theory (optimization) (49N15) Methods of successive quadratic programming type (90C55) Mathematical programming (90C99)
Related Items (11)
A simplex algorithm for piecewise-linear programming I: Derivation and proof ⋮ The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem ⋮ An approach for the convex feasibility problem via monotropic programming ⋮ An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems ⋮ A simplex algorithm for piecewise-linear fractional programming problems ⋮ Piecewise-linear programming: The compact (CPLP) algorithm ⋮ Duality in Countably Infinite Monotropic Programs ⋮ Relaxation methods for monotropic programs ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Duality for extended infinite monotropic optimization problems ⋮ A unified framework for primal-dual methods in minimum cost network flow problems
This page was built for publication:
