Algorithmes de programmation convexe par linéarisation en format constant

DOI10.1051/M2AN/1977110302451zbMATH Open0367.90103OpenAlexW2587455209MaRDI QIDQ4145439FDOQ4145439

J. C. Fiorot

Publication date: 1977

Published in: RAIRO. Analyse numérique (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193300

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• A feasible conjugate direction method to solve linearly constrained minimization problems

This page was built for publication: Algorithmes de programmation convexe par linéarisation en format constant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145439)