Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Linear Programming Problem

Handbook of Research on Modern Optimization Algorithms and Applications in Engineering and Economics
A linear programming (LP) problem is an optimization problem which consists in finding the maximum or the minimum value of a given linear function of n real decision variables subject to a given set of linear equality or inequality constraints.
Published in Chapter:
Robust Two-Stage and Multistage Optimization: Complexity Issues and Applications
Michel Andre Minoux (University P. and M. Curie, France)
DOI: 10.4018/978-1-4666-9644-0.ch002
Abstract
This chapter is intended as an overview of robust optimization models related to optimization problems subject to uncertain data, with special focus on the case when uncertainty impacts the right-hand side coefficients in the constraints. Two-stage as well as multistage models are addressed, emphasizing links with applications and computational complexity issues. A class of multistage robust optimization problems for which exact optimal strategies can be efficiently computed (via a robust dynamic programming recursion) is discussed. An application to a multiperiod energy production planning problem is presented into detail, and computational results are reported.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
An HL7-Aware Decision Support System for E-Health
Optimization problems in which the objective function and the constraints are all linear.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR