A Simple, Standard Linear Programming Scenario

2008 ◽  
Keyword(s):  
Linear Programming ◽  
Standard Linear ◽  
Standard Linear Programming

Shakedown as a Guide to the Design of Pressure Vessels

1969 ◽  
Vol 91 (3) ◽  
pp. 799-806 ◽  
Author(s):  
F. A. Leckie ◽  
R. K. Penny
Keyword(s):  
Linear Programming ◽  
Lower Bound ◽  
Pressure Vessel ◽  
Pressure Vessels ◽  
Design Decisions ◽  
Programming Techniques ◽  
Standard Linear ◽  
Standard Linear Programming

Using the theorems of plasticity lower bound estimates of shakedown loadings have been calculated for a number of shell-like structures commonly found in the pressure vessel industry. These have been determined by making use of elastic solutions, already available, in conjunction with standard linear programming techniques. Combinations of loadings and temperatures have been considered with a view to illustrating how calculations of these types can help in making design decisions.

scholarly journals An Improvement for Fuzzy Stochastic Goal Programming Problems

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Shu-Cheng Lin ◽  
Han-Wen Tuan ◽  
Peterson Julian
Keyword(s):  
Linear Programming ◽  
Goal Programming ◽  
Random Environment ◽  
Solution Process ◽  
Lower Side ◽  
Stochastic Goal Programming ◽  
Linear Programming Problems ◽  
Standard Linear ◽  
Standard Linear Programming

We examined the solution process for linear programming problems under a fuzzy and random environment to transform fuzzy stochastic goal programming problems into standard linear programming problems. A previous paper that revised the solution process with the lower-side attainment index motivated our work. In this paper, we worked on a revision for both-side attainment index to amend its definition and theorems. Two previous examples were used to examine and demonstrate our improvement over previous results. Our findings not only improve the previous paper with both-side attainment index, but also provide a theoretical extension from lower-side attainment index to the both-side attainment index.

A Geometric Algorithm for Hybrid Workpiece Localization/Envelopment Problem

1998 ◽  
Author(s):  
Y. X. Chu ◽  
J. B. Gou ◽  
Z. X. Li
Keyword(s):  
Linear Programming ◽  
Localization Problem ◽  
Euclidean Group ◽  
Geometric Algorithm ◽  
Hybrid Localization ◽  
Programming Techniques ◽  
Standard Linear ◽  
Workpiece Localization ◽  
Present Simulation ◽  
Standard Linear Programming

Abstract The problem of aligning the CAD model of a workpiece such that all points measured on the finished surfaces of the workpiece match closely to corresponding surfaces on the model while all unmachined surfaces lie outside the model to guarantee the presence of material to be machined at a later time is referred to as the hybrid localization/envelopment problem. The hybrid problem has important applications in setting up for machining of partially finished workpieces. This paper gives a formulation of the hybrid localization/envelopment problem and present a geometric algorithm for computing its solutions. First, we show that when the finished surfaces of a workpiece are inadequate to fully constrain the rigid motions of the workpiece, then the set of free motions remaining must form a subgroup G0 of the Euclidean group SE(3). This allows us to decompose the hybrid problem into a (symmetric) localization problem on the homogeneous space SE(3)/G0 and an envelopment problem on G0. While the symmetric localization problem is solved using the Fast Symmetric Localization (FSL) algorithm developed in one of our early papers, the envelopment problem is solved by computing the solutions of a sequence of linear programming (LP) problems. We derive explicitly the LP problems and apply standard linear programming techniques to solve the LP problems. We present simulation results to demonstrate efficiency of our method for the hybrid problem.

scholarly journals Unit Price Contracts: A Practical Framework For Determining Competitive Bid Prices

2011 ◽  
Vol 14 (3) ◽  
pp. 63 ◽  
Author(s):  
John E. Burnett ◽  
Bruce M. Wampler
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Capital Budgeting ◽  
Analytical Framework ◽  
Unit Price ◽  
Competitive Bidding ◽  
Bidding Strategy ◽  
Standard Linear ◽  
Bid Prices ◽  
Standard Linear Programming

<span>A general analytical framework within which to solve the competitive bidding problem is developed by considering a unit price contract. By viewing the problem in the standard capital budgeting framework and exploiting the linearity of the firms objective function and constraints, the problem can be formulated as a standard linear programming (LP) application whose solution is the optimal bid. We also investigate a so-called unbalanced bidding strategy as an effective way for bidding firms to hedge the risk, or uncertainty, inherent in may unit price contracts.</span>

scholarly journals A Hybrid Evolutionary Algorithm for Wheat Blending Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Xiang Li ◽  
Mohammad Reza Bonyadi ◽  
Zbigniew Michalewicz ◽  
Luigi Barone
Keyword(s):  
Linear Programming ◽  
Evolutionary Algorithm ◽  
Heuristic Method ◽  
Real Data ◽  
Search Space ◽  
Programming Algorithm ◽  
Hybrid Evolutionary Algorithm ◽  
Linear Programming Algorithm ◽  
Standard Linear ◽  
Blending Problem

This paper presents a hybrid evolutionary algorithm to deal with the wheat blending problem. The unique constraints of this problem make many existing algorithms fail: either they do not generate acceptable results or they are not able to complete optimization within the required time. The proposed algorithm starts with a filtering process that follows predefined rules to reduce the search space. Then the linear-relaxed version of the problem is solved using a standard linear programming algorithm. The result is used in conjunction with a solution generated by a heuristic method to generate an initial solution. After that, a hybrid of an evolutionary algorithm, a heuristic method, and a linear programming solver is used to improve the quality of the solution. A local search based posttuning method is also incorporated into the algorithm. The proposed algorithm has been tested on artificial test cases and also real data from past years. Results show that the algorithm is able to find quality results in all cases and outperforms the existing method in terms of both quality and speed.

scholarly journals Energy-Efficient UAV Communication with Multiple GTs Based on Trajectory Optimization

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Yu Xu ◽  
Lin Xiao ◽  
Dingcheng Yang ◽  
Laurie Cuthbert ◽  
Yapeng Wang
Keyword(s):  
Trajectory Optimization ◽  
Low Cost ◽  
High Mobility ◽  
Optimization Techniques ◽  
Mixed Integer ◽  
Flight Trajectory ◽  
Special Cases ◽  
Standard Linear ◽  
Standard Linear Programming

Wireless communications with unmanned aerial vehicles (UAVs) is a promising technology offering potential high mobility and low cost. This paper studies a UAV-enabled communication system, in which a fixed-wing UAV is deployed to collect information from a group of distributed ground terminals (GTs). Considering the requirements for quality of service (QoS) (i.e., the throughput of each GT is above a given threshold) and GT scheduling, we maximize the energy efficiency (EE) of the UAV in bits/Joule by optimizing the UAV’s flight trajectory. In this paper, a mixed integer nonconvex optimization problem is formulated. As that is difficult to solve, we divide the formulated problem into two subproblems and apply standard linear programming (LP) and successive convex optimization techniques. We further propose an efficient iterative algorithm that jointly optimizes GT scheduling and the UAV’s trajectory. Moreover, we set two special cases as benchmarks to measure the performance of the proposed design. The numerical results show that our proposed design achieves much better performance than the other two benchmark designs.

Sign in / Sign up

Export Citation Format

Share Document