scientific article; zbMATH DE number 3197060

zbMath0122.00201MaRDI QIDQ5733470

No author found.

Publication date: 1963

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

general mathematics

Related Items (27)

A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming ⋮ Reduced Jacobian method ⋮ Symmetry in Mathematical Programming ⋮ Some duality theorems for the non-linear vector maximum problem ⋮ On Estimating Optimal Bases for Linear Programs ⋮ Ein heuristisches Verfahren zur globalen Optimierung ⋮ A brief history of the international symposia on mathematical programming ⋮ On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems ⋮ On certain polytopes associated with graphs ⋮ Optimal scaling for arbitrarily ordered categories ⋮ A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems ⋮ Gradient and gravity center method in linear and nonlinear optimization ⋮ Some Results on Sparse Matrices ⋮ The factorization approach to large-scale linear programming ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Evaluation of optimization methods for machining economics models ⋮ The complexity of linear programming ⋮ A provable better Branch and Bound method for a nonconvex integer quadratic programming problem ⋮ An algorithm for nonlinear programs over Cartesian product sets ⋮ On stochastic programming. I: Static linear programming under risk ⋮ A family of gradient projection methods ⋮ A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems ⋮ A convex form of the quadratic assignment problem ⋮ Methods of parametric non-linear programming ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:5518984 �ber die Optimierung einer bedingt konvexen Funktion unter linearen Nebenbedingungen] ⋮ Die Behandlung von Entscheidungsproblemen mit Hilfe des Dynamischen Programmierens ⋮ Verfahren der zulässigen riehtungeh unter rexmtzung reduzierter gradienten für niehtllneare optimierungsprobleme

This page was built for publication: