Skip to Main Content
Linear Programming and Algorithms for Communication Networks
book

Linear Programming and Algorithms for Communication Networks

by Eiji Oki
August 2012
Intermediate to advanced content levelIntermediate to advanced
208 pages
4h 34m
English
CRC Press
Content preview from Linear Programming and Algorithms for Communication Networks

Chapter 2

Basics of linear programming

An optimization problem is a problem that aims to find the best solution from all feasible solutions. The best solution can be the minimum or maximum solution. An example of the former is finding the route from point A to point B that takes the shortest time. An example of the latter is determining how a production factory can maximize its profit using limited materials. Both problems are optimization problems. An optimization problem can be solved by mathematical programming, a technique that expresses and solves problems as mathematic models.

This chapter explains linear programming, which is a special case of mathematical programming.

2.1 Optimization problem

A businessman must travel from city A to ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Algorithms For Dummies

Algorithms For Dummies

John Paul Mueller, Luca Massaron

Publisher Resources

ISBN: 9781466552647