Linear Programming Algorithm with Mixed Real-Integer Variables in MATLAB Environments

Date of Award

Summer 2013

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Civil & Environmental Engineering

Program/Concentration

Civil Engineering

Committee Director

Duc T. Nguyen

Committee Member

Isao Ishibashi

Committee Member

Manwo Ng

Call Number for Print

Special Collections LD4331.E542 B35 2013

Abstract

Efficient numerical procedures for solving general Linear Programming (LP) problems with mixed real-integer variables are developed in this work. The proposed algorithms employ the revised dual simplex with Branch and Bound (B&B) algorithms, with special procedures for limited search of subsequent branches. Computational time can be significantly reduced by incorporating the updated inverse formulas into the developed procedures. Both generic LP problems and deterministic pavement maintenance and rehabilitation (M&R) problems are used in this study to vaiidate the developed procedures. Medium to large-scale examples ( 11 pavement M&R) presented in this work have demonstrated that the developed numerical procedures consistently offer superior performance (I.5x to 49.2x faster) as compared to Matlab built-in function "bintprog".

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DOI

10.25777/ajd5-z339

This document is currently not available here.

Share

COinS