A mathematical programming problem with a convex irregular feasible set

An exact and an approximate method for reducing a mathematical programming problem with a convex irregular feasible set to a mathematical programming problem with a regular feasible set is proposed.

Saved in:
Bibliographic Details
Published in:U.S.S.R. computational mathematics and mathematical physics 1990, Vol.30 (3), p.145-154
Main Author: Nefedov, V.N.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An exact and an approximate method for reducing a mathematical programming problem with a convex irregular feasible set to a mathematical programming problem with a regular feasible set is proposed.
ISSN:0041-5553
DOI:10.1016/0041-5553(90)90203-5