Operations research: integer and combinatorial programming · Introduction

Introduction

What this guide covers

Introduction Introduction Mathematical Modeling and Computing · Doctoral Level

Overview

Topics covered

Introduction
Integer Programming and Combinatorial Optimization
Philosophy and Taxonomy of Integer Programming
Definition and General Mathematical Structure
The Fallacy of Linear Relaxation and Rounding
Computational Complexity and Polyhedral Geometry

Related concepts

Main connections

Compatible notation

Mathematical sample in LaTeX

The expression is rendered accessibly, with its LaTeX source preserved below.

\begin{align*} \text{minimizar} \quad & c^T x + d^T y \\ \text{subject to} \quad & A x + G y \le b \\ & x \in \mathbb{Z}^n_+ \\ & y \in \mathbb{R}^p_+ \end{align*}

View LaTeX source

\begin{align*}
      \text{minimizar} \quad & c^T x + d^T y \\
      \text{subject to} \quad & A x + G y \le b \\
      & x \in \mathbb{Z}^n_+ \\
      & y \in \mathbb{R}^p_+
      \end{align*}