Interactive Method for Solving Multi-Objective Convex Programs

Emina Krčmar-Nožić

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Interactive Method for Solving Multi-Objective Convex Programs”

Second order convexity and a modified objective function method in mathematical programming

Tadeusz Antczak (2007)

Control and Cybernetics

Similarity:

How to treat decision problems by different programming methodologies

G. Cioni, A. Miola (1988)

Banach Center Publications

Similarity:

Reformulations in Mathematical Programming: Definitions and Systematics

Leo Liberti (2009)

RAIRO - Operations Research

Similarity:

A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...