Relaxation (approximation)

id: relaxation-approximation-303-9595774
title: Relaxation (approximation)
text: In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby problem that is easier to solve. A solution of the relaxed problem provides information about the original problem. For example, a linear programming relaxation of an integer programming problem removes the integrality constraint and so allows non-integer rational solutions. A Lagrangian relaxation of a complicated problem in combinatorial optimi
brand slug: wiki
category slug: encyclopedia
description:
original url: https://en.wikipedia.org/wiki/Relaxation_(approximation)
date created:
date modified: 2023-11-13T12:05:55Z
main entity: {"identifier":"Q646590","url":"https://www.wikidata.org/entity/Q646590"}
image:
fields total: 13
integrity: 13

Related Entries

Explore Next Part