A note on solving bicriteria linear programming problems using single criteria software

Srinivas Y. Prasad; Mark H. Karwan

doi:10.1016/0305-0548(92)90090-R

A note on solving bicriteria linear programming problems using single criteria software

Srinivas Y. Prasad
, Mark H. Karwan

Department of Industrial and Systems Engineering

SUNY Buffalo

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

An algorithm for the bicriteria linear programming problem is presented. The algorithm determines the set of efficient extreme points in objective function space and involves solving a sequence of single criteria linear programming problems and can thus be used with any LP package.

Original language	English
Pages (from-to)	169-173
Number of pages	5
Journal	Computers and Operations Research
Volume	19
Issue number	2
DOIs	https://doi.org/10.1016/0305-0548(92)90090-R
State	Published - Feb 1992

Access to Document

10.1016/0305-0548(92)90090-R

Cite this

@article{47357fba88444d0c87be38db2ca77578,

title = "A note on solving bicriteria linear programming problems using single criteria software",

abstract = "An algorithm for the bicriteria linear programming problem is presented. The algorithm determines the set of efficient extreme points in objective function space and involves solving a sequence of single criteria linear programming problems and can thus be used with any LP package.",

author = "Prasad, \{Srinivas Y.\} and Karwan, \{Mark H.\}",

year = "1992",

month = feb,

doi = "10.1016/0305-0548(92)90090-R",

language = "English",

volume = "19",

pages = "169--173",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "2",

}

TY - JOUR

T1 - A note on solving bicriteria linear programming problems using single criteria software

AU - Prasad, Srinivas Y.

AU - Karwan, Mark H.

PY - 1992/2

Y1 - 1992/2

N2 - An algorithm for the bicriteria linear programming problem is presented. The algorithm determines the set of efficient extreme points in objective function space and involves solving a sequence of single criteria linear programming problems and can thus be used with any LP package.

AB - An algorithm for the bicriteria linear programming problem is presented. The algorithm determines the set of efficient extreme points in objective function space and involves solving a sequence of single criteria linear programming problems and can thus be used with any LP package.

UR - https://www.scopus.com/pages/publications/0026818405

U2 - 10.1016/0305-0548(92)90090-R

DO - 10.1016/0305-0548(92)90090-R

M3 - Article

AN - SCOPUS:0026818405

SN - 0305-0548

VL - 19

SP - 169

EP - 173

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 2

ER -

A note on solving bicriteria linear programming problems using single criteria software

Abstract

Access to Document

Other files and links

Fingerprint

Cite this