Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Mathematical-programming problem

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_594

A constrained optimization problem usually stated as Minimize (Maximize) f(xv) subject to gi(xv) ≤ 0, i = 1,..., m. Depending on the form of the objective function f(xv) and the constraints gi(xv) the problem will have special properties and associated algorithms. Combinatorial and integer optimization; Convex-programming problem; Fractional programming; Geometric programming; Integer-programming problem; Linear programming; Nonlinear programming; Quadratic programming; Separable-programming problem.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA