Linear Programming

Masatoshi Sakawa, Hitoshi Yano and Ichiro Nishizaki
Additional contact information
Masatoshi Sakawa: Hiroshima University
Hitoshi Yano: Nagoya City University
Ichiro Nishizaki: Hiroshima University

Chapter Chapter 2 in Linear and Multiobjective Programming with Fuzzy Stochastic Extensions, 2013, pp 7-72 from Springer

Abstract: Abstract Since G.B. Dantzig first proposed the simplex method around 1947, linear programming, as an optimization method of maximizing or minimizing a linear objective function subject to linear constraints, has been extensively studied and, with the significant advances in computer technology, widely used in the fields of operations research, industrial engineering, systems science, management science, and computer science.

Keywords: Revised Simplex Method; Relative Cost Coefficients; Initial Basic Feasible Solution; Pivot Operation; Constant Right-hand Side (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-9399-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461493990

DOI: 10.1007/978-1-4614-9399-0_2

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().