# Structure and Interpretation of Dual-Feasible Functions

## TL;DR

This paper introduces new methods for generating dual-feasible functions, including a conversion from existing functions and a computer-assisted search, enhancing the understanding and construction of these functions.

## Contribution

It presents novel techniques for constructing dual-feasible functions through conversion and computational search, expanding the toolkit for researchers in the field.

## Key findings

- New families of dual-feasible functions derived from minimal Gomory--Johnson functions
- Computer-based search effectively identifies extremal dual-feasible functions
- Enhanced understanding of the structure of dual-feasible functions

## Abstract

We study two techniques to obtain new families of classical and general Dual-Feasible Functions: A conversion from minimal Gomory--Johnson functions; and computer-based search using polyhedral computation and an automatic maximality and extremality test.