2003•Shuxue de shijian yu renshiRequires access

A Method for Solving Linear Goal Programming by Measuring Priority Factor with Number —the Algorithm based on the Lp Process

Qi Wang

Abstract

In this paper, we present a new method for solving linear goal programming (or linear integer goal programming) by measuring priority factors with number. The linear goal programming, (or linear integer goal programming) whose priority factors have been numbered, can be solved using the LP Process for solving linear progrmming in SAS/OR software. Some examples are given for illuminating the algorithm and the programme. Finally several other questions of research led by this method are list.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Linear programming, Goal programming, Integer programming, Factor (programming language), Computer science, Linear-fractional programming, Process (computing), Branch and price